UNIT IV DSA Quiz

What is a graph in data structures?

• A linear collection of data

• A hierarchical structure

• A set of vertices and edges

• A tree-like structure

Which of the following is a correct representation of a graph?

• Stack

• Queue

• Adjacency list or adjacency matrix

• Binary tree

In an undirected graph, an edge (u, v) is equivalent to:

• (u, v) ≠ (v, u)

• (u, v) = (v, u)

• One-direction only

• Self-loop

Which of the following graphs has direction associated with edges?

• Undirected graph

• Directed graph

• Weighted graph

• Simple graph

What is a complete graph?

• Every node has a self-loop

• All nodes are disconnected

• Each pair of vertices is connected by an edge

• Only even nodes are connected

Which of the following represents a sparse graph?

• More edges than vertices

• Few edges compared to vertices

• All nodes connected

• Graph with no nodes

Which data structure is used in Breadth First Search (BFS)?

• Stack

• Queue

• Array

• Tree

BFS is useful for finding:

• Shortest path in an unweighted graph

• Maximum flow

• DFS tree

• Articulation points

Which traversal uses stack or recursion?

• BFS

• DFS

• Level order

• Topological sort

What is the time complexity of BFS and DFS in adjacency list representation?

• O(V + E)

• O(V²)

• O(E²)

• O(VE)