Quiz Space

Programming, Data Structures and Algorithms using Python · End Term · 10 May 2026 · January 2026 term · Set 1-2

Question 21: A technology training institute offers an advanced certi…

Question 21

+5 marksNumerical answer

A technology training institute offers an advanced certification program consisting of 10 modules. The program is divided into terms of 4 months.
Students may enroll in any number of modules in a term, but a module can only be taken after completing all of its prerequisite modules.
The prerequisite structure is given below.

There is no restriction on the number of modules a student can take in a term.
The minimum number of terms required to complete all 10 modules is ___.

Show answer

Correct answer: 6

See the whole paperTake it as a mock test

Question 21 of 24 in 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 (Programming, Data Structures And Algorithms Using Python 10 May 26). It carries 5 marks.

More questions from this paper

  1. Q1Consider the following function:
  2. Q2In a binary tree, the total number of nodes is 28. It is known that 10 nodes have exactly two children.\ How many nodes…
  3. Q3While inserting the elements 60, 30, 50, 55, 80, 90, 65, 70, and 10 into an empty binary search tree (BST) in the seque…
  4. Q4How many bits will be used to encode the message ABCDE using Huffman codes?
  5. Q5Figure question
  6. Q6Figure question
  7. Q7Figure question
  8. Q8Figure question
  9. Q9Figure question
  10. Q10Run BFS starting from vertex A. If multiple adjacent vertices exist, they are visited in alphabetical order.\ Which of …
  11. Q11Figure question
  12. Q12The Bellman-Ford algorithm cannot be used if a graph has negative cycles. This is because:
  13. Q13While inserting the elements 8, 4, 1, 3, 9, 2, and 11 in an empty AVL tree in the given sequence, the leaf elements are.
  14. Q14Figure question
  15. Q15Figure question
  16. Q16Figure question
  17. Q17Figure question
  18. Q18Figure question
  19. Q19Let G be a simple graph with 25 vertices and 50 edges. The size of the minimum vertex cover of G is 10. What is the siz…
  20. Q20Which of the following could be possible insertion orders that produce this table?
  21. Q22Figure question
  22. Q23Consider the following graph. Which of the following options correctly represents the shortest distances from node 0 to…
  23. Q24Consider the graph G given below. Let Minimum Spanning Trees (MSTs) of the graph be constructed using algorithms such a…