Algorithm Fundamentals

What is the time complexity of Quick Sort in the average case?

• O(n)

• O(n^2)

• O(n log n)

• O(log n)

What is the primary difference between linear search and binary search?

• Linear search is sequential; binary search is logarithmic and requires a sorted list.

• Binary search can be used on unsorted lists.

• Linear search is faster than binary search.

• Linear search requires a sorted list to function.

In which scenario would you prefer a breadth-first search over a depth-first search?

• When searching for all possible paths in a graph.

• When the graph is weighted and you need to minimize cost.

• When finding the shortest path in an unweighted graph.

• When the graph is very deep and memory usage is a concern.

What is the time complexity of the binary search algorithm?

• O(n log n)

• O(1)

• O(log n)

• O(n)

What is a common use case for Dijkstra's algorithm?

• Sorting a list of numbers efficiently.

• Finding the minimum spanning tree of a graph.

• Finding the shortest path in a graph.

• Calculating the maximum flow in a network.

Define recursion in the context of algorithms.

• Recursion is a method in algorithms where a function solves a problem by calling itself with a subset of the original problem.

• Recursion involves breaking a problem into smaller independent problems without self-reference.

• Recursion is a technique where a function iterates over a list of items.

• Recursion is a method that uses loops to repeat a set of instructions.

What is the base case in a recursive function?

• The base case is the condition that terminates the recursion.

• The base case is the main function of the program.

• The base case is the maximum depth of recursion.

• The base case is the first call in the recursion.

What is the time complexity of Merge Sort?

• O(n log n)

• O(n)

• O(log n)

• O(n^2)

How does the A* search algorithm differ from Dijkstra's algorithm?

• A* is faster than Dijkstra's in all scenarios.

• A* uses heuristics for path prioritization, while Dijkstra's explores all paths based on cumulative cost.

• A* guarantees the shortest path, while Dijkstra's does not.

• Dijkstra's algorithm uses heuristics, while A* does not.

What is the purpose of the 'visited' array in graph traversal algorithms?

• To store the weights of edges in the graph.

• To keep track of the shortest path found so far.

• To count the total number of nodes in the graph.

• To track visited nodes and prevent revisiting them during graph traversal.