Home / Study library / Programming, Data Structures and Algorithms using Python / End Term · Jan 2025 Programming, Data Structures and Algorithms using Python · End Term · Jan 2025 · AN
Programming, Data Structures and Algorithms using Python · End Term · Jan 2025 AN
← Course papers · Start practice / exam
Questions and published explanations below are available without starting a test. Some questions may not have a published solution yet.
0 / 25 published solutions
Q23 Q24 Q25 Q26 Q27 Q28 Q29 Q30 Q31 Q32 Q33 Q34 Q35 Q36 Q37 Q38 Q39 Q40 Q41 Q42 Q43 Q44 Q45 Q46 Q47
Question 23 MCQ · 4.0 marks A. B. C. D. A published solution is not available for this question yet.
Report a correction for Q23
Question 24 MCQ · 4.0 marks A published solution is not available for this question yet.
Report a correction for Q24
Question 25 MCQ · 4.0 marks What is the **worst case** time complexity of **Selection Sort** ?
A. B. C. D. A published solution is not available for this question yet.
Report a correction for Q25
Question 26 MCQ · 4.0 marks A. B. C. D. A published solution is not available for this question yet.
Report a correction for Q26
Question 27 MCQ · 4.0 marks Consider a graph **G** with **V** vertices and **E** edges represented using an adjacency list. What is the
worst case complexity for Breadth First Search?
A. B. C. D. A published solution is not available for this question yet.
Report a correction for Q27
Question 28 MCQ · 4.0 marks A published solution is not available for this question yet.
Report a correction for Q28
Question 29 MCQ · 4.0 marks A. [41, 29, 26, 17, 15, 10, 9, 12, 11]
B. [41, 29, 26, 17, 15, 10, 9, 11, 12]
C. [41, 29, 26, 15, 17, 10, 9, 11, 12]
D. [41, 29, 26, 15, 17, 10, 9, 12, 11]
A published solution is not available for this question yet.
Report a correction for Q29
Question 30 MCQ · 4.0 marks While inserting the elements [13, 7, 26, 33, 5, 10, 12, 11, 9] in an empty binary search tree (BST) in
the sequence shown, the element at maximum depth is__.
A published solution is not available for this question yet.
Report a correction for Q30
Question 31 MCQ · 4.0 marks A published solution is not available for this question yet.
Report a correction for Q31
Question 32 MCQ · 4.0 marks A. B. C. D. A published solution is not available for this question yet.
Report a correction for Q32
Question 33 MCQ · 4.0 marks A published solution is not available for this question yet.
Report a correction for Q33
Question 34 MCQ · 4.0 marks A published solution is not available for this question yet.
Report a correction for Q34
Question 35 MCQ · 4.0 marks A published solution is not available for this question yet.
Report a correction for Q35
Question 36 MSQ · 4.0 marks A. B. C. D. A published solution is not available for this question yet.
Report a correction for Q36
Question 37 MSQ · 4.0 marks A published solution is not available for this question yet.
Report a correction for Q37
Question 38 MSQ · 4.0 marks Which of the following statement is/are **false**?
A. B. C. D. A published solution is not available for this question yet.
Report a correction for Q38
Question 39 MSQ · 4.0 marks Which of the below statements are **true** about Dynamic programming?
A. Increases both time complexity and space complexity.
B. It replaces recursion with iteration, so there are no stack overflow errors.
C. Increases time complexity and decreases space complexity.
D. It avoids computing sub-problems more than once.
A published solution is not available for this question yet.
Report a correction for Q39
Question 40 MSQ · 4.0 marks Which of these correspond to non-polynomial time complexity?
A. B. C. D. E. A published solution is not available for this question yet.
Report a correction for Q40
Question 41 MSQ · 4.0 marks A. B. C. D. E. A published solution is not available for this question yet.
Report a correction for Q41
Question 42 NAT · 4.0 marks A published solution is not available for this question yet.
Report a correction for Q42
Question 43 NAT · 4.0 marks A published solution is not available for this question yet.
Report a correction for Q43
Question 44 NAT · 4.0 marks A published solution is not available for this question yet.
Report a correction for Q44
Question 45 NAT · 4.0 marks A published solution is not available for this question yet.
Report a correction for Q45
Question 46 NAT · 4.0 marks A published solution is not available for this question yet.
Report a correction for Q46
Question 47 NAT · 4.0 marks A published solution is not available for this question yet.
Report a correction for Q47