Time Left - 15:00 mins

# GATE 2022: Algorithm Quiz-5

Attempt now to get your rank among 231 students!

Question 1

Which among the following statements are incorrect in terms of Greedy approach?

Question 2

What is the maximum profit obtained by process in below jobs within their deadlines?

Question 3

Which of the following is true about Huffman coding?

Question 4

Find the maximum possible value for fractional Knapsak problem?

Knapsack capacity (W) = 20

Knapsack capacity (W) = 20

Question 5

Consider 5 jobs with their respective profits and deadline for their completion as follows

Difference of total profit and profit of J3____.

Question 6

A company want to send the message. But before transmitting it want to encode the message. Suppose the message contains the following characters with their frequency.

Each character takes one Byte. If company uses Huffman coding technique. The number of bytes it saved is ________?

- 231 attempts
- 0 upvotes
- 2 comments

Tags :

GATE & PSU CSAlgorithmsAug 9GATE & PSU CS

Posted by: