CSP Unit 6: Algorithms

What does an algorithm need to be (choose all that apply)?

• Clear instructions

• Exact

• Easy to understand

• Complex

What is pseudocode?

• Simplified programming language, that is not a specific language
• Complicated programming language
• Simple programming language, which is linked to a specific language
• A type of cheese

What is the purpose of pseudocode?

• To program a computer

• So we can see the different symbols

• It helps us with the variables

• It helps us plan the code line by line

• Flow charts are helpful to us when planning

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

Tags

CCSS.6.EE.B.6

What's the difference between a flow chart and pseudocode? (choose all that apply)

• Nothing

• Flow chart uses symbols

• Pseudocode is more colorful

• Flow chart has data flow arrows

• Pseudocode and flow charts both use arrows for data flow

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