Question
In the 0/1 knapsack problem, items have weights (1, 3, 4, 5) and values (1, 4, 5, 7), and the knapsack capacity is 7. What is the maximum total value that can be obtained?
More Algorithms Questions
- Which of the following is NOT a greedy algorithm?
- Which cloud service model provides developers with a platform to develop, run, and manage applications without worrying about the underlying infrastructure...
- Which data structure supports extraction of both min and max in O(1) time and insertion in O(log n)?
- In a Min-Heap, the root node is:
- Which of the following design patterns is primarily used to create objects without specifying the exact class of object that will be created?
- The Bellman-Ford algorithm executes relaxation steps how many times for a graph with V vertices?
- What will be the output of the following code snippet that demonstrates stack usage? stack = [] stack.append(1) stack.append(2) stack.append(3) print(...
- Consider the following Python code snippet for binary search: def binary_search(arr, target): low = 0 high = len(arr) - 1 ...
- Which algorithm uses a “divide and conquer” strategy?
- What is the primary purpose of normalization in database design?
Hey! Ask a query
Please enter email id
The email must be a valid email address.
Please enter Mobile Number
Please enter valid Mobile Number
Please enter your Doubt
Think You're Ready for RBI Grade B?
RBI Grade B 2026 Phase 1 Memory Based Paper
- 200 Questions with Detailed Solutions
- Section-wise Coverage (GA, English, Quant & Reasoning)