DAA-QUIZ

You are given a knapsack that can carry a maximum weight of 60. There are 4 items with weights {20, 30, 40, 70} and values {70, 80, 90, 200}. What is the maximum value of the items you can carry using the knapsack?

• 160

• 200

• 170

• 90

Which of the following methods can be used to solve the Knapsack problem?

• Brute force algorithm
  
  

• Recursion
  
  

• Dynamic programming

• Brute force, Recursion and Dynamic Programming

Which of the following sorting algorithms is the fastest?

• Merge sort
  
  

• Quick sort

• Insertion sort

• Shell sort

What is the worst case time complexity of a quick sort algorithm?

• O(N)

• O(N log N)

• O(N²)

• O(log N)

What is the average case time complexity of merge sort?

• O(n log n)

• O(n²)

• O(n² log n)

• O(n log n²)

What is the auxiliary space complexity of merge sort?

• O(1)

• O(log n)

• O(n)

• O(n log n)

What is the time complexity of the best case scenario for quick sort?

• O(N)

• O(N log N)

• O(N^2)

• O(log N)

Which data structure is typically used to implement a priority queue?

• Array

• Linked List

• Heap

• Stack

What is the space complexity of the Breadth First Search (BFS) algorithm?

• O(N)

• O(log N)

• O(N^2)

• O(N + E)

What is the time complexity of the best case scenario for insertion sort?

• O(N)

• O(N log N)

• O(N^2)

• O(log N)