Question Discussion & Solution

MCQ

which is optimal value in the case of job sequence problem

item	1	2	3	4	5	6	7
profit	3	5	20	18	1	6	30
deadline	1	3	4	3	2	1	2

(1,5,6,4)

(7,6,4,3)

(2,3,1,7)

(1,2,3,4)

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

0/1 knapsack is based on ____________method

greedy method

branch and bound

dynamic programming

divide and conquer

Discussion

MCQ

which is not feasible solution in the case of job sequence problem

Item	1	2	3	4
Profit	100	10	15	27
deadline	2	1	2	1

(1,4)

(4,3)

(2,4)

(1,2)

Discussion

MCQ

In Knapsack problem, the best strategy to get the optimal solution, where Pi, Wi is the Profit, Weight associated with each of the Xith object respectively is to

Arrange the values Pi/Wi in ascending order

Arrange the values Pi/Xi in ascending order

Arrange the values Pi/Wi in descending order

Arrange the values Pi/Xi in descending order

Discussion

MCQ

From the following pick the one which does not belongs to the same paradigm to which others belongs to.

Minimum & Maximum problem

Knapsack problem

Selection problem

Merge sort

Discussion

MCQ

Bin packing problem is the application of ____________

Knapsack

Branch and bound

Back tracking

Dynamic programming

Discussion

Banking

Engineering

General

Medical

Question Discussion & Solution

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Design and Analysis of Algorithms Topics

Design and Analysis of Algorithms Basics

Asymptotic Notation

Divide and Conquer Strategy

Sorting

Linear Time Sorting

Dynamic Programming

Greedy Algorithms

Backtracking Algorithms

Graphs

Complexity Theory

Banking

Engineering

General

Medical

Question Discussion & Solution

report Report Error

forum Community Discussion

auto_awesome Similar Questions

report Report Error

report Report Error

report Report Error

report Report Error

report Report Error

category More Design and Analysis of Algorithms Topics

Design and Analysis of Algorithms Basics

Asymptotic Notation

Divide and Conquer Strategy

Sorting

Linear Time Sorting

Dynamic Programming

Greedy Algorithms

Backtracking Algorithms

Graphs

Complexity Theory

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Design and Analysis of Algorithms Topics