DAA B3 Batch

Name

Roll No

1.Which of the following algorithms are used to find the shortest path from a source node to all other nodes in a weighted graph?

• BFS
• Prim's Algorithm
• Kruskal's Algorithm
• Djikstra's Algorithm

2.What is the maximum number of swaps that can be performed in the Selection Sort algorithm?

• n-1
• n-2
• n
• 1

3.What is the technique called in which it does not require extra memory for carrying out the sorting procedure?

• Stable
• Unstable
• In-Place
• In-Partition

4.What is the time complexity of the binary search algorithm?

• O(n)
• O(1)
• O(log2n)
• O(n^2)

5. Which of the following is a Divide and Conquer algorithm?

• Bubble Sort
• Selection Sort
• Heap Sort
• Merge Sort

6.An algorithm is __________?

• A Problem
• A Procedure for solving problem
• A real-life mathematical problem
• None of the above

7. Another name of the fractional knapsack is?

• Non-continuous knapsack problem
• Divisible knapsack problem
• 0/1 knapsack problem
• Continuous knapsack problem

8.Dijkstra’s algorithm is used to solve __________ problems?

• Network Lock
• Single source shortest path
• All pair shortest path
• Sorting