OCR GCSE Computer Science 2.1 Algorithms overview quiz quiz

Decomposition

Iteration

Validation

Abstraction

Breaking a large problem into smaller, manageable sub-problems

Putting all of the steps of a solution into a logical order

Removing or hiding all of the detail that is not needed to solve it

Testing a finished program with carefully chosen sample data

A rectangle

A diamond

A parallelogram

A rounded box

endwhile

endfor

endif

endcase

To write out the final working program code ready to run

To design and draw the layout of the program's user interface

To compress a long list of data down into a very much smaller size on the disk

To record how the variables change as an algorithm runs and find its output

The list must be sorted

The list must be empty

The list must contain numbers only

The list must be unsorted

It checks every single item in the list once, from start to finish

It checks the middle item and discards the half that cannot contain the target

It checks only the very first item and the very last item in the whole sorted list

It sorts the entire list again from scratch before each search step

Binary search

Merge search

Linear search

Bubble search

Splits the whole list neatly into two equal halves ready to merge them

Inserts each item in the list one at a time into its own correct place within a growing sorted section

Checks the middle item and throws away the half that cannot hold the target

Compares adjacent pairs and swaps any in the wrong order, moving the largest remaining item to the end

Merge sort

Bubble sort

Insertion sort

Linear sort

It cannot sort numbers, only text values

It is more complex and uses more memory

It only works on lists that are already sorted

It is always slower than a bubble sort is

To find the single largest number out of all of them

To sort the five numbers into ascending numerical order

To calculate the average (mean) of the numbers

To count how many numbers there are altogether