A developer used two different sorting algorithms to arrange a list of numbers in ascending order. Algorithm A is a selection sort (time complexity of O(n^2)), and Algorithm B is a quicksort (time complexity of O(n log n)). Which algorithm is likely to be more time-efficient for sorting large datasets and why?
Algorithm Efficiency Analysis (2 mark) Read More »
Identify the input in the following simple algorithm: OUTPUT ‘What is your name?’ name
Input Identification (1 mark) Read More »
In computer science, what is meant by ‘abstraction’? Give an example to illustrate your explanation.
Abstraction Meaning (3 marks) Read More »
Decomposition is a crucial step in problem-solving. Explain why it is important to decompose complex problems.
Why Decomposition (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 »
en Notifications
Arabic
Chinese (Simplified)
Dutch
French
German
Italian
Portuguese
Russian
Spanish
Ukrainian
Welsh