(a) Make a table with the relative frequencies of the letters that occur in this phrase. (b) Construct a binary tree to get a Huffman coding of this message. (c) Encode the message using the Huffman coding you got in part (a).

(a) Make a table with the relative frequencies of the letters that occur in this phrase. (b) Construct a binary tree to get a Huffman coding of this message. (c) Encode the message using the Huffman coding you got in part (a).

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Q: Design a binary tree of your choice in three ways and treverse it

A: Binary tree: A binary tree is a tree that composed of nodes, each of which has at most, two…

Q: 1. Provide a CFG for each of the following regular expressions. Follow your answer up by providing a…

A: ANSWER:-

Q: For example, the code on the left should create a tree on the right: int main () { PrefixTreeNode…

Q: Construct a binary search tree by inserting digits of your mobile number concatenated with pincode…

A: Binary search tree is a type of binary tree in which every node contains at most two child nodes. In…

Q: Construct a Binary Tree from a list of 20 numbers of your choice and verify it. Note : need daigram…

A: A binary tree is a data structure, in which each node has at most two successor nodes: the left node…

Q: Draw the Binary Expression Tree (( A * B) / (C - D)) + ((E/F)*G)

A: In a binary tree each internal node corresponds to a operator and the leaf nodes corresponds to an…

Q: Construct the Huffman tree for the text “a simple string to be encoded using a minimal number of…

A: A binary tree that has a special criteria that each of the node can have the maximum of the two…

Q: Show the binary tree representation of the following arithmetic expression: (a - b)? + 40 / (x³).…

A: Answer is attached in screenshot, over here no restriction hence made this way

Q: 1. (30 pts) Given a string representing the root of a binary tree (NOTE: Not a BST, there is no sort…

A: #include <bits/stdc++.h>using namespace std; vector<int> getNumbers(string str){ //…

Q: You are given a binary tree in which each node contains an integer value (which might be positive or…

A: Step 1: Initialize variables and helper functions Create a helper function called…

Q: Huffman codes

A: In the above question, a statement along with character and it's corresponding frequencies is…

Q: A text is compressed using the Huffman coding method. Codified writing and Huffman code which checks…

Q: c++ Use the picture as starting point. Add the key 45 to the AVL tree structure in figure (i) and…

A: zAVL tree is a complete balanced binary tree. In this we calculate the balanced factor for each node…

Q: A/(B-C) + DS (E* M) Make a binary tree to illustrate the expression.

Q: a. Construct the labeled tree representing the algebraic expression (((x – 2) + 3) – (y + 2)) / ((2…

A: Introduction of Tree in Discrete Mathematics: A tree is an acyclic graph or a graph that has no…

Q: 10. Draw the expression tree with this postfix form (% is modulo operation) wpy/+ma+xb%*+ mk Binary…

A: Dear Student, The simplest way to solve this question is to first convert the postfix to infix…

Q: Draw a binary expression tree that represents the expression 3 * (( 7 + 1) / 4) + (17 – 5) Also,…

A: Binary expression tree:- A binary expression tree is a specific type of tree data structure that is…

Q: Develop a python program for adding a new node to the binary tree. Also provide the screenshot of…

A: Given: Develop a python program for adding a new node to the binary tree. Also provide the…

Q: Build the binary tree using three sequences (input is left to right) A. 1, 2, 3, 4, 5 B. 5, 3, 4,…

A: Here are the steps to build the binary tree:Start with the root node: The first element in sequence…

Q: Determine the Huffman tree and Huffman code for the last 16 letters of the alphabet K-2, where the…

A: 1 point: E ×12, A ×9, I ×9, O ×8, N ×6, R ×6, T ×6, L ×4, S ×4, U ×4 2 points: D ×4, G ×3 3 points:…

Q: Construct a Huffman tree by using these nodes. Value A B C D E…

A: Huffman : It assign a variable-length codes to input characters, lengths of codes has frequencies…

Q: There is an error on the following MIB tree. Explain what the error is. Correct it and then provide…

A: Solution: MIB stands for Management Information Base which is a database used for managing the…

Q: Convert the following into parentheses expressions into binary tree. thank u !! (A (B (C,D),…

A: Given parentheses expression contains nodes from A to Z. Based on the position of the position of…

Q: The Binary Search Tree (BST) is really cool. It stores data quickly, it’s able to print it in…

A: A binary search tree (BST) is a binary tree data structure which has the following properties:…

Q: Select the equation represented by this tree A в Y A. (A + B )+ ( X * Y) B. A+(X* Y) +.B C. A+(B +…

A: equation represented by tree are

Q: write a java program to find the height of an AVL tree.

A: Node class: Represents a node in the AVL tree. It contains the node's data, references to its left…

Q: 2. A string bit consists of 0 and 1. A string bit of length 5 can be 00101 or 10111. 1. Constructs a…

A: The question asks for creating tree diagrams for a string bit of length 4. Next, it is asking to…

Q: Based on the given tree, answer the following questions: 2 5 11 10 12 15 14 19 a. What is the height…

A: According to our company's policy, we are obliged to answer only the first three questions in case…

Q: Whis is the pre,post and in order of the given tree?

A: Refer to step 2 for the answer.

Q: Isn't this a normal binary tree and not an ordered? Could an ordered one be provided?

A: In this question we have to get the ordered tree Let's implement

Q: Use python only. *Print elements of all the Nodes of a tree using Post-order Traversal and…

A: Python program to print the tree in post-order traversal and a method to create a copy of a tree.

Q: Draw the Digital-Search tree that results from inserting the characters {'L', 'O', 'N', 'D', 'O',…

A: In this at each level of the tree a bit is checked ,generally the first bit is checked if the bit…

Q: Imagine data (items) is stored in a complete binary tree of height 20. What is the maximum number…

A: A tree is known as complete binary tree where all the levels in the tree are filled completely…

Q: Consider the following Binary Tree: 10 5 12 20 15 25 What is the height of the node with the value…

A: Part(a) The number of edges from the node to the deepest leaf determines a node's height. To…

Q: Create a program to calculate the sum of all the items in a binary tree.

A: Given Question Create a program to calculate the sum of all the items in a binary tree. As no…

Q: help in building a binary expression tree. It gas to echo print each arithmetic infix expression and…

A: It is defined as the nodes connected by edges. We will discuss binary tree or binary search tree…

Q: lowing duplicate letters, which will be inserted to the left when the duplicate is encountered. Then…

A: C++ Code to build the binary tree is as given below.

Q: A complete binary tree has a shape that is either a triangle or a triangle with a bite out of the:

A: here basic property of complete binary tree is asked :

Q: Given an m-by-n chocolate bar, you need to break it into mn 1-by-1 pieces. You can break a bar only…

A: Consider the special case of a chocolate plate: (1 x y). You need (x-1) breaks to fully split this…

Question

100%

Consider the phrase: "Trees are fun". The relative frequencies of the letters are given in
the table below.
(a) Make a table with the relative frequencies of the letters that occur in this phrase.
(b) Construct a binary tree to get a Huffman coding of this message.
(c) Encode the message using the Huffman coding you got in part (a).

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Step 3

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 3 steps with 3 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

Imagine data (items) is stored in a complete binary tree of height 30.What is the maximum number of items stored in this data structure? Show your workings. You should not use any calculator
Write a python Program to Starting with an empty red/black tree, draw the tree after insertion and before rebalancing, and after rebalancing (if necessary) for the following series of inserts and removals: AddElement(40); AddElement(25): AddElement(10); AddElement(5); AddElement(1); AddElement(45); AddElement(50); RemoveElement(40); RemoveElement(25);
Refer to the tree on the picture and answer the following questions 1. Aside from its children, list 2 other descendants of node C. Your answer must be values that are adjacent when the nodes are arranged alphabetically in ascending order. For example, the descendant nodes are: ABX Y. You cannot answer A X since you have skipped B and B Y since X has been skipped. * 2. What is the path from node A to node L? * 3. What is the length of the path from node C to node N? Note: answer with the number's symbol and not the word form of the number.* 4. List 2 nodes that are at level 2 of the tree. Your answer must be values that 1 point are adjacent when the nodes are arranged alphabetically in ascending order. For example, the nodes at a certain level are: A B X Y. You cannot answer A X since you have skipped B and B Y since X has been skipped. * 5. What is the height of the tree? Note: answer with the number's symbol and not the word form of the number.* 6. What is the height of node C? Note:…
What is the index of the right child of the node with index 5, given an array representation of a binary tree? O a. 9 O b. 11 O c. 12 O d. 10
Create a Huffman tree to encode the following alphabet, then answer the questions below letter frequency A D 4 C 2 E 7 R 8 9.
Write an Algorithm ( pseudo-code) that counts the number of nodes in a binary tree.
Convert the following into Binary Tree. Thanks (A (B (C,D), E(F(G,H), I(J) ), K (L(M), N(O,P) ), Q(R,S(T), U(V(W), X,Y,Z) ) ) )
Perform an inorder traversal of the tree to reveal a message.
Write a method for an already constructed binary search tree that will swap the values of the largest value and the smallest value. (The resulting tree might not carry the properties of a binary search tree, but it is ok)
Write a Java program to Construct a 2-3 tree with at last 10 key values, Search the particular key value present in the 2-3 tree or not and finally Delete any one leaf node which has single key value.
Generate a binary tree data structure in Python. Use values of your choice. Using a snipping tool OR print screen (PrtScr) on the keyboard copy and paste the created output on the answer sheet.