Algorithm Quiz 30 Questions

What is the time complexity of binary search in a sorted array?

• O(n)

• O(log n)

• O(n log n)

• O(1)

Which sorting algorithm is the fastest on average for general use?

• Bubble Sort

• Insertion Sort

• Merge Sort

• Quick Sort

Which of the following is not a divide and conquer algorithm?

• Merge Sort

• Quick Sort

• Binary Search

• Bubble Sort

What does Big-O notation describe?

• The exact number of steps

• The best case performance

• The average performance

• The upper bound on time complexity

Which data structure is used in a Breadth-First Search (BFS) algorithm?

• Stack

• Queue

• Heap

• Tree

What is the main idea of dynamic programming?

• Trying all possibilities

• Recursion with backtracking

• Solving subproblems and storing their results

• Sorting inputs before solving

Which algorithm is used for finding the shortest path in a graph with non-negative weights?

• Prim's Algorithm

• Kruskal’s Algorithm

• Dijkstra’s Algorithm

• Depth-First Search

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

• O(n log n)

• O(n²)

• O(log n)

• O(n)

In which scenario is a greedy algorithm guaranteed to provide the optimal solution?

• When the problem has overlapping subproblems

• When the problem has optimal substructure

• When all choices are independent and have the greedy choice property

• When recursion is not applicable

What is the best case time complexity of insertion sort?

• O(n²)

• O(n)

• O(log n)

• O(n log n)