Create Quiz

# Quiz on Greedy Algorithms Question

## Questions for Greedy Algorithm. Difference Between Greedy Method and Dynamic Programming · Analysis of Algorithms AlgorithmsGreedy Quiz

You can mute/unmute sounds from here

## You May Get Result Of Quiz on Greedy Algorithms Question

Quiz on Greedy Algorithms Quiz
Quiz on Greedy Algorithms Quiz
Quiz on Greedy Algorithms Quiz
Quiz on Greedy Algorithms Quiz

## Fractional knapsack problem is also known as __________

0/1 knapsack problem
Continuous knapsack problem
Divisible knapsack problem
Non continuous knapsack problem

## Fractional knapsack problem is solved most efficiently by which of the following algorithm?

Divide and conquer
Dynamic programming
Greedy algorithm
Backtracking

## What is the objective of the knapsack problem?

To get maximum total value in the knapsack
To get minimum total value in the knapsack
To get maximum weight in the knapsack
None

## Which of the following statement about 0/1 knapsack and fractional knapsack problem is correct?

In 0/1 knapsack problem items are divisible and in fractional knapsack items are indivisible
Both are the same
0/1 knapsack is solved using a greedy algorithm and fractional knapsack is solved using dynamic programming
In 0/1 knapsack problem items are indivisible and in fractional knapsack items are divisible

O(n log n)
O(nW)
Both
None

True
False

45
60
80
None

True
False