[Q.26] Which graph algorithm is used to find the shortest path from a single source node to all other nodes in a graph with non-negative edge weights?
Dijkstra's Algorithm finds single-source shortest paths for non-negative edge weights.
[Q.27] In a circular queue with array size capacity N, front pointer 'front' and rear pointer 'rear', what is the condition for Queue Full?
In a circular queue, queue is full when the next position after rear is front: (rear + 1) % N == front.
[Q.28] What is the worst-case space complexity of Depth-First Search (DFS) on a graph with maximum depth d?
DFS call stack stores up to d frames corresponding to current path depth, giving O(d) auxiliary space.
[Q.29] Which sorting algorithm is stable and has a worst-case time complexity of O(n log n)?
Merge Sort is stable and guarantees O(n log n) worst-case time complexity.
[Q.30] In hashing, when two distinct keys produce the same hash value, this phenomenon is called:
A Collision occurs when hash(k1) == hash(k2) for k1 != k2.