Mastering A-Level Computational Methods

Which of the following is a characteristic of a well-designed algorithm?

• It is ambiguous.

• It is efficient.

• It is complex.

• It is lengthy.

What is the time complexity of a binary search algorithm?

Which data structure is used for implementing recursion?

• Queue

• Stack

• Array

• Linked List

What is the output of the following pseudocode? ``` x = 5 y = 10 if x > y then print("x is greater") else print("y is greater") ```

• x is greater

• y is greater

• x is equal to y

• Error

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

• Bubble Sort

• Insertion Sort

• Quick Sort

• Selection Sort

In computational methods, what does the term "heuristic" refer to?

• An exact solution

• An approximate solution

• A random solution

• A complex solution

What is the primary purpose of using pseudocode in computational methods?

• To execute the code

• To provide a high-level description of an algorithm

• To compile the code

• To debug the code

Which of the following is a greedy algorithm?

• Dijkstra's Algorithm

• Merge Sort

• Depth-First Search

• Breadth-First Search

What is the space complexity of an algorithm that uses a fixed amount of extra space?

Which of the following is not a characteristic of dynamic programming?

• Overlapping subproblems

• Optimal substructure

• Recursive approach

• Greedy choice property