Home / Study library / Programming, Data Structures and Algorithms using Python / End Term · May 2025 Programming, Data Structures and Algorithms using Python · End Term · May 2025 · AN
Programming, Data Structures and Algorithms using Python · End Term · May 2025 AN
← Course papers · Start practice / exam
This page contains the reliably extracted subset, not the complete original paper.
Questions and published explanations below are available without starting a test. Some questions may not have a published solution yet.
0 / 25 published solutions
Q2 Q3 Q4 Q5 Q6 Q7 Q8 Q9 Q10 Q11 Q12 Q13 Q14 Q15 Q16 Q17 Q18 Q19 Q20 Q21 Q22 Q23 Q24 Q25 Q26
Question 2 MCQ · 4.0 marks A. B. C. D. A published solution is not available for this question yet.
Report a correction for Q2
Question 3 MCQ · 4.0 marks A. B. C. D. A published solution is not available for this question yet.
Report a correction for Q3
Question 4 MCQ · 4.0 marks A. B. C. D. A published solution is not available for this question yet.
Report a correction for Q4
Question 5 MCQ · 4.0 marks Consider the following statements:
1. While creating a DFS tree for a directed graph, among non-tree edges, only back edges
correspond to cycles.
2. The depth of any DFS tree rooted at a vertex is at least as much as the depth of any BFS tree
rooted at the same vertex.
Choose the correct option.
A. Only statement 1 is true
B. Only statement 2 is true
C. Both statements 1 and 2 are true
D. Both statements 1 and 2 are false
A published solution is not available for this question yet.
Report a correction for Q5
Question 6 MCQ · 4.0 marks Given a graph where all edges have positive weights, the shortest path identified by Dijkstra's and
Bellman Ford algorithm may be different but path weight would be same.
A published solution is not available for this question yet.
Report a correction for Q6
Question 7 MCQ · 4.0 marks A published solution is not available for this question yet.
Report a correction for Q7
Question 8 MCQ · 4.0 marks A. B. C. D. A published solution is not available for this question yet.
Report a correction for Q8
Question 9 MCQ · 4.0 marks A. B. C. D. A published solution is not available for this question yet.
Report a correction for Q9
Question 10 MCQ · 4.0 marks A published solution is not available for this question yet.
Report a correction for Q10
Question 11 MCQ · 4.0 marks A. B. C. D. A published solution is not available for this question yet.
Report a correction for Q11
Question 12 MCQ · 4.0 marks A. B. C. D. A published solution is not available for this question yet.
Report a correction for Q12
Question 13 MCQ · 4.0 marks A published solution is not available for this question yet.
Report a correction for Q13
Question 14 MCQ · 4.0 marks A. Only statement 1 is correct
B. Only statement 2 is correct
C. Both the statements are correct
D. Both the statements are wrong
A published solution is not available for this question yet.
Report a correction for Q14
Question 15 MCQ · 4.0 marks A. B. C. D. A published solution is not available for this question yet.
Report a correction for Q15
Question 16 MSQ · 4.0 marks A. B. C. D. A published solution is not available for this question yet.
Report a correction for Q16
Question 17 MSQ · 4.0 marks A published solution is not available for this question yet.
Report a correction for Q17
Question 18 MSQ · 4.0 marks A published solution is not available for this question yet.
Report a correction for Q18
Question 19 MSQ · 4.0 marks A published solution is not available for this question yet.
Report a correction for Q19
Question 20 MSQ · 4.0 marks A published solution is not available for this question yet.
Report a correction for Q20
Question 21 MSQ · 4.0 marks A. B. C. D. E. F. A published solution is not available for this question yet.
Report a correction for Q21
Question 22 NAT · 4.0 marks What is the **maximum** number of edges in a **directed graph** with **9** vertices?
A published solution is not available for this question yet.
Report a correction for Q22
Question 23 NAT · 4.0 marks A published solution is not available for this question yet.
Report a correction for Q23
Question 24 NAT · 4.0 marks What is the **minimum** possible height of a **binary tree** with 12 nodes (assuming the empty tree
height is 0)?
A published solution is not available for this question yet.
Report a correction for Q24
Question 25 NAT · 4.0 marks A published solution is not available for this question yet.
Report a correction for Q25
Question 26 NAT · 4.0 marks A published solution is not available for this question yet.
Report a correction for Q26