Algorithms and Data Structures Quiz

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

• Floyd-Warshall Algorithm

• Dijkstra’s Algorithm

• Bellman-Ford Algorithm

• Kruskal’s Algorithm

Which technique is used in Backtracking algorithms?

• Divide and Conquer

• Greedy Approach

• Recursion

• Dynamic Programming

Which data structure is used for implementing the A search algorithm?

• Stack

• Priority Queue

• Linked List

• Binary Search Tree

What is the worst-case time complexity of the Floyd-Warshall algorithm?

• O(n log n)

• O(n²)

• O(n³)

• O(2ⁿ)

What is the main advantage of using the KMP string matching algorithm over Naive string matching?

• Uses hashing

• Works in O(n²) time

• Avoids unnecessary comparisons

• Works only on sorted strings

Which of the following problems is solved using Dynamic Programming?

• Kruskal’s Algorithm

• Prim’s Algorithm

• 0/1 Knapsack Problem

• Depth-First Search

Which sorting algorithm is considered the most efficient in worst-case scenarios?

• Merge Sort

• Bubble Sort

• Selection Sort

• Insertion Sort

Which graph algorithm is used to detect strongly connected components?

• Kruskal’s Algorithm

• Tarjan’s Algorithm

• Bellman-Ford Algorithm

• Dijkstra’s Algorithm

Which data structure is best suited for implementing LRU caching?

• Stack

• Heap

• HashMap + Doubly Linked List

• Queue

Which algorithm is used to solve the Traveling Salesman Problem optimally?

• Bellman-Ford

• Floyd-Warshall

• Branch and Bound

• Greedy Algorithm