## Problem 2Suppose a certain file contains only these letters with the following frequencies:| Letter | A | E | G | I | L | P | R | S | U | V ||--------|---|---|---|---|---|---|---|---|---|---|| Frequency | 1 | 4 | 1 | 3 | 1 | 5 | 2 | 3 | 3 | 1 |### (a)Construct the comma-free code that enables you to compress the file so that you can store it in the least number of bits. **In case two or more letters have the same frequency, order them alphabetically from left to right.**### (b)Use the comma-free code you construct from part (a) to decrypt the following:```001110001101101110111001110010111101000000110101111100111111001000101```### ExplanationThe table displays letters along with their frequencies, which need to be used to construct a comma-free code. The goal is to compress the data using the fewest bits. In section (b), a binary sequence is provided to be decrypted using the comma-free code from part (a).

Given letters and their frequencies are: A E G I L P R S U V 1 4 1 3 1 2 3 3 1 1 The…

Answered: Problem 2. Suppose a certain file…

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Similar questions

***Please do A or C*** 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). (Hint: Divide the message into blocks of 8 bits each; XOR each block with the previous cipher output; then encrypt this with the key. For the first block, XOR it with IV. Details in pages 325-326 Ch.12 of the textbook) b. Suppose Alice computes the Secret prefix MAC (page 322: secret prefix MAC(x) = h(key || x)) for the message ”AM” (in ASCII) with key “G” (in ASCII) that both Alice and Bob know. The hash function that is used is h(x1x2x3)= g(g(x1 XOR x2) XOR x3 ) where each xi is a character represented as 8 bits, and g(x) is a 8-bit string that is equal to the complement of bits in x. For example, g(10110011) = 01001100. The MAC is 8 bits. (8-bit ASCII representation of the characters is given below.) What is the…
3). For the following block-move program, is it repeat-until or while-do loop structure? Can you change it into While-do loop structure? MOV AX, DATASEGADDR MOV DS, AX MOV SI, BLK1ADDR MOV DI, BLK2ADDR MOV CX, N MOV AH, [SI] MOV [DI], AH INC SI INC DI DEC CX NXTPT: JNZ NXTPT HLT
Problem D. Greatest Input file: Output file: standard input standard output Time limit: 2 seconds Memory limit: 64 megabytes You are given an even number N and an integer K and you have to find the greatest odd number M less than N such that the sum of digits in binary representation of M is at most K. Input 2 numbers. Output 1 number Examples standard input standard output 10 2 25 Note For case when N = 10, K = 2. Binary representation of 10 is 1010 and binary representation of 9 is 1001, hence greatest odd number less than 10 whose sum of digits in its binary representation is at most 2 is 9. Hence output is 9.
11. Perform each of these operations using the bases shown. a. 32five x 4five b. 32five divide 4five c. 43six x 23six d. 143five divide 3five e. 10010two divide 11two f. 10110two x 101two
5. Hamming Codes a) Suppose we want an error correcting code that will allow all single-bit errors to be corrected for memory words of length 15. How many check bits are necessary? b) Suppose we are now working with memory words of length 8. We have already calculated that we need 4 check bits, and the length of all codewords will be 12. We now receive the following code word: 010011011111 Is this a legal codeword, assuming even parity? If not, where is the error?
You are writing code that is equivalent to: X = A / (5 + B) Assume signed bytes and the following first 3 lines of code: mov al,A mov bl,B add bl,5 What is the one line of code that will perform the division correctly?
urgent
implement greatestBitPos function Compute a mask marking the most significant 1 bit. you are only allowed to use the following eight operators: ! ~ & ^ | + << >> “Max ops” field gives the maximum number of operators you are allowed to use to implement each function /* * 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;}
Explain what the program intends to do ! Program 4 .begin .org 2048 main: ld [a], %r1 ld [b], %r2 ld [c], %r3 top: subcc %r4, 3, %r0 be done subcc %r5, %r6, %r0 bneg else orcc %r1, %r2, %r1 addcc %r6, 1, %r6 ba bottom else: andcc %r1, %r3, %r1 addcc %r5, 1, %r5 bottom: addcc %r4, 1, %r4 ba top done: st %r3, [y] jmpl %r15+4, %r0 .org 3000 a: 0xa0 b: 0x33 c: 0x52 y: 2 .end
****NEEDS TO BE WRITTEN IN PYTHON**** Use the strategy of the decimal to binary conversion implemented in Project 4, and the bit shift left operation defined in Project 5 to code a new encryption algorithm. The algorithm should Add 1 to each character’s numeric ASCII value. Convert it to a bit string. Shift the bits of this string one place to the left. A single-space character in the encrypted string separates the resulting bit strings.
I need help to write a program in C++ that implements Huffman coding and decoding using the following requirements down below: - Create an input that allows a text of 3 or more lines including 26 characters, comma, spaces, and period. - Display the input texts. Pre-determine frequencies of each character by looking up the dictionary. - Determine variable-length binary code for each character and display the compressed encoded codes for the entire input text. - Use the compressed binary code as input, decode it back to the original text and display the same. - Fixed length coding: use 8 bits coding to represent each character. Use ASCII representation. - Compare the numbers of bit representation of each text in both variable length and fixed length by inputting three different paragraphs of texts. You may use the digit “1” to represent the bit “1”, and the digit “0” to represent the bit “0”.
1 Consider the following Intel Hex file :1000000075805575905575A0557DFA111C7580AA9F :100010007590AA75ABBA7DFA111C80E47C237B4F 01 :07002000DBFEDCFADDF62235 :00000001FF i) Analyze the six parts of the above Intel Hex file. ii) Calculate the checksum byte for the first three lines and examine whether the information is corrupted or not.

SEE MORE QUESTIONS

Recommended textbooks for you

Computer Networking: A Top-Down Approach (7th Edi…

Computer Engineering

ISBN:

9780133594140

Author:

James Kurose, Keith Ross

Publisher:

PEARSON

Computer Organization and Design MIPS Edition, Fi…

Computer Engineering

ISBN:

9780124077263

Author:

David A. Patterson, John L. Hennessy

Publisher:

Elsevier Science

Network+ Guide to Networks (MindTap Course List)

Computer Engineering

ISBN:

9781337569330

Author:

Jill West, Tamara Dean, Jean Andrews

Publisher:

Cengage Learning

Computer Networking: A Top-Down Approach (7th Edi…

Computer Engineering

ISBN:

9780133594140

Author:

James Kurose, Keith Ross

Publisher:

PEARSON

Computer Organization and Design MIPS Edition, Fi…

Computer Engineering

ISBN:

9780124077263

Author:

David A. Patterson, John L. Hennessy

Publisher:

Elsevier Science

Network+ Guide to Networks (MindTap Course List)

Computer Engineering

ISBN:

9781337569330

Author:

Jill West, Tamara Dean, Jean Andrews

Publisher:

Cengage Learning

Concepts of Database Management

Computer Engineering

ISBN:

9781337093422

Author:

Joy L. Starks, Philip J. Pratt, Mary Z. Last

Publisher:

Cengage Learning

Prelude to Programming

Computer Engineering

ISBN:

9780133750423

Author:

VENIT, Stewart

Publisher:

Pearson Education

Sc Business Data Communications and Networking, T…

Computer Engineering

ISBN:

9781119368830

Author:

FITZGERALD

Publisher:

WILEY

SEE MORE TEXTBOOKS