Quiz Space

Programming, Data Structures and Algorithms using Python · Quiz 2 · 23 Nov 2025 · September 2025 term

Question 12: Consider a problem scenario where you have to conduct\ j…

Question 12

+3 marksOne correct option

Consider a problem scenario where you have to conduct
job interviews
. Each candidate is available only between start_time and end_time. If any interview finishes at time T, then the other interviews can be started at time T or afterwards.
Which of the following greedy strategies would you apply to schedule the interviews such that the maximum number of candidates can be interviewed without any conflicts?

  1. A

    Always choose the candidate whose start_time is at the earliest.

  2. B

    Always choose the candidate who is available for the shortest time.

  3. C

    Always choose the candidate whose availability overlaps with the minimum number of other candidates.

  4. D

    Always choose the candidate whose end_time is the earliest.

Show answer

Correct answer

  • D

    Always choose the candidate whose end_time is the earliest.

See the whole paperTake it as a mock test

Question 12 of 16 in the IIT Madras BS Programming, Data Structures and Algorithms using Python (PDSA) Quiz 2 paper sat on 23 Nov 2025, in the September 2025 term (IIT M DIPLOMA AN EXAM QDD2 23 Nov 2025 NEW). It carries 3 marks.

More questions from this paper

  1. Q1In the given graph, if we try to find the shortest path from node P to all other nodes using Dijkstra’s algorithm, whic…
  2. Q2Consider the following algorithm to solve the single source shortest path problem for a graph (directed or undirected) …
  3. Q3What is the weight of a minimum spanning tree in the graph given below?
  4. Q4Let\ be a connected undirected graph with distinct positive edge weights.Consider a partition (cut) of the vertex set\ …
  5. Q5Consider a max-heap of size\ consisting of distinct elements and implemented using an array. Which of the following ope…
  6. Q6Consider a max-heap of size\ consisting of distinct elements and implemented using an array.Which of the following stat…
  7. Q7The height of a binary search tree is defined as the number of nodes in the longest path from the root to the leaf (bot…
  8. Q8The height of a binary search tree is defined as the number of nodes in the longest path from the root to the leaf (bot…
  9. Q9What is the minimum number of nodes possible in an AVL tree of height 6 ? Consider the tree with a single node having h…
  10. Q10After inserting the following elements into an empty AVL Tree:\ 30, 20, 10, 28, 25, 40\ Which of the following nodes wi…
  11. Q11Given below is a set of characters and their frequencies: Using Huffman encoding, construct the Huffman tree for this s…
  12. Q13In an integer list L of length n, two elements L[i] and L[j] form an inversion if L[i] > L[j] and i \< j. Consider a li…
  13. Q14Which of the following statements is incorrect?
  14. Q15Consider the following recursive function to return the minimum element in the list L of size n. def find_min(L, low, h…
  15. Q16Consider the following recurrences and choose the correct option. 1. 2. Base Case: