What is a cycle in a graph?
A graph that is not connected.
A vertex with a degree of 1.
The longest path between any two vertices.
A path that starts and ends at the same vertex.
Which of the following is the BEST representation of a graph when the number of edges is much smaller than the number of vertices?
Adjacency List
Adjacency Matrix
Edge List
Incidence Matrix
Which graph traversal algorithm uses a queue to visit vertices?
Dijkstra's Algorithm
Depth First Search (DFS)
Bellman-Ford Algorithm
Breadth First Search (BFS)
Which of these scenarios is BEST represented using a weighted graph?
Finding the shortest path between two cities on a road network with distances.
Modeling the flow of information in a computer network.
Storing the friendship relations between people on a social media platform.
Representing the hierarchical structure of a company.
In an undirected graph, if the sum of the degrees of all vertices is 30, how many edges are there in the graph?
60
30
15
Cannot be determined.
A graph is said to be __________ if there is a path from any vertex to any other vertex.
Connected
Disconnected
Bipartite
Complete
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 has 'i' neighbors in the graph.
The node is the i-th node discovered by the BFS algorithm.
The node has a priority value of 'i' in the BFS traversal order.
The node is at a distance of 'i' edges away from the starting node.
What is the time complexity of performing a Breadth-First Search on a graph with 'V' vertices and 'E' edges?
O(V * E)
O(V)
O(V + E)
O(E)
What does a '1' represent in an adjacency matrix of an undirected graph?
The direction of the edge.
The weight of the edge.
The presence of an edge between two vertices.
The degree of the vertex.
Which type of graph is MOST suitable for representing a one-way system on a city map?
Directed Graph
Weighted Graph
Tree
Undirected Graph