Given the phrase ellipsis, please do the following: a) Build a priority queue for the word above. [ b) Using the Huffman Code Construction algorithmi, construct a Huffman code for the word above. Be sure to show your priority queue at each stage. *** c) Show the created Huffman code tree. [. d) What is the binary sequence of bits that represents ellipsis using your created Huffman code tree?

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question
Question 3
Given the phrase ellipsis, please do the following:
a) Build a priority queue for the word above. [
b) Using the Huffman Code Construction algorithmi, construct a Huffman code for the word above. Be
sure to show your priority queue at each stage. ***
c) Show the created Huffman code tree. [-
d) What is the binary sequence of bits that represents ellipsis using your created Huffman code tree?
(next page)
Algorithm: Huffman Code Construction
CreateHuffmanCode (pq) - → hc
Input: pq, a priority queue
Output: hc, a binary tree representing a Huffman code
1
2
3
4
5
6
7
while SizePQ(pq) > 1 do
x ← ExtractMinFromPQ(pq)
y ExtractMinFromPQ(pq)
sum ← GetData(x) + GetData(y)
z← CreateTree (sum, x, y)
InsertInPQ(pq, z)
return ExtractMinFromPQ (pq)
Transcribed Image Text:Question 3 Given the phrase ellipsis, please do the following: a) Build a priority queue for the word above. [ b) Using the Huffman Code Construction algorithmi, construct a Huffman code for the word above. Be sure to show your priority queue at each stage. *** c) Show the created Huffman code tree. [- d) What is the binary sequence of bits that represents ellipsis using your created Huffman code tree? (next page) Algorithm: Huffman Code Construction CreateHuffmanCode (pq) - → hc Input: pq, a priority queue Output: hc, a binary tree representing a Huffman code 1 2 3 4 5 6 7 while SizePQ(pq) > 1 do x ← ExtractMinFromPQ(pq) y ExtractMinFromPQ(pq) sum ← GetData(x) + GetData(y) z← CreateTree (sum, x, y) InsertInPQ(pq, z) return ExtractMinFromPQ (pq)
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 9 steps with 5 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY