Quiz Space

Programming, Data Structures and Algorithms using Python · End Term · 3 Sept 2023 · May 2023 term · Set QPD1-S1

PDSA End Term 3 Sept 2023 — Question 15

Question 15

+4 marksOne correct option
  1. A

    [0, 0, 1, 2, 1, 1, 2, 3]

  2. B

    [0, 0, 1, 1, 2, 1, 2, 0]

  3. C

    [0, 0, 1, 2, 0, 1, 2, 0]

  4. D

    [0, 0, 1, 1, 1, 0, 1, 2]

Show answer

Correct answer

  • C

    [0, 0, 1, 2, 0, 1, 2, 0]

See the whole paperTake it as a mock test

Question 15 of 26 in the IIT Madras BS Programming, Data Structures and Algorithms using Python (PDSA) End Term paper sat on 3 Sept 2023, in the May 2023 term (IIT M DIPLOMA ET1 EXAM QPD1 S2 03 Sep). It carries 4 marks.

More questions from this paper

  1. Q1Figure question
  2. Q2Which of the following statement(s) is/are true?
  3. Q3Figure question
  4. Q4Which of the following sorting algorithms will have the same time complexity irrespective of the sequence of elements i…
  5. Q5Which of the following statement(s) is/are correct with regard to the given Selection Sort? 1. Selection sort is stable…
  6. Q6Figure question
  7. Q7Figure question
  8. Q8An airline serves 1000 cities and runs 4500 direct flights each day between these cities. Which of the following is a g…
  9. Q9Consider the following graph If Dijkstra algorithm is used with A as the source vertex then what is the order in which …
  10. Q10The post-order traversal of a binary search tree with integer values produces the following sequence: 7, 5, 14, 12, 10,…
  11. Q11If we do not maintain the height of subtrees at each node in an AVL tree, then what will be the upper bound of running …
  12. Q12Figure question
  13. Q13Figure question
  14. Q14Figure question
  15. Q16Figure question
  16. Q17Figure question
  17. Q18Consider the following DAG How many possible topological orderings are there for the given DAG ?
  18. Q19Consider the graph G given below. The number of minimum cost spanning tree for the given graph is.
  19. Q20In a binary tree T of 25 nodes, if the number of nodes with two children is 6, then the number of nodes with one child …
  20. Q21Figure question
  21. Q22Figure question
  22. Q23Figure question
  23. Q24Figure question
  24. Q25Figure question
  25. Q26Let G be a graph. The size of the minimum vertex cover of G is 12 and the size of the maximum independent set of G is 1…