- 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(n2)?
A) Bubble Sort
B) Merge Sort
C) Heap Sort
D) Quick Sort
- 2. What data structure is typically used in a Depth-First Search (DFS) algorithm?
A) Queue
B) Array
C) Stack
D) Binary Tree
- 3. Which algorithm is commonly used to find the shortest path in a graph with non-negative edge weights?
A) A* search algorithm
B) Dijkstra's algorithm
C) Bellman-Ford algorithm
D) Prim's algorithm
- 4. What does the 'recursion' mean in the context of algorithms?
A) A function that calls itself in a problem-solving process.
B) A function that has no return statement.
C) A function that iterates over a collection of elements.
D) A function that generates random numbers.
- 5. Which algorithm is used to find the transitive closure of a directed graph?
A) Kosaraju's algorithm
B) Tarjan's algorithm
C) Floyd's algorithm
D) Warshall's algorithm
- 6. Which of the following is a divide and conquer algorithm?
A) Bubble Sort
B) Selection Sort
C) Merge Sort
D) Insertion Sort
- 7. What is the worst-case time complexity of the Quick Sort algorithm?
A) O(log n)
B) O(n)
C) O(n2)
D) O(n log n)
- 8. Which algorithm can be used to find the maximum flow in a flow network?
A) Bubble Sort
B) Depth-First Search
C) Binary Search algorithm
D) Ford-Fulkerson algorithm
- 9. What is the main advantage of the breadth-first search (BFS) algorithm over depth-first search (DFS)?
A) DFS finds the path more quickly.
B) DFS uses less memory space.
C) BFS is easier to implement.
D) BFS guarantees the shortest path to the goal.
- 10. Which algorithm is used to find the longest common subsequence between two sequences?
A) Selection Sort
B) Longest Common Subsequence algorithm
C) Radix Sort
D) Heap Sort
- 11. What is the primary goal of the Floyd-Warshall algorithm?
A) To calculate the maximum flow in a flow network.
B) To determine the largest connected component in an undirected graph.
C) To sort elements in ascending order.
D) To find the shortest paths between all pairs of vertices in a weighted graph.
- 12. What data structure is typically used in a Breadth-First Search algorithm?
A) Heap
B) Queue
C) Stack
D) Linked List
- 13. What is the process of making a repetitive sequence shorter by using previous occurrences called?
A) Burrows-Wheeler Transform
B) Huffman Coding
C) Run-Length Encoding
D) Differential Encoding
- 14. What is the term for the measure of how detailed the instructions are in an algorithm?
A) Complexity
B) Granularity
C) Efficiency
D) Scalability
|