Menu

Question Discussion & Solution

MCQ
Q.
For 0/1 KNAPSACK problem, the algorithm takes ________ amount of time for memory table, and ______time to determine the optimal load, for N objects and W as the capacity of KNAPSACK.

forum Community Discussion

speaker_notes_off

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

login Login to Discuss

auto_awesome Similar Questions

MCQ
1.
Bin packing problem is the application of ____________
forum Discussion
MCQ
2.
In the case of sub problems share sub problems ,which method is suitable
forum Discussion
MCQ
3.
which is optimal value in the case of job sequence problem

item1234567
profit3520181630
deadline1343212
forum Discussion
MCQ
4.
which is optimal value in the case of fractional knapsack problem, capacity of knapsack is 10

item12345
profit1232403050
weight48261
forum Discussion
MCQ
5.
The Knapsack problem where the objective function is to minimize the profit is ______
forum Discussion

category More Design and Analysis of Algorithms Topics

article

Design and Analysis of Algorithms Basics

format_list_bulleted 76 MCQs
Practice arrow_forward
article

Asymptotic Notation

format_list_bulleted 38 MCQs
Practice arrow_forward
article

Divide and Conquer Strategy

format_list_bulleted 18 MCQs
Practice arrow_forward
article

Sorting

format_list_bulleted 14 MCQs
Practice arrow_forward
article

Linear Time Sorting

format_list_bulleted 8 MCQs
Practice arrow_forward
article

Dynamic Programming

format_list_bulleted 18 MCQs
Practice arrow_forward
article

Greedy Algorithms

format_list_bulleted 10 MCQs
Practice arrow_forward
article

Backtracking Algorithms

format_list_bulleted 13 MCQs
Practice arrow_forward
article

Graphs

format_list_bulleted 18 MCQs
Practice arrow_forward
article

Complexity Theory

format_list_bulleted 11 MCQs
Practice arrow_forward