Question 2
2
3
4
5
Question 3
What is the worst case time complexity of Selection Sort ?
22 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 End Term 13 Apr 2025 Set QDD3 paper
The IIT Madras BS Programming, Data Structures and Algorithms using Python (PDSA) End Term paper sat on 13 Apr 2025, in the January 2025 term, set QDD3: 25 questions for 100 marks in 180 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 End Term 13 Apr 2025 Set QDD3 at a glance |
|---|---|
| Term | January 2025 term |
| Subject | Programming, Data Structures and Algorithms using Python |
| Course code | BSCS2002 |
| Questions | 25 |
| Marks | 100 |
| Duration | 180 min |
| MCQ | 13 |
| MSQ | 6 |
| Numerical | 6 |
| Official paper | IIT M DIPLOMA AN EXAM QDD3 13 Apr 2025 |
| Negative marking | No negative marking. |
| Updated |