Unit 10 CSP Algorithms Review

What will the following algorithm display?

a ← 11

a ← a + 35

a ← a + 6

a ← a MOD 2

a ← a x b

DISPLAY (a)

• 0

• 42

• 84

• 126

Which of these does NOT represent an algorithm?

• Following recipe instructions

• Working out how an engine works

• Tying your shoelaces

• Making a cup of coffee

If it is AFTER 7am, what do you need to do?

• Take the bus

• Take the subway

• Check the time

• Leave home

You are at the yellow arrow, pointing in the direction indicated. How would you move to fill in the 2 black squares?

• Straight, Turn right, Straight x 1, Fill Square, Straight x 2, Turn left, Straight x 1, Fill Square

• Straight x 2, Turn right, Straight x 1, Fill Square, Straight x 2, Turn left, Straight x 1, Fill Square

• Straight x 2, Turn right, Straight x 1, Fill Square, Straight x 2, Turn right, Straight x 1, Fill Square

• Straight x 2, Turn right, Straight x 1, Fill Square, Straight x 2, Turn left, Straight x 2, Fill Square

What must be true before performing a binary search?

• The elements must be sorted.

• It can only contain binary values.

• The elements must be some sort of number (i.e. int, double, Integer)

• There are no necessary conditions.

True or false: If an array is already sorted, Linear Search / Sequential Search is more efficient than Binary Search.

• True

• False

Given this list:

1, 2, 4, 5, 6, 7, 8, 12, 14, 21, 22, 42, 53

How many comparisons are required to find 42 using the Binary Search?

• 3

• 2

• 10

• 5

Given this array:

1, 2, 4, 5, 6, 7, 8, 12, 14, 21, 22, 42, 53

How many comparisons are required to find 42 using the Linear Search / Sequential Search?

• 3

• 2

• 12

• 5

Which of the following is an example of the use of heuristics?

• Trying every possible combination of letters when unscrambling a word
• Considering each possible move when playing chess
• Using the formula “area=length x width” to find the area of a rectangle
• Playing chess using a defensive strategy that has often been successful for you

A general description of a task that can (or cannot) be solved with an algorithm

• Problem

• Algorithm

• Sequencing

• Iteration