Paper 1 Plenary A-Z

What is an algorithm?

• A set of steps to solve a problem

• A list of programming errors

• A flowchart

• A way to store data

What is decomposition in computer science?

• Breaking down a problem into smaller parts

• Fixing syntax errors

• Combining two programs

• Removing unneeded data

Which of these is an example of abstraction?

• Focusing only on main roads in a map

• Writing every detail of a program

• Repeating steps

• Using a loop to reduce repetition

What does a flowchart symbol shaped like a diamond represent?

• A decision

• The start of a program

• An output

• A loop

What is the correct order of steps in a typical algorithm?

• Input → Process → Output

• Output → Input → Process

• Decision → Input → Loop

• Start → Print → End

What is the result of this code? for i in range(1, 4): print(i * 2)

• 2, 4, 6

• 1, 2, 3

• 2, 3, 4

• 2, 6, 8

Which sorting algorithm repeatedly compares and swaps adjacent items?

• Bubble sort

• Merge sort

• Linear search

• Binary search

Which search algorithm only works on sorted lists?

• Binary search

• Linear search

• Bubble sort

• Sequential search

What is a key disadvantage of bubble sort?

• It is slow on large lists

• It can't sort strings

• It doesn’t work on numbers

• It requires recursion

What is the purpose of a trace table?

• To track variable values during a dry run

• To log runtime errors

• To draw a flowchart

• To store outputs for testing