Graph Representations and Traversals (BFS and DFS)
Curriculum and historical examination lineage for Graph Representations and Traversals (BFS and DFS) under Unit 5 (Graphs and Applications) of Data Structures and Algorithms (21CSC201J) at SRMIST.
Historical appearance distribution across SRMIST Formative Tests (CT1, CT2) and University End Semester examinations.
Factual marks weightage of questions asked on this topic in historical examinations.
Representative historical questions extracted directly from SRMIST examination papers.
Which data structure is used to traverse the graph by using Breadth First Search (A) stack (B) queue (C) Array (D) List [1]
What would be the number of zeros in the adjacency matrix of the given graph? (A) 10 (B) 6 (C) 16 (D) 0 [1]
Consider the graph given below show its adjacency list and adjacency matrix in the memory. [8]
What would be the number of zero in the adjacency matrix of the given graph? (A) 10 (B) 6 (C) 16 (D) 0 [1]
Let G be a graph with 'n' vertices and 'm' edges. What is the tightest upper bound on the running time on Depth First Search of G? Assume that the graph is represented using...
Examinations where questions for Graph Representations and Traversals (BFS and DFS) have appeared.
Master Graph Representations and Traversals (BFS and DFS) in MintAI
Practice past exam questions, test recurring archetypes, and view predictive probability for this topic before your upcoming exam.