Decomposition Application (3 marks)
Provide an example of decomposition by breaking down the task of organizing a school fête into at least three sub-tasks.
Decomposition Application (3 marks) Read More »
Provide an example of decomposition by breaking down the task of organizing a school fête into at least three sub-tasks.
Decomposition Application (3 marks) Read More »
Explain the difference between an algorithm and a computer program.
Algorithm vs Program (2 marks) Read More »
Explain what is meant by an ‘algorithm’ in the context of computer science.
Algorithm Meaning (2 marks) Read More »
Describe the Insertion Sort process using a simple array of integers [8, 3, 5, 4] as an example. Explain how elements are sorted step-by-step.
Basic Explanation of Insertion Sort. (3 marks) Read More »
Explain how the Merge Sort algorithm sorts a dataset.
Process of the Merge Sort Algorithm. (3 marks) Read More »
Describe the process of the Bubble Sort algorithm when applied to a set of numbers.
Describe the process of the Bubble Sort. (2 marks) Read More »
A list of student names sorted alphabetically: Alice, Bob, Charlie, David, Emma. Write the steps you would take to find the name “Emma” using a binary search.
Applying a Binary Search Algorithm. (3 marks) Read More »
Review the pseudocode below and explain the type of search algorithm used: for i = 0 to (list.length) – 1 if list[i] == target then print(“Found at position”, i) break endif next i print(“Not found”)
Identify the Search Algorithm (2 marks) Read More »
Explain one pre-requisite for performing a binary search on a dataset.
Pre-requisite for Performing a Binary Search. (1 mark) Read More »
Create a trace table to show the values of variables for three iterations of the loop in the following pseudocode: x = 1 y = 1 for i=1 to 3 x = x + 2 y = y * 2 next i
Trace Tables. (6 marks) Read More »
Notifications