Question 1
Consider the following function:
Question 2
In a binary tree, the total number of nodes is 28. It is known that 10 nodes have exactly two children.
How many nodes have exactly one child?
Question 3
While inserting the elements 60, 30, 50, 55, 80, 90, 65, 70, and 10 into an empty binary search tree (BST) in the sequence shown, the sum of elements at maximum depth is __.
21 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 10 May 2026 Set 1-2 paper
The IIT Madras BS Programming, Data Structures and Algorithms using Python (PDSA) End Term paper sat on 10 May 2026, in the January 2026 term, set 1-2: 24 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 10 May 2026 Set 1-2 at a glance |
|---|---|
| Term | January 2026 term |
| Subject | Programming, Data Structures and Algorithms using Python |
| Course code | BSCS2002 |
| Questions | 24 |
| Marks | 100 |
| Duration | 180 min |
| Numerical | 7 |
| MCQ | 15 |
| MSQ | 2 |
| Official paper | Programming, Data Structures And Algorithms Using Python 10 May 26 |
| Negative marking | No negative marking. |
| Updated |