What is the primary difference between a directed graph and an undirected graph?
Select an option to see the answer and solution.
Data Structure · all questionsGraphs
Graphs
practice.
Practice every MCQ with options. Use Show answers when you want the correct option and solution.
153
Questions
1/8
Page
Pick an option on a question to see the right answer and solution.
What is the time complexity of performing a depth-first search (DFS) on a graph using an adjacency matrix?
Select an option to see the answer and solution.
Which of the following is true about a bipartite graph?
Select an option to see the answer and solution.
What is a cycle in a graph?
Select an option to see the answer and solution.
What is the purpose of the adjacency matrix in graph representation?
Select an option to see the answer and solution.
Which traversal algorithm would you use to find the shortest path in an unweighted graph?
Select an option to see the answer and solution.
In which scenario is Dijkstra's algorithm not suitable for finding the shortest path?
Select an option to see the answer and solution.
What is the main characteristic of a complete graph?
Select an option to see the answer and solution.
What is a spanning tree of a graph?
Select an option to see the answer and solution.
How can you determine if a graph contains a cycle using DFS?
Select an option to see the answer and solution.
Which algorithm is used to find the minimum spanning tree in a graph?
Select an option to see the answer and solution.
In a weighted graph, what does a negative weight cycle indicate for shortest path algorithms?
Select an option to see the answer and solution.
What is the time complexity of the BFS algorithm for a graph represented using an adjacency list?
Select an option to see the answer and solution.
How does the Floyd-Warshall algorithm compute shortest paths in a graph?
Select an option to see the answer and solution.
What is the primary purpose of using a priority queue in graph algorithms like Dijkstra's?
Select an option to see the answer and solution.
Which of the following algorithms is used to detect cycles in a directed graph?
Select an option to see the answer and solution.
What is a topological sort in a directed graph?
Select an option to see the answer and solution.
Which data structure is commonly used to implement the BFS algorithm?
Select an option to see the answer and solution.
What is the time complexity of finding all reachable nodes from a given node in an undirected graph using DFS?
Select an option to see the answer and solution.
In which of the following scenarios is Prim's algorithm more efficient than Kruskal's algorithm?
Select an option to see the answer and solution.