Consider the following two Huffiman decoding trees for a variable-length code involving 5 symbols: A, B, C, D and E Tree #1 Tree #2 I 0 A BC 0 1 B CD E D E A. Using Tree #1, decode the following encoded message: "01000111101". B. Suppose we were encoding messages with the following probabilities for each of the 5 symbols (A)- 0,5. p(B)-p(C)-p(D)-p(E)-0.125. Which of the two encodings above (Tree #1 or Tree #2) would yield the shortest encoded messages averaged over many messages? C. Using the probabilities of part (B), if you learn that the first symbol in a message is "B", how many bits of information have you received? 4 0

Consider the following two Huffiman decoding trees for a variable-length code involving 5 symbols: A, B, C, D and E Tree #1 Tree #2 I 0 A BC 0 1 B CD E D E A. Using Tree #1, decode the following encoded message: "01000111101". B. Suppose we were encoding messages with the following probabilities for each of the 5 symbols (A)- 0,5. p(B)-p(C)-p(D)-p(E)-0.125. Which of the two encodings above (Tree #1 or Tree #2) would yield the shortest encoded messages averaged over many messages? C. Using the probabilities of part (B), if you learn that the first symbol in a message is "B", how many bits of information have you received? 4 0

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

Similar questions

Given the following symbols and relative frequencies, construct a Huffman code tree. (Be sure when joining trees to consistently put the greater tree on the left.) Then determine the average number of bits needed to encode each symbol with those frequencies.E: 0.05, F: 0.09, G: 0.12, H: 0.13, I: 0.16, J: 0.20, and K: 0.25
Exercise 4 Consider the B-tree which is a result of inserting 15,14,1,2,13,12,3,4,11,10,5,6,9, (in that order) for t = 2. (a) Draw the trees before and after adding 9. (b) Draw the final tree after adding all numbers. (c) Next draw the tree after removing 14.
Suppose T is a binary tree with 17 nodes. What is the minimum possible depth of T? 1 3 4 2 A binary tree of N nodes has _______. Log2 N levels N / 2 levels Log10 N levels N x 2 levels The difference between a binary tree and a binary search tree is that : in binary search tree nodes are inserted based on the values they contain none of these in binary tree nodes are inserted based on the values they contain a binary search tree has two children per node whereas a binary tree can have none, one, or two children per node What is the best code for the following procedure: AddStudent(studentName):add a new student to an array of alphabetically ordered names . Hint: We must shift some students. size contains the number of students in the array AddStudent(studentName){ int i ; for( i=0; i< size-1; i++){ if(arr[i].compareTo( studentName)>0) break; for(int j= size-1 ; j >i…
Draw the diagrams of an AVL tree as the following items are inserted into an empty tree in the specified order: 8, 71, 90, 80, 84, 75. In your diagrams, indicate the balance factors after insertion (but before rotation), which rotations are done, and the balance factors after each step.
Draw a K-d tree for the following points inserted in this order (assume the root is an even level and that we use x coordiantes for the odd levels, y coordiantes for even levels): (10, 10) (5, 5) (8, 4) (12, 18) (15, 8)
Draw a KD Tree in the space below with these points inserted in the following order: (7,2), (6,4), (9,6), (8,1), (4,9), and (2,3). Assume the first level of the KD Tree is split along the x-axis. What point (from the KD Tree ) is the nearest neighbor of the point (1,4)?
1. Construct a Huffman tree by using these nodes. Value A B C D E F Frequency 6 20 9 15 3 10 2. Based from your Huffman Tree, show the corresponding code of every character including their total number of bits. Show your answer in a table similar to what is shown below: Character Frequency Code Total Bits 3. Give an example of combinations of binary codes, then decode this combinations using the Huffman code you generated
76. Which of the following is incorrect with respect to binary trees? a) Let T be a binary tree. For every k ≥ 0, there are no more than 2k nodes in level k b) Let T be a binary tree with λ levels. Then T has no more than 2λ – 1 nodes c) Let T be a binary tree with N nodes. Then the number of levels is at least ceil(log (N + 1)) d) Let T be a binary tree with N nodes. Then the number of levels is at least floor(log (N + 1))
This exercise is about drawing BSTs. You are asked to: Show the result of inserting 3, 1, 4, 6, 9, 2, 5, and 7 in an initially empty binary search tree. Then show the result of deleting the root. Draw all binary search trees that can result from inserting permutations of 1, 2 and 3. How many types of trees are there? What are the probabilities of each type of tree’s occurring if all permutations are equally likely Given the input {4371, 1323, 6173, 4199, 4344, 9679, 1989}, a fixed table size of 10, and a hash function H(X) = X mod 10, show the resulting Linear probing hash table Separate chaining hash table
Draw a red-black tree for the following values inserted in this order. Illustrate each operation that occurs: w k o s y t p r
a)Draw a red-black tree for the following values inserted in this order. Illustrate each operation that occurs: 11 20 30 28 16 13 55 52 26 50 87 b) Draw a 2-3-4 B-tree that corresponds to your red-black tree in problem a).
Perform what is asked. Show your solutions.1. Given the expression A - B / C * (D + E), convert to PREFIX and POSTFIX.2. Given the expression (A / B) ^ C * D, convert to PREFIX and POSTFIX. 3. Given the expression A || B && !C || !D, convert to PREFIX and POSTFIX. 4. Create a binary search tree using the following insertions.44, 88, 55, 77, 33, 99, 66, 22, 25, 75Based on the final tree, what is the preorder traversal of the tree?5. Create a binary search tree using the following insertions.44, 88, 55, 77, 33, 99, 66, 22, 25, 75Based on the final tree, what is the postorder traversal of the tree?