Which of the following statement about 0/1 knapsack and fractional knapsack problem is correct?
A. In 0/1 knapsack problem items are divisible and in fractional knapsack items are indivisible
B. Both are the same
C. 0/1 knapsack is solved using a greedy algorithm and fractional knapsack is solved using dynamic programming
D. In 0/1 knapsack problem items are indivisible and in fractional knapsack items are divisible
Answer: Option D
This Question Belongs to Data Structure >> Miscellaneous On Data Structures
Which data structure is used to implement a binary heap efficiently?
A. Array
B. Linked List
C. Stack
D. Queue
In which scenario would you use a Bloom Filter?
A. For implementing a stack-based algorithm
B. To maintain a balanced binary tree
C. For efficient sorting of elements
D. To test membership in a large dataset
A. Queue
B. Stack
C. Heap
D. Array
Join The Discussion