List of top Computer Science Questions on Graph traversals

Arrange the following time complexities in increasing order:
• [A.] Linear search worst case
• [B.] Quick sort expected running time
• [C.] Binary search best case
• [D.] Bubble sort worst case
Choose the correct answer from the options given below:
Which of the following is NOT an application of stack?
Arrange the following time complexities in increasing order:
• [A.] Linear search worst case
• [B.] Quick sort expected running time
• [C.] Binary search best case
• [D.] Bubble sort worst case
Choose the correct answer from the options given below:
Which of the following is NOT an application of stack?
Which of the following is not an application of DFS?
Consider the task of finding the shortest path in an unweighted graph by using BFS and DFS. Which of the following statements are true?
(A). BFS always finds the shortest path.
(B). DFS always finds the shortest path.
(C). DFS does not guarantee finding the shortest path.
(D). BFS does not guarantee finding the shortest path.