Question 1
Consider the following function:
The function is called as:
How many recursive calls will be made by the function excluding the first main call?
Question 2
In a binary tree, suppose there are: 14 nodes with two children, and• 6 nodes with exactly one child.• How many leaf nodes does the tree have?
Question 3
While inserting the elements 50, 80, 20, 60, 10, 45, 65, 30, and 90 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 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: 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 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 | 12 |
| MSQ | 5 |
| Official paper | Programming, Data Structures And Algorithms Using Python 10 May 26 |
| Negative marking | No negative marking. |
| Updated |