Indian Institute of Technology Madras
BS Degree Programme · Examination & Study Paper
Programming, Data Structures and Algorithms using Python
Heaps & priority queues
Official Paper
Examination Instructions & Guidelines
- Solve on notebook/paper first before checking solutions.
- MCQ: Exactly 1 option is correct. Negative marking applies.
- Scientific calculator allowed for all calculations.
- Official answer key is sealed at the end of this sheet.
End Term · 31 Aug 2025 (FN)End Term
- Q1MCQ4 Marks·Choose one option
- A[65, 50, 55, 30, 40, 35, 45, 10, 20]
- B[65, 50, 55, 40, 30, 35, 45, 10, 20]
- C[65, 55, 50, 40, 30, 35, 45, 10, 20]
- D[65, 50, 55, 40, 30, 35, 45, 20, 10]
End Term · 31 Aug 2025 (AN)End Term
- Q2MCQ4 Marks·Choose one option
- A
- B
- C
- D
- A
Quiz 2 · 3 Aug 2025 (AN)Quiz 2
- Q3MCQ4 Marks·Choose one option
- A[12, 18, 20, 19, 32, 37, 27, 26, 29]
- B[12, 18, 20, 19, 32, 27, 37, 29, 26]
- C[12, 18, 19, 20, 27, 32, 37, 29, 26]
- D[12, 20, 18, 19, 32, 27, 37, 26, 29]
- Q4MCQ3 Marks·Choose one option
- A71
- B36
- C37
- D29
End Term · 13 Apr 2025 (AN)End Term
- Q5MCQ4 Marks·Choose one option
- A[41, 29, 26, 17, 15, 10, 9, 12, 11]
- B[41, 29, 26, 17, 15, 10, 9, 11, 12]
- C[41, 29, 26, 15, 17, 10, 9, 11, 12]
- D[41, 29, 26, 15, 17, 10, 9, 12, 11]
End Term · 22 Dec 2024 (AN)End Term
- Q6MCQ4 Marks·Choose one option
Consider a complete binary tree with n nodes, where the left and the right subtrees of the root are min heaps. The upper bound to convert the tree to a min heap by an efficient algorithm is _______.
- A
- B
- C
- D
- A