CC104 2A

Which traversal method uses a stack data structure to keep track of unvisited nodes?

• Breadth First Search

• Dijkstra's Algorithm

• Kruskal's Algorithm

• Depth First Search

Which type of graph traversal would you use if you wanted to visit all nodes at the current depth level before moving to the next depth level?

• Breadth First Search

• Prim's Algorithm

• Bellman-Ford Algorithm

• Depth First Search

In graph terminology, what does a 'leaf' node refer to?

• A node with only one adjacent node

• A node with no outgoing edges

• A node with no incoming edges

• A node with no adjacent nodes

Which graph representation is more space-efficient for a sparse graph?

• Adjacency List

• Incidence Matrix

• Adjacency Matrix

• Edge List

In an adjacency matrix representation of a graph, what value is used to indicate the absence of an edge between vertices Vi and Vj?

• 1

• 0

• -1

• None

In a graph G, if there is a path between every pair of vertices, what type of graph is G?

• Directed graph 

• Disconnected graph 

• Bipartite graph

• Complete graph

What is the primary difference between a directed graph and an undirected graph?

• Directed graphs allow edges to point in one direction; undirected graphs do not.

• Directed graphs are sparse; undirected graphs are dense.

• Directed graphs have weights on edges; undirected graphs do not.

• Directed graphs have cycles; undirected graphs do not.

Which of the following operations is not typically associated with graphs?

• Insertion  

• Traversal

• Sorting

• Deletion 

If a graph G is represented by an adjacency matrix with all diagonal elements being zero, what does this imply about G?

• G has no self-loops.   

• G is a bipartite graph.

• G is a complete graph. 

• G is a directed graph.

In a Breadth First Search, what determines the order in which nodes are visited?

• Adjacency matrix

• Depth level   

• Node label 

• Node degree