CUET-PG SERIES Computer-science
Graph Traversals
2 previous year questions.
Volume: 2 Ques
Yield: Medium
High-Yield Trend
2
2025 Chapter Questions 2 MCQs
01
PYQ 2025
medium
computer-science ID: cuet-pg-
Which of the following is not an application of DFS?
1
Topological Sort
2
Determining Strongly Connected Components in a graph
3
Finding minimum distance to a node in an unweighted graph optimally
4
Solving Maze Problem
02
PYQ 2025
medium
computer-science ID: cuet-pg-
Consider the task of finding the shortest path in an unweighted graph by using BFS and DFS. Which of the following statements are true?
(A). BFS always finds the shortest path.
(B). DFS always finds the shortest path.
(C). DFS does not guarantee finding the shortest path.
(D). BFS does not guarantee finding the shortest path.
(A). BFS always finds the shortest path.
(B). DFS always finds the shortest path.
(C). DFS does not guarantee finding the shortest path.
(D). BFS does not guarantee finding the shortest path.
1
(B) and (D) only
2
(A) and (C) only
3
(A) and (B) only
4
(C) and (D) only
About Graph Traversals - CUET-PG
Graph Traversals is a vital chapter for CUET-PG aspirants. Mastering the concepts covered in this chapter is essential for securing a top rank.
By rigorously practicing the previous year questions associated with this chapter, you can identify high-yield topics, understand the examiner's perspective, and boost your confidence during the actual exam.
Frequently Asked Questions
Why focus on Graph Traversals PYQs?
Analyzing PYQs for this specific chapter reveals the most frequently tested concepts and the typical complexity of questions, allowing you to tailor your study plan efficiently.
How to best use this analysis?
Review the topic breakdown to see which sub-topics within Graph Traversals carry the most weight. Then, tackle the questions iteratively to solidify your understanding.