A-Level Computer Science - Revision No 5

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

• Bubble Sort

• Insertion Sort

• Merge Sort

• Selection Sort

Which data structure is used for implementing recursion?

• Queue

• Stack

• Linked List

• Graph

What is the primary advantage of using a linked list over an array?

• Random access of elements

• Fixed size

• Dynamic size

• Faster access time

Which of the following algorithms is used to find the shortest path in a graph?

• Depth-First Search (DFS)

• Breadth-First Search (BFS)

• Dijkstra's Algorithm

• Kruskal's Algorithm

In a binary search algorithm, what is the time complexity in the worst case?

• O(n)

• O(log n)

• O(n log n)

• O(n^2)

Which type of loop is best suited when the number of iterations is known beforehand?

• While loop

• Do-while loop

Which of the following is not a characteristic of a recursive function?

• A) A base case

• B) Recursive case

• C) Infinite execution

• D) Self-referential call

What is the main disadvantage of a linear search algorithm?

• A) Complexity

• B) Requires sorted data

• C) Slow for large lists

• D) Uses additional memory

Which of the following is a divide-and-conquer algorithm?

• A) Quick Sort

• B) Linear Search

• C) Bubble Sort

• D) Selection Sort

In a stack, what is the time complexity of the pop operation?

• A) O(1)

• B) O(n)

• C) O(log n)

• D) O(n log n)