A-Level Computer Science - Revision No 6

Which of the following sorting algorithms has the best average-case time complexity?

• Bubble Sort

• Insertion Sort

• Merge Sort

• Selection Sort

What is the time complexity of the best-case scenario for Quick Sort?

• O(n)

• O(nlogn)

• O(n^2)

• O(logn)

In which of the following cases is Bubble Sort most efficient?

• Large unsorted arrays

• Small unsorted arrays

• Arrays with elements in random order

• Arrays that are already mostly sorted

What data structure is used in the implementation of a recursive algorithm?

• Queue

• Stack

• Array

• Linked List

Which of the following is not a characteristic of a greedy algorithm?

• It makes a locally optimal choice at each step

• It always finds the global optimum solution

• It builds up a solution piece by piece

• It is often faster than dynamic programming

What is the space complexity of Merge Sort?

• O(1)

• O(logn)

• O(n)

• O(nlogn)

Which of the following searching algorithms has the best worst-case time complexity for an unsorted array?

• Linear Search

• Binary Search

• Jump Search

• Exponential Search

What is the purpose of a hashing function in a hash table?

• To sort data

• To encrypt data

• To index data for fast retrieval

Which of the following best describes an algorithm?

• A flowchart

• A step-by-step procedure for solving a problem

• A computer program

• A programming language

What is the worst-case time complexity of Insertion Sort?

• O(n)

• O(nlogn)

• O(n^2)

• O(n^3)