Exam-style questions by topic — AQA AS-Level Computer Science
One question for each of 2 topics. These are written for this specification by MasteryMind. They are not past-paper questions, and they are not from AQA.
AS Computer Science: Paper 2
In Big O notation, what is the time complexity of the most efficient general-purpose comparison-based sorting algorithm in the worst case?
Practise AS Computer Science: Paper 2AS Computer Science: Paper 1
In a computer, a floating point number is stored using a mantissa and an exponent. Which of the following best describes the effect of increasing the number of bits allocated to the exponent while keeping the total number of bits the same?
Practise AS Computer Science: Paper 1
Practise every topic and see your weak topics.
A week of Premium from your first lesson · Then the free plan continues · No card, no charge