Skip to content
VUBuddy

CS301 Final Term Quiz 4 File 2 July 2023 by Miss Mehwish

Data Structures PDF 541 KBUpdated 23 Oct 2026
Final term past paper CS301 Final Term Quiz 4 File 2 July 2023 by Miss Mehwish PDF 541 KB
vubuddy.com
Type
Final term past paper
Course
CS301 Data Structures
Size
PDF 541 KB
Updated
23 Oct 2026
Free download 0 of 3 used today
Download free · 541 KB

You get 3 free files a day on the website. Add the Chrome extension for 30 a day.

Unlimited downloads in the Android app Get it free on Google Play

Preview text

Text from pages 1, 2, 3 of 4. Download the file for all 4 pages.

We also provide Past papers for Mids. and Finals Cross Check your answers befo re submitting directly from the file. We are not responsible for 100% correction as human error exists

MCQ 1: Which of the following methods is appropriate for constructing a min heap when the whole data is given? a) BuildHeap method b) Insert method c) Both Insert and BuildHeap methods are inappropriate d) Both Insert and BuildHeap methods are equally appropriate

Correct option: a) BuildHeap method

MCQ 2: If the height of a perfect binary tree is 4, what will be the total number of nodes in it? a) 15 b) 16 c) 32 d) 31

Correct option: d) 31

MCQ 3: In a perfect binary tree, what is the arrangement of internal nodes with respect to child nodes? a) Internal nodes have exactly two child nodes b) Internal nodes have only a left child c) Internal nodes have only a right child d) Leaf nodes are situated at different levels

Correct option: a) Internal nodes have exactly two child nodes

MCQ 4: In deletion, which method reorganizes the min heap? a) DecreaseKey b) IncreaseKey c) Percolate_Below d) PercolateDown

Correct option: d) PercolateDown

MCQ 5: Suppose there are 100 elements in an equivalence class, so initially there will be 100 trees. The collection of these trees is called: a) Forest b) Bunch c) BunchBunchBunchClass d) None of the above

Correct option: a) Forest

MCQ 6: Given the values are the array representation of a heap: 12, 23, 26, 31, 34, 44, 56, 64, 78, 100. If we perform 4 deleteMin operations, what is the last element deleted? a) 31 b) 34 c) 44 d) 64

Correct option: a) 31

MCQ 7: Which of the following heap methods lowers the value of the key at position 'p' by the amount 'delta'? a) percolateDown(p, delta) b) remove(p, delta) c) decreaseKey(p, delta) d) increaseKey(p, delta)

Correct option: c) decreaseKey(p, delta)

MCQ 8: In a perfect binary tree of height h, the total number of nodes N is given by the formula: a) 2h + 1 – 1 b) 2h - 1 + 1 c) 2h + 1 + 2h - 1 – 1 d) 2h - 1 – 1

Correct option: a) 2h + 1 – 1

All CS301 files →
CS301 Data Structures All CS301 handouts, past papers, quizzes and MCQs in one place. Open course page

Get more out of VUBuddy, for free

Android app Free on Google Play
  • Unlimited downloads
  • The explanation behind every MCQ answer
  • Study offline on slow data
Get the Android app
Chrome extension Free on the Chrome Web Store
  • 30 downloads a day instead of 3
  • Sign in and buy Pro Semester here
Add to Chrome

One Pro Semester membership works in both the extension and the app.