Eduqas GCSE Computer Science algorithms and computational thinking overview quiz quiz

Breaking a problem down into many smaller parts that are solved separately

Removing or hiding unnecessary detail to focus on the important features

Writing out all the ordered steps of an algorithm in plain English

Testing a finished program thoroughly with normal and erroneous data

Hiding unnecessary detail to focus on the key features of a problem

Putting a list of values into ascending or descending order

Breaking a large problem into smaller, more manageable sub-problems

Converting a denary number into its equivalent binary form

A rectangle

A parallelogram

A rounded box

A diamond

Following an algorithm step by step by recording the variables

Sorting a long list of numbers quickly into ascending or descending order so they can be searched

Encrypting data so that it cannot be read without a key

Drawing a logic circuit made from AND, OR and NOT gates

Sorting always makes the list much shorter so there are fewer items left to check through

It discards a half based on whether the target is bigger or smaller than the middle, which only works in order

A binary search is simply unable to read or compare any numbers at all unless the whole list has first been sorted into order

Sorted lists always use noticeably less memory than unsorted ones do

Binary search

Merge search

Linear search

Bubble search

It repeatedly splits the whole list in half and then merges the smaller sorted parts back together

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

It scans the list and removes the single largest item each time

It compares adjacent pairs and swaps any that are in the wrong order, repeating passes

It is much faster because it splits and merges, doing far fewer comparisons

It uses far less memory because it never needs to make any copies of the list while it works

It does not need the list to be in any order before it begins

It is much simpler to write out as code

When at least one input is 1

Only when both inputs are 1

When both inputs are 0

When its single input is 0

Only when both of its two inputs are 1

Only when both of its two inputs are 0

When at least one input is 1

Never, whatever the inputs are

Combines two separate inputs into a single output value

Outputs 1 only when both of its two inputs are 1 together

Adds two binary numbers and carries any overflow

Inverts its single input (0 becomes 1, 1 becomes 0)

4

6

8

16

Throughout the process, not just at the end

Only at the very end, once all of the coding work is finished

Only during the analysis stage, before any code is written

Only after the finished program has been deployed to users

1

0

Both 0 and 1

Undefined