Quiz Space

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

PDSA End Term 3 Apr 2022 — Question 29

Question 29

+4 marksOne correct option

Based on the above data, answer the given subquestions.

  1. A

    length of the longest strictly decreasing subsequence

  2. B

    length of the longest strictly increasing subsequence

  3. C

    length of the longest contiguous strictly decreasing sequence

  4. D

    length of the longest contiguous strictly increasing sequence

Show answer

Correct answer

  • A

    length of the longest strictly decreasing subsequence

See the whole paperTake it as a mock test

Question 29 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 4 marks.

More questions from this paper

  1. Q1Figure question
  2. Q2Which of the following statements is/are true about the Quicksort algorithm? Assume that the first element in the list …
  3. Q3Figure question
  4. Q4Figure question
  5. Q5Figure question
  6. Q6Figure question
  7. Q7Figure question
  8. Q8A data structure is required for storing a set of integers such that each of the following operations can be done in O(…
  9. Q9Suppose the letters {a, b, c, d, e} occur with the following frequencies. How many bits will be used to encode the lett…
  10. Q10Figure question
  11. Q11Figure question
  12. Q12Figure question
  13. Q13Figure question
  14. Q14Which of the following option represents the fail function (or prefix function) for pattern 'bonbon' in the Knuth-Morri…
  15. Q15A problem in NP is NP-complete if_
  16. 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…
  17. Q17Figure question
  18. Q18Figure question
  19. Q19Figure question
  20. Q20Figure question
  21. Q21Figure question
  22. 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…
  23. Q23Which of the following statement is true about Dijkstra's algorithm to find shortest path?
  24. Q24Which of the following statements is true about binary trees? Assume that the height of the empty tree is 0.
  25. Q25What is the weight of the minimum spanning tree for the given graph?\ NOTE: Enter your answer to the nearest integer.
  26. Q26NOTE: Enter your answer to the nearest integer.
  27. Q27NOTE: Enter your answer to the nearest integer.
  28. Q28NOTE: Enter your answer to the nearest integer.
  29. Q30Based on the above data, answer the given subquestions.