Which of the following graph representations is most efficient for checking if two vertices are adjacent?
Adjacency Matrix
Adjacency List
Edge List
Incidence Matrix
In an undirected graph, if the sum of the degrees of all vertices is 30, how many edges are there in the graph?
60
15
Cannot be determined.
30
Which of these scenarios is BEST represented using a weighted graph?
Finding the shortest path between two cities on a road network with distances.
Representing the hierarchical structure of a company.
Storing the friendship relations between people on a social media platform.
Modeling the flow of information in a computer network.
A graph is said to be __________ if there is a path from any vertex to any other vertex.
Disconnected
Bipartite
Complete
Connected
Which data structure is commonly used to represent the order of visited vertices during a Depth-First Search?
Queue
Linked List
Heap
Stack
A graph where edges have a direction associated with them is called a:
Undirected Graph
Weighted Graph
Cyclic Graph
Directed Graph
Which data structure is most efficient for checking if an edge exists between two vertices in a sparse graph?
You are performing a Breadth-First Search on a graph. Which of the following best describes the order in which vertices are visited?
Alphabetical order
Random order
Increasing order of their degree (number of connections)
Vertices at the same distance from the source vertex are visited before moving to vertices further away
How does the iterative implementation of Depth-First Search (DFS) typically differ from its recursive counterpart?
The iterative approach uses a stack to mimic the function call stack used in recursion.
The iterative approach is generally less efficient in terms of space complexity than recursion.
The iterative approach is not suitable for traversing graphs with cycles.
The iterative and recursive approaches produce fundamentally different traversal orders.
In the context of Breadth-First Search (BFS), what does it mean for a node to be at 'level i' from the starting node?
The node is the i-th node discovered by the BFS algorithm.
The node is at a distance of 'i' edges away from the starting node.
The node has a priority value of 'i' in the BFS traversal order.
The node has 'i' neighbors in the graph.