Section 3

Question 1

What is the following calculation in reverse polish Notation: 3 * 4

Answer 1

3 4 *

Question 2

What is the following calculation in reverse polish Notation: (5 * 2) + 7

Answer 2

5 2 * 7 +

Question 3

What is the following calculation in reverse polish Notation: 5 * 4 + 3 * 2

Answer 3

5 4 * 3 2 * +

Question 4

what are the benefits of RPN

Answer 4

RPN doesn’t require brackets and can be implemented easily on a stack

Question 5

Which is faster - Binary search or Linear Search

Answer 5

Binary Search

Question 6

What needs to be true before you can use Binary Search

Answer 6

the list needs to be sorted

Question 7

What does pre-order mean

Answer 7

If each node is visited before both of its subtrees
Visit the root node (generally output it)
Do a pre-order traversal of the left subtree
Do a pre-order traversal of the right subtree

Question 8

what does in-order mean?

Answer 8

If each node is visited between visiting its left and right subtrees
Do an in-order traversal of the left subtree
Visit root node (generally output this)
Do an in-order traversal of the right subtree

Question 9

What is post-order

Answer 9

If each node is visited after its subtrees
Do a post-order traversal of the left subtree
Do a post-order traversal of the right subtree
Visit the root node (generally output this)

Question 10

What does the Dijkstra’s Algorithm do?

Answer 10

Calculates the shortest path from a starting point to an end point.

Question 11

Applications of the Dijkstra Algorithm

Answer 11

• Geographical Information Systems such as satellite navigation.
• Network routing and package switching, used to send data packages along the most efficient route