Q2 Comprog Summative Test 2

What is the purpose of the comparison operation?

• to compare which item in a list is bigger

• to add which item in a list should be swap.

• to determine which item in a list should come first

• to arrange which item in a list should come last

Why are computers good at sorting?

• because they can compare a large number of items very quickly

• because they can sort a large number of drawings

• because they can write a large number of characters

• because they can read a large number of letters and symbols

What is the purpose of the swap operation?

• The swap operation is the way that items are moved within a list

• The swap operation is the way that items are edited within a list

• The swap operation is the way that items are copied within a list

• The swap operation is the way that items are sorted within a list

How many memory cells does a computer need to swap two numbers?

• at least 2 memory cells to swap two numbers

• at least 1 memory cells to swap two numbers

• at least 3 memory cells to swap two numbers

• at least 4 memory cells to swap two numbers

What is the first algorithm for swapping two items stored in cells H and Z?

• Copy the contents of temp to cell H

• Copy the contents of cell Z to cell H

• Copy the contents of cell H to temp

• Copy the contents of cell H to cell Z

Why is plain English unsuitable for specifying algorithms?

• Plain English is less wordy and too vague

• Plain English is clear and definite

• Plain English is too wordy and too ambiguous

• Plain English is wordy and limited

What advantage does structured English have over plain English?

• Structured English groups instructions by indenting and number lines

• This allows us to easily read the algorithm and quickly find specific instructions

• This organization also eliminates many unnecessary words which are part of the plain English specification

• All of the above

What two operations do most sorting algorithms have in common?

• swap and sort operations

• comparison and swap operations

• sort and comparison operations

• switch and swap operations

How many iterations (i.e. loops through steps 3 - 6) does the algorithm make when sorting a list of 12 numbers?

• it makes 12 iterations

• it makes 11 iterations

• it makes 10 iterations

• it makes 9 iterations

State the comparisons the Simple Sort would make to find the smallest number in this list: [3 8 9 1 5 4]. (in order)

• (3 < 9), (3 < 8), (1 < 5), (1 < 4), and (3 > 1)

• (3 < 8), (3 < 9), (3 > 1), (1 < 5), and (1 < 4)

• (3 > 1), (1 < 4), (3 < 8), (3 < 9), and (1 < 5)

• (1 < 5), (1 < 4), (3 < 9), (3 > 1), and (3 < 8)