DAA Quiz AIML '26

Dijkstra’s algorithm is used to solve __________ problems?

• Network Lock

• Single source shortest path

• All pair shortest path

• Sorting

Which of the following is used for solving the N Queens Problem?

• Greedy algorithm

• Dynamic programming

• Backtracking

• Sorting

Which of the following sorting algorithms provide the best time complexity in the worst-case scenario?

• Merge sort

• Quick sort

• Bubble sort

• Selection sort

Which of the following is a Divide and Conquer algorithm?

• Bubble Sort

• Selection Sort

• Heap Sort

• Merge Sort

Another name of the fractional knapsack is?

• Non-continuous knapsack problem

• Divisible knapsack problem

• 0/1 knapsack problem

• Continuous Knapsack Problem

Select the correct recurrence relation for Tower of Hanoi?

• T(N) = 2T(N-1)+1

• T(N) = 2T(N/2)+1

• T(N) = 2T(N-1)+N

• T(N) = 2T(N-2)+2

What is the best case time complexity of the binary search algorithm?

• O(1)

• O(n)

• O(log2n)

• O(n^2)

Which of the following is known to be not an NP-Hard Problem?

• Vertex Cover Problem

• 0/1 Knapsack Problem

• Maximal Independent Set Problem

• Travelling Salesman Problem

Which of the following algorithms is an example of a greedy algorithm?

• Quick Sort

• Dijkstra’s shortest path algorithm

• Bellman-Ford algorithm

• Kruskal’s algorithm for minimum spanning tree

Which of the following algorithms is used to find the transitive closure of a directed graph?

• Floyd-Warshall algorithm

• Bellman-Ford algorithm

• Kosaraju’s algorithm

• Depth First Search