Algorithms

1. Algorithms are step-by-step procedures or formulas for solving problems. They are a set of instructions that describe how to perform a task or solve a problem effectively. Algorithms are used in various fields such as computer science, mathematics, engineering, and more. They help in organizing data, making decisions, and automating processes. By designing efficient algorithms, we can optimize the use of resources, improve performance, and solve complex problems in a systematic way.

Which sorting algorithm has a worst-case time complexity of O(n²)?

A) Bubble Sort
B) Merge Sort
C) Quick Sort
D) Heap Sort

2. What data structure is typically used in a Depth-First Search (DFS) algorithm?

A) Stack
B) Queue
C) Array
D) Binary Tree

3. Which algorithm is commonly used to find the shortest path in a graph with non-negative edge weights?

A) Bellman-Ford algorithm
B) A* search algorithm
C) Dijkstra's algorithm
D) Prim's algorithm

4. What does the 'recursion' mean in the context of algorithms?

A) A function that has no return statement.
B) A function that iterates over a collection of elements.
C) A function that generates random numbers.
D) A function that calls itself in a problem-solving process.

5. Which algorithm is used to find the transitive closure of a directed graph?

A) Warshall's algorithm
B) Floyd's algorithm
C) Tarjan's algorithm
D) Kosaraju's algorithm

6. What is the term for the measure of how detailed the instructions are in an algorithm?

A) Scalability
B) Efficiency
C) Granularity
D) Complexity

7. Which of the following is a divide and conquer algorithm?

A) Insertion Sort
B) Merge Sort
C) Bubble Sort
D) Selection Sort

8. What is the process of making a repetitive sequence shorter by using previous occurrences called?

A) Burrows-Wheeler Transform
B) Run-Length Encoding
C) Differential Encoding
D) Huffman Coding

9. What data structure is typically used in a Breadth-First Search algorithm?

A) Queue
B) Linked List
C) Heap
D) Stack

10. Which algorithm can be used to find the maximum flow in a flow network?

A) Binary Search algorithm
B) Depth-First Search
C) Ford-Fulkerson algorithm
D) Bubble Sort

11. What is the worst-case time complexity of the Quick Sort algorithm?

A) O(n)
B) O(n log n)
C) O(log n)
D) O(n²)

12. What is the main advantage of the breadth-first search (BFS) algorithm over depth-first search (DFS)?

A) BFS is easier to implement.
B) BFS guarantees the shortest path to the goal.
C) DFS uses less memory space.
D) DFS finds the path more quickly.

13. What is the primary goal of the Floyd-Warshall algorithm?

A) To calculate the maximum flow in a flow network.
B) To sort elements in ascending order.
C) To find the shortest paths between all pairs of vertices in a weighted graph.
D) To determine the largest connected component in an undirected graph.

14. Which algorithm is used to find the longest common subsequence between two sequences?

A) Radix Sort
B) Selection Sort
C) Heap Sort
D) Longest Common Subsequence algorithm

Created with That Quiz — the site for test creation and grading in math and other subjects.