Question 1
P R T S U Q V
P R T S Q U V
P R T U S V Q
P R T S U V Q
P R T S U Q V
P R T S Q U V
P R T U S V Q
P R T S U V Q
Only statement I is true
Only statement II is true
Both statements are true
Both statements are not true
What is the minimum and maximum number of nodes possible in AVL Trees with height 9? Assume that the height of the empty tree is 0.
Minimum: 255, Maximum: 1023
Minimum: 9, Maximum: 255
Minimum: 88, Maximum: 511
Minimum: 256, Maximum: 511
Sign in with Google — it is free — to see every question with its answer and explanation, practise it in learning mode, or take it as a timed mock test.
The IIT Madras BS Programming, Data Structures and Algorithms using Python (PDSA) Quiz 2 paper sat on 16 Mar 2025, in the January 2025 term: 16 questions for 50 marks in 120 minutes. The first 3 questions are below. Sign in with Google — it is free — to see the whole paper with its answers and explanations, in learning mode or as a timed mock test.
| Feature | PDSA Quiz 2 16 Mar 2025 at a glance |
|---|---|
| Term | January 2025 term |
| Subject | Programming, Data Structures and Algorithms using Python |
| Course code | BSCS2002 |
| Questions | 16 |
| Marks | 50 |
| Duration | 120 min |
| MCQ | 10 |
| MSQ | 2 |
| Numerical | 4 |
| Official paper | IIT M DIPLOMA AN EXAM QDD2 16 Mar 2025 |
| Negative marking | No negative marking. |
| Updated |