Algorithms Assessment

1a. What is an algorithm?

1b. (i) What is the output from the program if die1 = 3 and die2 = 7 ?

1b. (ii) What is the output from the program if die1 = 5 and die2 = 5 ?

1c. Rewrite the flowchart as a pseudocode algorithm, making the following alterations: 1. A player’s score is added to their total score after each throw. 2. If the user throws a “double”, their score for that throw is doubled, and they throw the dice again. 3. Their turn ends if die1 and die2 have different values after a throw. 4. Output the total score at the end of a turn. [4]

1d. What is output if the user “throws” 3 times, getting 4 and 4, 3 and 3, 6 and 1 on the three throws?

2a. List the numbers that will be examined if a linear search is carried out to find the number 138.

• 103, 118, 122, 134, 138
• 103
• 103, 118
• 103, 118, 122
• 103, 118, 122, 134

2b. List the numbers that will be examined if a binary search is carried out to find the number 138.

• 103, 118, 122, 134
• 103, 118, 122, 134, 138
• 156, 122, 138
• 156, 122

2c. Using a binary search, how many items will need to be examined to find the number 199?

• 4
• 1
• 2
• 3
• 5

2d. Give one advantage of the linear search method

2e. Give one advantage of the binary search method.