CS301 Final Term Quiz 4 File 2 July 2023 by Miss Mehwish
- Type
- Final term past paper
- Course
- CS301 Data Structures
- Size
- PDF 541 KB
- Updated
- 23 Oct 2026
You get 3 free files a day on the website. Add the Chrome extensionSign in with the extension for 30 a day.
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
Related CS301 files
All CS301 files →- CS301 Final Term Quiz 4 July 2023 by Miss Mehwish Final term PDF 538 KB
- CS301 Final Term Quiz 3 July 2023 by Miss Mehwish Final term PDF 537 KB
- CS301 Final Term Quiz 4 Jan 2024 by Miss Mehwish Final term PDF 420 KB
- CS301 Final Term Sample Paper Fall 2022 Final term PDF 110 KB
- CS301 Highlighted Handouts by World of Education Highlighted PDF 13 MB
- CS301 Quiz 2023 Quiz PDF 3.4 MB
Get more out of VUBuddy, for free
- Unlimited downloads
- The explanation behind every MCQ answer
- Study offline on slow data
- 30 downloads a day instead of 3
- Sign in and buy Pro Semester here
One Pro Semester membership works in both the extension and the app.