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

Related questions

Q: Given a 1000 × 1000 picture in true color (24-bit depth), how many bytes will be needed to store…

A: Since it is having 256 different colors,then the BPP or bits per pixel is 8bpp . Now applying…

Q: Consider a magnetic disk drive with 8 surfaces, 512 tracks per surface, and 64 sectors per track.…

Q: A discrete memory less source is represented the table Si P(S) S1 S2 S3 S4 S5 S6 0.3 0.25 0.2 0.12…

A: Here we find entropy and IR:…

Q: Question 1 Consider the application of a (7. 4) Hamming code in a digital communication system. (a)…

A: (As per guidelines we can answer only one question.) QUESTION 2 a) In block codes, information…

Q: 2. (b) Suppose, a synchronous TDM multiplexer combines 5 sources and sends only TWO characters from…

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

Q: Show that the Internet checksum will never be OxFFFF (that is, the final value of sum will not be…

Q: What is the worst case efficiency for a path compression algorithm?

A: please check the step 2 for answer

Q: Ox00400028 Ox0040002C Ox00400030 sll $s0, $0, 3 addi $to, $s1, -20 sub $t1, $to, $s0 NEXT_4:…

A: It is defined as the way of specifying data to be operated by an instruction is called addressing…

Q: QI: Consider a line starts at (8,6) and end with (3,1), use the DDA to rasterize the line then…

A: DDA : DDA stands for Digital Differential Analyzer. It is an incremental method of scan conversion…

Q: Data compression is a very important research topic in Computer Science that enabled the creation of…

A: The Python code for function RLE is given below with code and output screenshot 2 testcases are used…

Q: Q1. What is line coding? Discuss the characteristics of line coding. Q2. What is pulse code…

A: Note: As per guidelines we are supposed to answer only first 3 question at a time .please repost the…

Q: 2. (b) Suppose, a synchronous TDM multiplexer combines 5 sources and sends only TWO characters from…

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

Q: Suppose a file of 10,000 bytes is to be sent over a line at 2400 bps. A. Calculate the overhead in…

A: ANSWER:-

Q: 5.1 Evaluate rdx(64,10,4) 0064 5.2 Evaluate rdx(64,8,4) 0100 5.3 Evaluate rdx(64,2,0)…

A: According to Bartleby Guidelines we should answer only three sub questions so i have answered the…

Q: As information centers are progressively centered on energy efficiency, it gets to be imperative to…

A: Huffman coding: A minimum character coding of variable length based on each character's frequency.…

Q: Assume the following parameters for Go-Back-N: a) N = 4 b) Round Trip Time (RTT) = 10 ms c)…

Q: A message source emits an alphabet of seven symbols whose probabilities are P(XO) = 1/4, P(X1) 1/8,…

A: Shannon Fano code is a technique for lossless data compression. This is named after Claude Shannon…

Q: Q2: Consider a zero memory source with: S= {sl, s2, s3, s4, s5, s6, s7}; P= {0.10, 0.15, 0.10, 0.25,…

Q: Suppose you have an LFSR with state bits (also known as the seed) (85, 84, 83, 82, 81, 80) = (0,…

A: Given The answer is given below

Q: Let G = ({S,A},{0,1},P,S) where P:S-OS, S-A, .A - 1A, A- 1. Then L(G) = {0m1"|m > 0, n 2 1} :Select…

A: Defined the given statement true or false

Q: Q1] A 700 Mbyte CD is used to store PCM voice data. Suppose that a CT voice signal is sampled at 10…

A: Answer :- 1 Data Rate (R) = fs.n =10 kHz × 8-bitSample…

Q: Suppose you have an LFSR with state bits (also known as the seed) (s5, S4, S3, S2, S1, So) = (1, 1,…

A: LFSR stands for Linear Feedback Shift Register, it is a type of shift register whose input bit is a…

Q: Construct a PDA which accepts the set of bit strings with 2/3 as many 0 bits as 1 bits. (For…

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

Q: Q8/F(A,B,C,D)= Σm(0,2,5,8,10,13)+Σd(1,7,12,15) G(A,B,C,D)= [m(6,7,11,12)+[d(0,2,3,8,13,15) Chose the…

Q: Compute CBC-MAC for a message of 16 bits, “8642” (in Hexa). Assume a block size of 8 bits with an…

Q: Suppose a digitized voice channel is made by digitizing 8 kHz bandwidth analog voice signal. It is…

A: Used formula bit rate 2 * sampling rate * sampling size

Q: b) A discrete memoryless source has an alphabet of five symbols (A,B,C,D,E). A long message…

A: Given: Contruct haffman coding. See below steps

Q: LZW algorithm we make two 1000 letter words with the following probabilities for each letter:…

A: Here below i explain why reason behind the differences of compression ratios:…

Q: OUR ANSWER MUST BE WRITTEN IN CORAL Summary: Given integer values for red, green, and blue,…

A: Source Code: integer rinteger binteger ginteger min r = Get next inputb = Get next inputg = Get next…

Q: Translate the following RISC-V function F1 into machine code both in binary and hexadecimal: addi…

A: Problem 1: Translate the following RISC-V function F1 into machine code both in binary and…

Q: Next time you snap a picture, you realize you are capturing millions of pixels into a buffer. The…

A: Below, I have provided the code for performing the task asked in question. I have changed the code a…

Q: 2. (a) Suppose, a synchronous TDM multiplexer combines 5 sources and sends only three characters…

A: Answer: Our instruction is answer the first three part from the first part and .I have given…

Q: 4. Short questions. a) Assume that there are 120 bits of data in a frame. For error control the…

A: a.) Assume that there are 120 bits of data in frame .For error control the using two-dimensional…

Q: Consider the 64-bit binary number 11010000 00000100 00001000 00000101 10001001 00110000 10000001…

A: Let's see the solution in the next steps

Q: Show that the Internet checksum will never be 0xFFFF (that is, the final value of sum will not be…

A: As per the definitions from the RFC 1624:

Q: Find a [nonce] without brackets such that SHA-256(SHA-256(Apple Jack [nonce])) contains 30…

A: Find a [nonce] without brackets such that SHA-256(SHA-256(Apple Jack [nonce])) contains 30…

Q: What is the worst-case running time of unions done by size and path compression?

A: please check the step 2 for answer

Q: Consider the following ls -l output: -rwxr-xr-- 2 fred users 0 Jan 26 13:08 22…

A: 1) The output of ls -l shows perrmisson given to a file sample.mp3 2) -rwxr-xr-- 2 fred users…

Q: Consider a telegraph source having two symbols, dot and dash. The dot duration is 0.2 second. The…

Q: Q2) Consider a magnetic disk drive with 8 surfaces, 512 tracks per surface, and 64 sectors per…

A: What is the disk capacity? Given, 1024bytes / sector. 64 sectors per track, 512 tracks per serface,…

Q: 1. Determine whether the following statements are true or false. d) A transmission of a frame by any…

A: Given:

Q: What will be the value for CS,S,S,S, if X = 1011, Y = 0110 and S = 1? Your answer %3D %3D must be a…

A: In this question, we are given a combinational circuit with inputs X and Y. We are using a Ex-OR…

Q: A certain disk can read data at a rate of 515.2 MB/s. How many books can be read in 4 seconds if an…

Q: For a computer system using a 64 bit width data path, how many number of a bits will this computer…

A: А соmрuter аlоng with аdditiоnаl hаrdwаre аnd sоftwаre tоgether is саlled а соmрuter…

Q: Q2) Consider a magnetic disk drive with 8 surfaces, 512 tracks per surface, and 64 sectors per…

A: A) Disk capacity = 8*512*64*1KB = 228 B = 256MB

Q: Suppose you have an LFSR with state bits (also known as the seed) (85, 84, 83, 82, 81, 80) (1, 1, 1,…

A: Seed: (s5, s4, s3, s2, s1, s0) = (1, 0, 0, 1, 1, 0) Tap bits: (p5, p4, p3, p2, p1, p0) = (0, 1, 1,…

Q: The first two bytes of a 2M x 16 main memory have the following hex values: 1. Byte 0 is FE 2. Byte…

A: The answer is...

Q: A common measure of transmission for digital data is the baud rate, defined as the number of bits…

A: Summary:In this question, we are going to calculate the time taken to transmit a 640 x 480-pixel…

Q: Let: PC = $012480 and M($012480) = $6696. What are the possible addresses for the next fetch,…

A: Dear Student, Program Counter register gets incremented by the total size of the instruction being…

Concept explainers

Network transmission cabling

A network is a collection of devices connected by communication links. A device can be a computer or any instrument capable of sending and receiving data or information formed by other nodes toward the network. A channel that connects people or things is known as a network. It sends the data from one place to another. It is the basic concept of a computer, network, and data communications.

Question

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

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

Shannon-Fano Encoding

VIEW

Huffman Coding

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

Consider a SEC code that protects 8 bit words with 4 parity bits. If we read the value 0x375, is there an error? If so, correct the error.
Given are the following codewords for an error control coding scheme data 000 011 100 codeword 00011000 00000111 10101000 . a.What is the minimum Hamming distance? b. What is the coding rate for this scheme? c. what raw data rate would be required if we need a throughput of 6 Mpbs? d. in a different situation, the number of data bits to transfer is 5, and the minimum hamming distance is dmin=5. find the maximum coding rate for this situation
As information centers are progressively centered on energy efficiency, it gets to be imperative to create Low control usage of the different applications that run on them. Data or Information compression plays a basic part in information centers to reduce storage capacity and communication costs. This work pivot on building a Low control, High performance execution usage for canonical Huffman encoding. Suppose given Letters I, Q, R, A, C, M, P, U, S with following frequencies. Frequency Table Character Frequency I 20 Q 11 R 8 A 12 C 49 M 10 P 5…
1. Compact discs record two channels (left and right) of music at a sampling frequency of ??=44.1kHz for each channel. If each sample is encoded with 16 bits, and one byte is 8 bits, how many bytes are required to store 48.1 seconds of music? 2. Consider a system that uses 8-bit ASCII codes to encode letters. How long (in microseconds) will it take to transmit the bit sequence encoding Hello-World! if we use a bit time of 4 samples per bit, and transmit samples at a rate of 1MHz? 3. The ASCII table below gives the ASCII codes for common alphanumeric characters and symbols listed from MSB to LSB. What is the bit sequence encoding the message 113? Assume that we transmit the codes of each character in sequence with the LSB first.
implement bitMask(x,y) Generate a mask consisting of all 1’s from lowbit to highbit /* * bitMask - Generate a mask consisting of all 1's * lowbit and highbit* Examples: bitMask(5,3) = 0x38* Assume 0 <= lowbit <= 31, and 0 <= highbit <= 31* If lowbit > highbit, then mask should be all 0's* Legal ops: ! ~ & ^ | + << >>* Max ops: 16* Rating: 3*/int bitMask(int highbit, int lowbit) {return 2;}
Consider a SEC code that protects 8-bit words with 4 parity bits. If we read the value0xABC, is there an error? If so, correct the error.Note: 0xABC = 1010 1011 1100Hint: Decode the 12-bit encoded data and find if there is an error.
Binary Arithmetic Coding: Consider integer implementation of binary arithmetic coding: Use 4 bit integers to store LOW and HIGH. At certain stage, suppose the counters for 0 and 1 are 30 and 10 respectively LOW =2, HIGH = 13, and E3 scaling counter Scale3 = 2; Describe the detains of the encoding process when the next two inputs bits are both 1;
greatestBitPos(x) Compute a mask marking the most significant 1 bit. program should return maskmarking not value of significant bit example: greatestBitPos(96) = 0x40 /* * greatestBitPos - return a mask that marks the position of the* most significant 1 bit. If x == 0, return 0* Example: greatestBitPos(96) = 0x40* Legal ops: ! ~ & ^ | + << >>* Max ops: 70* Rating: 4 */int greatestBitPos(int x) {return 2;}
Answer the given question with a proper explanation and step-by-step solution. DON'T COPY PAST (f-bit) Suppose the size of logical address space is 2^1.MB, physical memory size is 2^8 MB, and page/frame size is 2^6 KB? How many bits will be used for frame number (what is f)? (Note: 2^a means 2 to the power a).
Suppose we are given the following subset of code words,created for a 7-bit memory word with one parity bit: 11100110,00001000, 10101011, and 11111110. Does this code use even or oddparity? Explain.
Suppose we are working with an error-correcting code that will allow all single-bit errors to be corrected for memory words of length 7. We have already calculated that we need 4 check bits, and the length of all code words will be 11. Code words are created according to the Hamming algorithm presented in the text. We now receive the following code word: 1 0 1 0 1 0 1 1 1 1 0 Assuming even parity, is this a legal code word? If not, according to our error-correcting code, where is the error?
a. Compute CBC-MAC for a message of 16 bits, “8642” (in Hexa). Assume a block size of 8 bits with an IV=F1 (in hexa). For simplicity, assume the encryption to be a simple XOR of the key with the plaintext. Let the encryption key be B4 (in Hexa).