Quiz Space

Programming, Data Structures and Algorithms using Python · End Term · 3 Apr 2022 · January 2022 term · Set AN1

Question 2: Which of the following statements is/are true about the Q…

Question 2

+3 marksOne correct option

Which of the following statements is/are true about the Quicksort algorithm? Assume that the first element in the list selected as pivot for partitioning each time.
I. The best case is when the pivot element always divides the list into two equal halves. II. The worst case is when the input list is arranged in either ascending or descending order.

  1. A

    Only I

  2. B

    Only II

  3. C

    Both I and II

  4. D

    None

Show answer

Correct answer

  • C

    Both I and II

See the whole paperTake it as a mock test

Question 2 of 30 in the IIT Madras BS Programming, Data Structures and Algorithms using Python (PDSA) End Term paper sat on 3 Apr 2022, in the January 2022 term (IIT M FOUNDATION DIPLOMA ENDTERM FN1 3 Apr 2022). It carries 3 marks.

More questions from this paper

  1. Q1Figure question
  2. Q3Figure question
  3. Q4Figure question
  4. Q5Figure question
  5. Q6Figure question
  6. Q7Figure question
  7. Q8A data structure is required for storing a set of integers such that each of the following operations can be done in O(…
  8. Q9Suppose the letters {a, b, c, d, e} occur with the following frequencies. How many bits will be used to encode the lett…
  9. Q10Figure question
  10. Q11Figure question
  11. Q12Figure question
  12. Q13Figure question
  13. Q14Which of the following option represents the fail function (or prefix function) for pattern 'bonbon' in the Knuth-Morri…
  14. Q15A problem in NP is NP-complete if_
  15. Q16A company makes two kinds of leather belts, belt A and belt B. Belt A is a high quality belt and belt B is of lower qua…
  16. Q17Figure question
  17. Q18Figure question
  18. Q19Figure question
  19. Q20Figure question
  20. Q21Figure question
  21. Q22Suppose we obtain the following BFS tree rooted at node G for an undirected graph with vertices {A, B, C, D, E, F, G, H…
  22. Q23Which of the following statement is true about Dijkstra's algorithm to find shortest path?
  23. Q24Which of the following statements is true about binary trees? Assume that the height of the empty tree is 0.
  24. Q25What is the weight of the minimum spanning tree for the given graph?\ NOTE: Enter your answer to the nearest integer.
  25. Q26NOTE: Enter your answer to the nearest integer.
  26. Q27NOTE: Enter your answer to the nearest integer.
  27. Q28NOTE: Enter your answer to the nearest integer.
  28. Q29Based on the above data, answer the given subquestions.
  29. Q30Based on the above data, answer the given subquestions.