Graphs, Trees & Traversal (BFS/DFS) — Concept Check
Questions on Graphs, Trees & Traversal (BFS/DFS). Graphs model entities and their relationships; traversals like BFS and DFS explore them — the structures behind knowledge graphs, recommendation engines, and graph neural networks.
Questions in this quiz
8 questions on Graphs, Trees & Traversal (BFS/DFS) — Concept Check. Work through them here, then start the quiz to answer them and see your score.
1.You have a social network graph where nodes represent users and edges represent friendships. You need to find the shortest path between two users. Which traversal method should you use?
- ABreadth-first search (BFS)
- BTopological sort
- CDepth-first search (DFS)
- DDijkstra's algorithm
2.In a task scheduling system, tasks have dependencies forming a directed acyclic graph (DAG). Which traversal method will help you determine the correct order to execute these tasks?
- ADepth-first search (DFS)
- BBreadth-first search (BFS)
- CBreadth-first traversal
- DRandomized search
3.A recommendation engine models users and items as nodes in a graph. Which graph traversal method is most suitable for suggesting items based on a user's immediate connections?
- ARandom walk
- BTopological sort
- CDepth-first search (DFS)
- DBreadth-first search (BFS)
4.You are implementing a function to detect cycles in a graph. Which traversal method should you choose?
- ABreadth-first search (BFS)
- BDepth-first search (DFS)
- CBreadth-first traversal
- DTopological sort
5.In a graph traversal, you notice that nodes are visited in the order: ['A', 'B', 'C', 'D', 'E']. What traversal method is likely being used?
- ATopological sort
- BRandomized search
- CDepth-first search (DFS)
- DBreadth-first search (BFS)
6.A graph neural network aggregates information from node neighbors. What structure does this generalize from traditional deep learning?
- AVectors
- BMatrices
- CTrees
- DGraphs
7.You are tasked with parsing a hierarchical structure. Which type of graph should you use to model this?
- ATree
- BUndirected graph
- CDirected graph
- DGraph with cycles
8.A developer claims that BFS can be used for topological sorting of a DAG. What is the flaw in this claim?
- ABFS does not perform topological sorting
- BBFS requires more memory
- CBFS is slower than DFS
- DBFS cannot detect cycles