Question 2
Question 3
When using the binary search algorithm on a sorted list, consider the maximum number of comparisons it might take in the worst-case scenario to find an item or confirm it's absent. If the total number of items in this sorted list is doubled, how does this maximum number of comparisons change?
It doubles
It remains the same
It becomes half
It increases by 1
13 more questions in this paper
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.
More on the PDSA Quiz 1 13 Jul 2025 paper
The IIT Madras BS Programming, Data Structures and Algorithms using Python (PDSA) Quiz 1 paper sat on 13 Jul 2025, in the May 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 1 13 Jul 2025 at a glance |
|---|---|
| Term | May 2025 term |
| Subject | Programming, Data Structures and Algorithms using Python |
| Course code | BSCS2002 |
| Questions | 16 |
| Marks | 50 |
| Duration | 120 min |
| MCQ | 9 |
| MSQ | 3 |
| Numerical | 4 |
| Official paper | IIT M DIPLOMA AN EXAM QDD2 13 July 2025 |
| Negative marking | No negative marking. |
| Updated |