Q2: Consider a zero memory source with: S= {s1, s2, s3, s4, s5, s6, s7}; P= {0.1, 0.15, 0.05, 0.25, 0.3, 0.05, 0.1}; Construct: (1) Shannon – Fano Binary Encoding, (2) Huffman binary codes and (3) Huffman Trinary codes; And also find efficiency (n.) in each case

Q2: Consider a zero memory source with: S= {s1, s2, s3, s4, s5, s6, s7}; P= {0.1, 0.15, 0.05, 0.25, 0.3, 0.05, 0.1}; Construct: (1) Shannon – Fano Binary Encoding, (2) Huffman binary codes and (3) Huffman Trinary codes; And also find efficiency (n.) in each case

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

A processor uses a serial link to communicate with a keyboard for word processing. A typist using this keyboard can type at rates peaking at 120 words per minute, where a word is 6 characters (including spaces and punctuation). The characters will be transmitted from the keyboard in 8-bit ASCII with one stop bit and no parity. Only consider these and no special characters. The programmer writes setup and polling service routines based on a minimum baud rate, but then finds that the keyboard will only interface at 19.2 Kbaud. Will the polling service routine have to change? Why or why not? Baud Rates 300 600 1200 2400 4800 9600 19200
A digital counter is a device that generates binary numbers in a specified count sequence. The counter progresses through the specified sequence of numbers when triggered by an incoming clock waveform, and it advances from one number to the next only during the occurrence of a clock pulse. The counter cycles through the same sequence of numbers continuously so long as there is an incoming clock pulse. You are to build a 3-bit synci. us count-down counter, which is a counter that counts down goes throug.. Linnni states 111 to 000 and back to 111 to repeat the cou. are to use a positive-edge-tgered JK flip-flops. In the first step of the design, you ecu .- Flop inputs (1 column for each flip-flop input) The present state pur uv.. design and should enumerate the count sequence. The next state columns should specif wnicn slale wn cuo next, given the present state. For example, if circuit is in a present state of the nevt ate in a down-count sequence would be 0. You should design the FF…
Consider a data type called nibble its length is 4 bits. The min and max number of signed nibble is Select one: a. -8, +7 b. 0, 15 c. 0, 16 d. -8, +8
5
Computer science question
which one is valid instruction * LDS AL,[BX] LDS AX,[CS] DAA XOR AX,AX NOT AX,AX which one is valid instruction * IN 0245 ,AL IN DL,0245H IN AL,DL IN 0245,AL IN 0245,DL IN AL,0245
Provide the correct answers to each question
The table below shows a segment of primary memory from a Von Neumann model computer Address Data 10101000 10001000 11001000 10011001 10100000 10101010 10110100 10111011 10001100 11001100 The program counter (PC) contains a value of 11001000. Find the value (in binary) that will be placed in MAR (memory address register)? MAR (in binray) %3D Find the value (in binary) that will be placed in MBR (memory buffer register)? MBR = (binray) %3D
A Gray code is a sequence of binary numbers with the property that no more than 1 bit changes in going from one element of the sequence to another. For example, here is a 3-bit binary Gray code: 000, 001, 011, 010, 110, 111, 101, and 100. Using three D flip-flops and a PLA, construct a 3-bit Gray code counter that has two inputs: reset, which sets the counter to 000, and inc, which makes the counter go to the next value in the sequence. Note that the code is cyclic, so that the value after 100 in the sequence is 000.
Consider a 32-bit hexadecimal number stored in memory as follows: Address Value 100 2A 101 C2 102 08 103 1B If the machine is big endian and uses two’s complement representation for integers, write the 32-bit integer number stored at address 100 (you may write the number in hex). Make it fast
In this problem we will work through a round of DES. For notational simplicity, assume it is the first round. Please enter all answers as strings of O's and 1's. The input is the 64 bit block 0000000000000100000000000100001000100000000000000000100000000000 Suppose that the subkey for the current round is this 48 bit number: 000000000000000010000000000000000000000000000000 What does the 64 bit state lok like after the IP transformation is applied to the input? Now find Ln and Ro, the left and right halves of the state. Lo =0 Ro = What is the result of applying the expansion box to Ro? E(Ro) = 0 What is the result of XORing the subkey with E(Ro)? k1 e E(Ro) = We now apply the S-box transformation. S(kı O E(Ro)) = Finally we apply the permutation box to complete the function f. f(Ro) = P(S(kı O E(Ro))) = We can now compute the state of DES going into the next round. L, =|| Rj =
Let (BX)=100H, DI=200H, DS 1200H, SI= F002H, AX= 0105H, and the following memory content. what is the content of SI after executing the MOV SI, [DI+BX+7H] ?instructions Memory Memory address content 12300 11 12301 AA 12302 EF 12303 80 12304 47 12305 8D 12306 5A 12307 92 12308 C5 SI = C592H O SI-F002H O SI = 92C5HO SI = EF80HO SI = 80EFHO If BL=XXH and make CMP BL,BL the sign and zero flags will be SF=1, ZF=0 O depend on the value on the BL register O SF=0, ZF=1 O SF=ZF=0 O SF=ZF=1 O