adplus-dvertising
frame-decoration

Question

Which of the following problems were reduced to Knapsack?

a.

Exact Cover

b.

Max Cut

c.

0-1 integer programming

d.

None of the mentioned

Answer: (a).Exact Cover

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Which of the following problems were reduced to Knapsack?

Similar Questions

Discover Related MCQs

Q. An exact cover problem can be represented using:

Q. For which of the following, greedy algorithm finds a minimal vertex cover in polynomial time?

Q. Hamilton circuit problem can have the following version/s as per the input graph:

Q. Hamilton Circuit problem is a special case of ____________

Q. Which of the following cannot solve Hamilton Circuit problem?

Q. State true or false:
Statement: Hamiltonian cycles through any fixed edge is always even, so if one such cycle is given, the second one must also exists.

Q. Fibonacci number falls in the category of _________ combinatorics.

Q. All set of polynomial questions which can be solved by a turing machine using a polynomial amount of space:

Q. PSPACE is strictly the super set of:

Q. Savitch theorem relates to which of the following:

Q. The class PSPACE is closed under the following operations:

Q. Correct the given order:
NL∈ P∈ NP∈ PH∈ PSPACE

Q. NL ∈ PSPACE ∈ EXPSPACE
The given relation involves which of the following theorems?

Q. Statement : All PSPACE problems can be reduced to PSPACE-complete problems.
State true or false:

Q. Without needing extra __________ we can simulate non deterministic turing machine using deterministic turing machine.

Q. Complement of all the problems in PSPACE is ________

Q. Which of the following PSPACE can be characterized into?

Q. A randomized algorithm uses random bits as input inorder to achieve a _____________ good performance over all possible choice of random bits.

Q. Which of the following options match the given statement:
Statement: The algorithms that use the random input to reduce the expected running time or memory usage, but always terminate with a correct result in a bounded amount of time.

Q. Which of the following are probalistic algorithms?