4.3 Fundamentals of Algorithms

Question 1

What is the use of a breadth-first algorithm?

Answer 1

Shortest path for an unweighted graph.

Question 2

What is the use of a depth-first algorithm?

Answer 2

Navigating a maze

Question 3

What is the use of a pre-order tree-traversal algorithm?

Answer 3

Copying a tree

Question 4

What is the use of a in-order tree-traversal algorithm?

Answer 4

Binary search tree Outputting the contents of a binary search tree in ascending order.

Question 5

What is the use of a post-order tree-traversal algorithm?

Answer 5

Infix to RPN (Reverse Polish Notation) conversions.
Producing a postfix expression from an expression tree.
Emptying a tree.

Question 6

What is the time complexity of a linear search algorithm?

Answer 6

O(n)

Question 7

What is the time complexity of a binary search algorithm?

Answer 7

O(log n)

Question 8

What is the time complexity of a bubble sort algorithm?

Answer 8

O(n^2)

Question 9

What is the time complexity of a merge sort algorithm?

Answer 9

O(nlog n)

Question 10

What is the use of Dijkstra’s algorithm?

Answer 10

To find the shortest path