AQA GCSE Computer Science - 3.1.4 Sorting Algorithms

What is decomposition?

• The breaking down of a problem into smaller, simpler steps or stages 
• A series of steps that can be followed to complete a task 
• The removal of unnecessary details 
• An input/output box

What is abstraction?

• The removal of unnecessary details 
• A type of loop  
• An algorithm
• The breaking down of a problem into smaller, simpler steps or stages

What is an algorithm?

• A series of steps that can be followed to complete a task  
• A type of sort 
• A type of iteration  
• A selection  

Which one of the following is not basic programming construct?

• Loop 
• Sequence 
• Iteration 
• Selection

How many types of Selection statements are there?

• 3
• 1
• 2
• 4

Which search algorithm is good for a few items?

• Linear search 
• Binary search
• Merge search 
• Sequence search 

What happens in stage 2 of the merge sort?

• Each pair of sublists is repeatedly merged to produce new sorted sublists
• The list is successively divided in half, forming two sublists, until each sublist is of length one
• Adjacent numbers are swapped around 
• The numbers are multiplied together

What is a FOR…EndFOR loop?

• Definite iteration
• Indefinite iteration
• Condition controlled loop 
• A selection statement

Which of the following is a character?

• Punctuation mark 
• 4.10 
• True 
• 3

How does binary search work?

• It repeatedly divides portion of data list in half
• starts at beginning of list and goes all the way to end of list
• sorting algorithm
• bubble sort