Algorithms: A Comprehensive Guide for Year 11 Computing Students

Question 1

Which of the following sorting algorithms has a time complexity of O(n^2), where n is the number of elements in the input list?

Accepted Answer

Bubble sort

Answer

Quick sort

Answer

Merge sort

Answer

Heap sort

Question 2

What is the primary purpose of using a flowchart in algorithm design?

Accepted Answer

To visually represent the logical flow and structure of an algorithm.

Answer

To calculate the time complexity of an algorithm.

Answer

To translate an algorithm directly into a programming language.

Answer

To verify the correctness of an algorithm.

Question 3

What is the fundamental difference between a recursive and an iterative algorithm?

Accepted Answer

Recursive algorithms use recursion, calling themselves within their own definition, while iterative algorithms do not.

Answer

Iterative algorithms use recursion, calling themselves within their own definition, while recursive algorithms do not.

Answer

Recursive algorithms are always more efficient than iterative algorithms.

Answer

Iterative algorithms are always more efficient than recursive algorithms.

Question 4

Which of the following is NOT a typical consideration when analyzing the efficiency of an algorithm?

Accepted Answer

User experience

Answer

Time complexity

Answer

Space complexity

Answer

Cost of implementation

Question 5

Which characteristic defines tail recursion?

Accepted Answer

The recursive call is the final action in the function.

Answer

Head recursion starts execution with the recursive call.

Answer

Tail recursion involves multiple recursive calls within the function.

Question 6

Which ethical concern is most directly related to the use of algorithms?

Accepted Answer

Privacy invasion

Answer

Lower efficiency

Answer

Reduced accuracy

Question 7

What is the time complexity of the bubble sort algorithm in the average case?

Accepted Answer

O(n^2)

Answer

O(n)

Answer

O(n log n)

Answer

O(2^n)

Question 8

What is the main advantage of using a binary search algorithm over a linear search algorithm?

Accepted Answer

It is significantly faster, especially for large datasets.

Answer

It is easier to implement.

Answer

It uses less memory.

Answer

It is more accurate.

Question 9

Which of the following is NOT a type of algorithm analysis?

Accepted Answer

Accuracy analysis

Answer

Time complexity

Answer

Space complexity

Answer

Efficiency analysis

Question 10

What is the purpose of using a sentinel value in an algorithm?

Accepted Answer

To mark the end of a data structure, simplifying the search or traversal process.

Answer

To improve the efficiency of the algorithm by reducing the number of iterations.

Answer

To simplify the implementation of the algorithm by eliminating the need for special cases.

Answer

To enhance the accuracy of the algorithm by preventing errors.

Question 11

Which of the following is NOT a defining characteristic of an algorithm?

Accepted Answer

Randomness

Answer

Definiteness

Answer

Unambiguity

Answer

Efficiency

Question 12

What is the primary purpose of a flowchart?

Accepted Answer

To provide a visual representation of an algorithm's steps

Answer

To execute an algorithm directly on a computer

Answer

To store data in an organized manner

Answer

To debug an algorithm's errors

Question 13

Which sorting algorithm has the worst-case time complexity of O(n^2)?

Accepted Answer

Bubble sort

Answer

Merge sort

Answer

Quick sort

Answer

Heap sort

Question 14

What is the primary benefit of using recursion in algorithm design?

Accepted Answer

It allows an algorithm to make recursive calls to itself.

Answer

It simplifies coding and improves readability.

Answer

It reduces the memory requirements of an algorithm.

Answer

It automatically speeds up the execution of an algorithm.

Question 15

Which of the following is NOT a characteristic of an algorithm?

Accepted Answer

It must be easy to understand.

Answer

It must have a finite number of well-defined steps.

Answer

It must always produce the same output for the same input.

Answer

It must be computationally efficient.

Question 16

What is the main purpose of a flowchart?

Accepted Answer

To visually represent the logical flow of an algorithm.

Answer

To translate an algorithm directly into a computer program.

Answer

To test the correctness of an algorithm.

Answer

To optimize the efficiency of an algorithm.

Question 17

Which of the following is NOT a common algorithm design paradigm?

Accepted Answer

Brute force

Answer

Divide and conquer

Answer

Greedy algorithms

Answer

Dynamic programming

Question 18

What is the time complexity of an algorithm that sorts a list of 'n' elements using the bubble sort algorithm?

Accepted Answer

O(n^2)

Answer

O(n)

Answer

O(n log n)

Answer

O(2^n)

Question 19

What is the purpose of a sentinel value in an algorithm?

Accepted Answer

To indicate the end of a data structure.

Answer

To improve the efficiency of a search algorithm.

Answer

To prevent an algorithm from entering an infinite loop.

Answer

To store the output of an algorithm.

Question 20

What is the fundamental difference between an iterative algorithm and a recursive algorithm?

Accepted Answer

An iterative algorithm uses a loop, while a recursive algorithm calls itself.

Answer

An iterative algorithm is more efficient than a recursive algorithm.

Answer

A recursive algorithm is easier to understand than an iterative algorithm.

Answer

There is no difference between an iterative algorithm and a recursive algorithm.

Question 21

Which of the following is NOT a sorting algorithm?

Accepted Answer

Binary search

Answer

Merge sort

Answer

Bubble sort

Answer

Selection sort

Question 22

What is the primary function of a binary search tree?

Accepted Answer

To search for data efficiently.

Answer

To store data in a hierarchical structure.

Answer

To sort data.

Answer

To represent relationships between data items.

Question 23

Which of these is **not** a fundamental characteristic of an algorithm?

Accepted Answer

Open to multiple interpretations

Answer

Clear and unambiguous instructions

Answer

Precise steps that lead to a defined result

Answer

Finite in execution

Question 24

What is the main goal of algorithm analysis?

Accepted Answer

To assess the efficiency of an algorithm

Answer

To enhance code readability

Answer

To identify potential errors

Answer

To ensure the algorithm's correctness

Question 25

Which of the following algorithms uses recursion?

Accepted Answer

Binary search

Answer

Bubble sort

Answer

Insertion sort

Answer

Selection sort

Question 26

How does a greedy algorithm differ from a dynamic programming algorithm?

Accepted Answer

Greedy algorithms make short-term optimal choices, while dynamic programming considers all options.

Answer

Dynamic programming algorithms make short-term optimal choices, while greedy algorithms consider all options.

Answer

Greedy algorithms are always more efficient than dynamic programming algorithms.

Answer

Dynamic programming algorithms are always more efficient than greedy algorithms.

Question 27

Which sorting algorithm has an average-case time complexity of O(n log n)?

Accepted Answer

Merge sort

Answer

Bubble sort

Answer

Insertion sort

Answer

Selection sort

Question 28

What is the primary benefit of using a binary search tree over a linked list for searching a large dataset?

Accepted Answer

Faster search operations

Answer

Faster insertion and deletion operations

Answer

Reduced memory consumption

Answer

Easier implementation

Question 29

What is the key difference between an algorithm and a program?

Accepted Answer

An algorithm is a conceptual blueprint, while a program is its practical implementation.

Answer

A program is a theoretical concept, while an algorithm is a practical implementation.

Answer

Algorithms and programs are interchangeable terms.

Answer

Algorithms are always more efficient than programs.

Question 30

What is the primary purpose of using pseudocode?

Accepted Answer

To provide a high-level overview of an algorithm's design

Answer

To translate an algorithm directly into a programming language

Answer

To represent the detailed implementation of an algorithm

Answer

To test the efficiency of an algorithm

Question 31

What is the time complexity of a linear search algorithm?

Accepted Answer

O(n)

Answer

O(1)

Answer

O(log n)

Answer

O(n^2)

Question 32

Which of the following algorithms demonstrates the use of recursion?

Accepted Answer

Factorial calculation

Answer

Binary search

Answer

Bubble sort

Answer

Insertion sort

Question 33

What is the purpose of the base case in a recursive algorithm?

Accepted Answer

To stop the recursive calls and return a result

Answer

To initialize the recursive calls

Answer

To determine the output of the algorithm

Answer

To ensure the efficiency of the algorithm

Question 34

What is the primary difference between iterative and recursive algorithms?

Accepted Answer

Iterative algorithms use loops, while recursive algorithms use function calls

Answer

Iterative algorithms are always more efficient than recursive algorithms

Answer

Recursive algorithms are more complex to implement than iterative algorithms

Answer

There is no significant difference between iterative and recursive algorithms

Question 35

Which analysis method assesses an algorithm's performance in the most challenging scenario?

Accepted Answer

Worst-case analysis

Answer

Average-case analysis

Answer

Best-case analysis

Answer

Amortized analysis

Question 36

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

Accepted Answer

It is difficult to understand

Answer

It is verifiable

Answer

It is efficient

Answer

It is generalizable

Question 37

An algorithm is a finite set of precise instructions that can be used to solve a computational problem. Is this statement true or false?

Accepted Answer

True

Answer

False

Answer

Only true for simple problems

Answer

Not always true

Question 38

Which of the following is a common metric used to measure the efficiency of an algorithm?

Accepted Answer

Time complexity

Answer

Number of branches

Answer

Code length

Answer

Memory usage

Question 39

A recursive algorithm is one that:

Accepted Answer

Calls itself as a subroutine.

Answer

Has multiple entry points.

Answer

Uses a loop to iterate over data.

Answer

Can only be used to solve simple problems.

Question 40

Which of the following is a common data structure used in algorithms?

Accepted Answer

Array

Answer

Register

Answer

Instruction

Answer

Interrupt

Question 41

A greedy algorithm is one that:

Accepted Answer

Makes the seemingly best choice at each step, without considering future consequences.

Answer

Always finds the optimal solution.

Answer

Is always faster than a non-greedy algorithm.

Question 42

Which of the following is NOT a type of sorting algorithm?

Accepted Answer

QuickUnion

Answer

Merge sort

Answer

Insertion sort

Answer

Selection sort

Question 43

Which of the following is a key difference between an algorithm and a heuristic?

Accepted Answer

An algorithm is guaranteed to find the optimal solution, while a heuristic may not.

Answer

An algorithm is always more complex than a heuristic.

Answer

An algorithm is always more efficient than a heuristic.

Question 44

A backtracking algorithm:

Accepted Answer

Can explore multiple solutions to a problem before finding the optimal one.

Answer

Is only suitable for solving simple problems.

Answer

Is always guaranteed to find the optimal solution.

Question 45

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

Accepted Answer

It is overly complex and difficult to understand.

Answer

It has a clear and logical structure.

Answer

It is efficient in terms of time and space usage.

Answer

It is generalizable to solving similar problems.

Question 46

What is the purpose of a pseudocode?

Accepted Answer

To provide a high-level overview of an algorithm, using natural language or simplified syntax.

Answer

To translate an algorithm directly into machine code.

Answer

To specify the exact steps of an algorithm in a specific programming language.

Question 47

Which of the following analysis techniques involves determining the maximum number of steps an algorithm can take for an input of size 'n'?

Accepted Answer

Worst-case analysis

Answer

Empirical analysis

Answer

Average-case analysis

Answer

Best-case analysis

Question 48

What is the time complexity of an algorithm that performs two nested loops, each of which iterates 'n' times?

Accepted Answer

O(n^2)

Answer

O(n log n)

Answer

O(1)

Answer

O(n)

Question 49

What is the key difference between a recursive and an iterative algorithm?

Accepted Answer

Recursive algorithms solve a problem by breaking it down into smaller sub-problems of the same type and calling themselves to solve them, while iterative algorithms use loops to solve a problem one step at a time.

Answer

Recursive algorithms are faster than iterative algorithms.

Answer

Recursive algorithms use stacks, while iterative algorithms use queues.

Question 50

What is a key advantage of using a linked list data structure over an array?

Accepted Answer

Linked lists offer efficient insertion and deletion of elements at any position.

Answer

Linked lists require less memory than arrays.

Answer

Linked lists provide faster access to elements than arrays.

Question 51

Which of the following is NOT a fundamental concept in the study of algorithms?

Accepted Answer

Boolean algebra

Answer

Data structures

Answer

Recursion

Answer

Time complexity

Question 52

What is the significance of the Halting Problem in computer science?

Accepted Answer

It demonstrates the inherent limitations of algorithms and proves that there is no general method to determine whether any given algorithm will terminate or run indefinitely.

Answer

It provides a way to analyze the performance of an algorithm in different situations.

Answer

It is a way to verify the correctness of an algorithm.