Based on the following tree and the phrase: "food of dog" fill in the following table: character frequency f Huffman code bits in codeb total bits = f*b g 1 4 d 2 space f 2 What is the average bits per character (round to one decimal place)

Based on the following tree and the phrase: "food of dog" fill in the following table: character frequency f Huffman code bits in codeb total bits = f*b g 1 4 d 2 space f 2 What is the average bits per character (round to one decimal place)

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: The probability that at least one of the bits is 0 in a sequence of 5 bits is 31/25?

A: We are going to find out the probability of finding 0 that at least in one of bits in sequence of 5…

Q: Consider a 6-bit two's complement representation. Fill in the box with question mark "?" in the…

A: What is 6 bit two's complement? So the answer is below: In two's complement, the sign of the…

Q: Using the Huffman Algorithm, encode the following string “Dear Essah,”. Where Surname is your…

Q: how many 11 - strings (that is, bit strings of length 11) are there which: a. start with sub -…

A: Given: how many 11 - strings (that is, bit strings of length 11) are there which: a. start with sub…

Q: Using the Huffman Algorithm, encode the following string “Hello Ama!!” Determine i. The Huffman-tree…

A: ANSWER:-

Q: Express each of these sets using a regular expression a. The set of strings with less than 4 bits.…

A: A basic model for a regular expression is a (exacting) string. For instance, the Hello World regex…

Q: Using the Huffman Algorithm, encode the following string “Dear Nuhu,”. Determine i. The Huffman-tree…

Q: How many eight-bit binary strings contain exactly 3 1s? How many eight-bit binary strings contain…

A: The question has been answered in step2

Q: Explain in plain English the following two regex: 1. egrep ‘(\b\w+\b) \1' example_2.txţ 2. egrep…

A: Below is the answer to above question. I hope this will be helpful for you..

Q: What is the asymptotic complexity of the following pseudocodes? Code 1 Code 2 i = 1 while i <n j = 1…

A: The length of the input determines how long an algorithm takes to run. It calculates how long it…

Q: a. Compute the divided difference table for the following tabulated data. (Note: a complete table…

A: The code in c++ is given below.

Q: 4 (**). Richard Hamming in 1950 produced an innovative way to improve the string parity error-…

A: Algorithm: 1. Take input 2. Run the input in the getBinary function. 3. Print output

Q: 1.After MOV AL, 0BCH DAA AL= 2.When two words are multiplied (one in BX), the most significant…

A: 1. Explanation: The value of AL after the “MOV AL, 0BCH DAA” is 22. The 0BCH moves the pointer to…

Q: Do the following without üsing a culator or a computer, but check your answers with a calculator or…

A: The answer is..

Q: How many hexadecimal strings of length 6 are there that consist of 6 different characters in…

Q: Complete the following table so that there is an equal value for each row. Assume each value is…

Q: What is the entropy of your name (first name + surname)?

A: We will answer the third question which is asked by you first among all the questions. If you want a…

Q: Suppose the largest n-bit binary number requires 'd' digits in decimal representing which of the…

A: Given:

Q: limit? What is the expected error with this optimum value? (b) Consider the expression 1020 + 424 –…

A: Answer: I have given answered in the handwritten format in brief explanation.

Q: Huffman Algorithm

Q: Modify the floating number based on the graph to one sign bit, 5 exponent bits, and 3 fraction bits.…

Q: Suppose a computer uses 4-bit one’s complementrepresentation. Ignoring overflows, what value will be…

A: It is given that a computer is using 4-bit one's complement representation. Ignore the overflow if…

Q: A = {paul, george} B= {ringo, george} U john paul ringo george A 1 1 B 0 1 1 For each of sets below:…

A: Step 1:- Note:-I have given the solution of both the parts. Introduction:- A= {paul, george} B=…

Q: Question One a. Using the Huffman Algorithm, encode the following string “Hello Ama!!” Determine i.…

A: Using the Huffman Algorithm, encode the following string “Hello Ama!!” Determinei. The…

Q: Solve this attachment.

A: 1.Little Endian :It is used to store the multi data type binary numbers .In LE format , the…

Q: What is the asymptotic complexity of the following pseudocodes? Code 1 i=1 while i <n j=1 while j <i…

Q: Given the following tree of prefix codes, decode the bit string: 010011111000101

A: E = 000 T = 010 A = 011 R = 100 J = 101 I = 110 X = 111

Q: 10 1010 1010 A: 11 0100 0010 B: 11 1110 1010 The set A U B can be represented as: • The set A B can…

Q: Use the CYK algorithm to determine whether or not the CFG below recognizes the following strings.…

Q: Using the Huffman Algorithm, encode the following string “Dear Duodu,”. Determine i. The…

A: Note: Answering the first three subparts as the guidelines. Given : String = Dear Duodu,

Q: Encrypt the animal name pangolin using the letter to number correspondence abcdef shijk 1 mnopar…

A: I have given an answer in step 2.

Q: Display all the leap years in a specific range - clone Given a year N, display all the leap years…

A: Below is the required C++ code. Leap Year: A Non century year is a leap year when it is perfectly…

Q: e Huffman coding to compress the letters in the following chart. What are the total bits of the…

A: Here we need to construct the huffman tree with which we can assign codes to each character. Here…

Q: 3) Use Huffman coding to encode the following symbols with the frequencies (probabilities) listed:…

A: Here in this question we have given some symbol with thier frequency and we have asked to use…

Q: (b) How many 8-bit strings have either 5 1 bits or 6 1 bits in them?

A: Answer: The Number of ways to form a 5 1-bits (or) 6 1- bits combination is : Explanation in the…

Q: Calculate the total number of bits per character. Record your answers in the chart. Character Code…

A: The question as been solved, kindly refer from step2

Q: Q13: What are the main difference between prefix and postfix notation? Q14: Find the value of B…

A: Prefix Postfix In the prefix notation a mathematical notation in which operators precede their…

Q: Algorithm, encode the following string “Dear Agbo,

A: From the given string mentioned in the question , we have, The total length of the given string is ,…

Q: a) Find the Hamming distance between the codewords that correspond to datawords 0111 and 1100. (b)…

A: Part (a) Hamming distance for any set of bits is calculated by the number of different…

Q: v [ Choose ] obsolete from the 1970's; uses just one 56-bit key symmetric algorithm; supports 128,…

A: DES Data Encryption Standard

Q: What is the asymptotic complexity of the following pseudocodes? Code 1 i=1 while i <n j=1 while j <i…

A: In this question we have to find the asymptotic complexity of the following pseudocodes. Let's find

Q: The following is an incomplete natural deduction derivation. Complete it by odding the correct…

A: Answer: I have given answer in handwritten format.

Q: 3. The following hexadecimal strings represent floating-point numbers in 32-bit IEEE standard.…

A: BD680000 Above Hex value is converted to Binary then, Binary value will be B D 6 8 0 0 0 0 1011…

Q: Do the following without using à cal- culator or a computer, but check your answers with a…

A: To represent 1026 different city names, we need to have a number of bits that can hold at least…

Q: Using the Huffman Algorithm, encode the following string “Dear Saba",. Determine i. The…

A: huffman encoding: Huffman coding is a lossless data compression algorithm. There are mainly two…

Q: a sequence is encoded using lz77 algorithm that c(a)=1, c(e')=2, c(r)=3, c(t)=4 then decode the…

A: Greetings. In the LZ77 compression algorithm, the triples carry the following meaning :

Q: Using the Huffman Algorithm, encode the following string “Dear Tetteh,”. Determine i. The…

A: NOTE : Answering only first 3 subparts as per the rules. In this we have given a string. We need to…

Q: how does byte stuffing overcome the disadvantages of character count algorithm?

A: In networking, the Datalink layer transfers data using bitstreams, called frames. The addresses of…

Concept explainers

Data Dictionary

A database management system has an entity-relationship diagram, data dictionary, and data model as some of its key components, which are tools for the users who are managing the database. One of them is the data dictionary. The data dictionary can also be called metadata. By definition, metadata is a generic concept in the world of information and technology. An example of metadata could be meta-information about a media file or an image file, like author, location, last updated, size, etc. The contents of a data dictionary are names, attributes, and properties of main data elements which are captured during an experiment or stored in an information system, for example, databases. We can also call it a central repository of information about the main data.

Question

Based on the following tree and the phrase: "food of dog" fill in the following table:
character
frequency f
Huffman code
bits in codeb
total bits = f*b
g
1
d
2
space
2
f
2
What is the average bits per character (round to one decimal place)
of

Expert Solution

This question has been solved!

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

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Step by step

Solved in 2 steps

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

Using the Huffman Algorithm, encode the following string “Dear Esene ,”. Determine i. The Huffman-tree ii. The Huffman-code iii. The average code length of bits saved iv. The proportion or percentage of bits save when variable-length encoding is used instead of fixed length encoding scheme.
What is the entropy of your name (first name + surname)?Using the results of Question 3, Encode the first three characters of your full name usingArithmetic code?
how does byte stuffing overcome the disadvantages of character count algorithm?
Trace the execution of binary search for key=72 showing each complete pass on the following number set showing how the order changes as the program executes. {2, 5, 7, 8, 10, 24, 32, 36, 46, 52, 55, 56, 67, 70, 72, 80};
Given the following frequencies of letters appearing in a file, use Huffman Coding to determine the average number of bits used to encode a symbol, the binary code used to represent each bit, and the resulting binary tree.A: 0.08, B: 0.10, C: 0.12, D: 0.15, E: 0.20, F: 0.35
Using the Huffman Algorithm, encode the following string “Dear Amoako,” Determine i. The Huffman-tree ii. The Huffman-code iii. The average code length of bits saved iv. The proportion or percentage of bits save when variable-length encoding is used instead of fixed length encoding scheme.
Using the Huffman Algorithm, encode the following string “Dear Agbo,”. i. The Huffman-tree ii. The Huffman-code iii. The average code length of bits saved iv. The proportion or percentage of bits save when variable-length encoding is used instead of fixed length encoding scheme.
//#include "subtractionOK.c" /* * BitsTree - return word with every third bit (starting from the LSB) set to 1 * Legal ops: ! ~ & ^ | + << >> * Max ops: 8 * Rating: 1 */ int BitsTree (void) { return 2; }
Convert to C language #include <bits/stdc++.h>using namespace std; //hash function 2int main(){ int n; cout << "enter number\n"; cin >> n; //f(n)=rand()*n cout << n << "->" << (rand() * n) % 10; return 0;} Output:
Discuss the benefits of binary and linear searching and how they differ.
Using the Huffman Algorithm, encode the following string “Dear Enam,”. Where Surname is your official or formal registered Surname as a student in GCTU. Determine (a) The Huffman-tree. (b) The Huffman-code (c) The average code length of bits saved. (d) The proportion or percentage of bits save when variable-length encoding is used instead of fixed length encoding scheme.
Prove the following statement: On average, a search miss in a TST constructed from N random string keys needs ln N character comparisons. Each character in the search key is compared in a character comparison for every search hit or insertion into a TST.