Y13 - Quick QUiz - Algorithms and Complexity

Which of the following best describes the time complexity of a binary search algorithm?

What is the primary purpose of using a sorting algorithm?

• To find the maximum value in a list

• To arrange data in a specific order

• To search for an element in a list

• To calculate the sum of all elements in a list

Which of the following algorithms is considered a divide and conquer algorithm?

• Bubble Sort

• Quick Sort

• Linear Search

• Insertion Sort

What is the space complexity of the Merge Sort algorithm?

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

• Makes the locally optimal choice at each step

• Always finds the global optimum

• Is often faster than other algorithms

• Does not always produce the best solution

What is the worst-case time complexity of the Bubble Sort algorithm?

Which of the following data structures is most suitable for implementing a priority queue?

• Stack

• Queue

• Heap

• Linked List

In the context of algorithms, what does the term "backtracking" refer to?

• A method of sorting data

• A technique for finding the shortest path

• A strategy for solving problems by trying partial solutions and then abandoning them if they are not suitable

• A way to optimise memory usage

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

• Dijkstra's Algorithm

• Kruskal's Algorithm

• Prim's Algorithm

• Floyd-Warshall Algorithm

What is the main advantage of using a dynamic programming approach?

• It uses less memory than other approaches

• It is easier to implement than other approaches

• It avoids the recomputation of subproblems by storing their results

• It always provides the fastest solution