GATE CS 2017 (Afternoon) — Question 50

AlgorithmsGreedy Approach & Divide-and-Conquer DesignsNAT2 marksMedium

A message is made up entirely of characters from the set X = \{P, Q, R, S, T\}. The table of probabilities for each of the characters is shown below:
Question image
If a message of 100 characters over X is encoded using Huffman coding, then the expected length of the encoded message in bits is ________.
Practise the full 2017-AN paper
Challenge a friend: WhatsApp Telegram
Recommended book · affiliate linkIntroduction to Algorithms (CLRS)The standard reference behind most GATE algorithm questions.
Practise more on Greedy Approach & Divide-and-Conquer DesignsTimed, in the real exam interface · free to start

A GATE question every morning

One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.

Join
Stuck? Ask in the student group