SLR5 | Algorithms

Which of the following is a depth-first graph traversal technique?

• Breadth-First Search

• Depth-First Search

• Dijkstra's Algorithm

• Kruskal's Algorithm

In Dijkstra's algorithm, what is the primary data structure used to keep track of the shortest path?

• Stack

• Queue

• Priority Queue

• Linked List

Which tree traversal method visits the root node first, then the left subtree, and finally the right subtree?

• In-order Traversal

• Pre-order Traversal

• Post-order Traversal

• Level-order Traversal

What is the time complexity of binary search in the worst-case scenario?

Which of the following best describes the efficiency of merge sort?

Reverse Polish Notation is also known as:

• Infix Notation

• Prefix Notation

• Postfix Notation

• Mixed Notation

Which of the following is true about linear search?

• It requires a sorted array.

• It can be used on both sorted and unsorted arrays.

• It is faster than binary search for large datasets.

What is the primary disadvantage of bubble sort?

• It is complex to implement.

• It has a high space complexity.

• It requires a sorted array to function.

Which graph traversal technique is most suitable for finding the shortest path in an unweighted graph?

• Depth-First Search

• Breadth-First Search

• Dijkstra's Algorithm

• Bellman-Ford Algorithm

In Dijkstra's algorithm, what is the initial distance value assigned to the source node?

• Infinity

• Zero

• One

• Negative Infinity