Quiz Space

Programming, Data Structures and Algorithms using Python · End Term · 31 Aug 2025 · May 2025 term · Set QDD1

PDSA End Term 31 Aug 2025 — Question 21

Question 21

+4 marksNumerical answer
Show answer

Correct answer: 8

See the whole paperTake it as a mock test

Question 21 of 25 in the IIT Madras BS Programming, Data Structures and Algorithms using Python (PDSA) End Term paper sat on 31 Aug 2025, in the May 2025 term (IIT M DIPLOMA AN EXAM QDD3 31 Aug 2025). It carries 4 marks.

More questions from this paper

  1. Q1Figure question
  2. Q2Figure question
  3. Q3Figure question
  4. Q4Figure question
  5. Q5Figure question
  6. Q6Given a weighted graph where weights of all edges are unique, there is always a unique shortest path from a source to d…
  7. Q7Figure question
  8. Q8Figure question
  9. Q9Figure question
  10. Q10Figure question
  11. Q11Figure question
  12. Q12Figure question
  13. Q13Figure question
  14. Q14Figure question
  15. Q15Which of the following sorting algorithms will have the same time complexity irrespective of the sequence of elements i…
  16. Q16Figure question
  17. Q17Figure question
  18. Q18Figure question
  19. Q19Figure question
  20. Q20An undirected graph has 300 edges. What is the minimum number of vertices it must have?
  21. Q22Figure question
  22. Q23A binary tree has 7 nodes. What is the minimum possible height of this tree (assuming the empty tree height is 0)?
  23. Q24Figure question
  24. Q25Figure question