4. Given a sentence JALESVEVA JAYAMAHE a. Create a frequency table for each letter or character (including blank, distinguish between uppercase and lowercase letters). b. If 1 letter takes 1 byte (8 bits) of memory, how many bytes is it? the memory required to store the text? c. Apply Huffman coding algorithm, to summarize (compress) the sentence. d. What is the summarization efficiency (what % of memory saving is generated)?|

4. Given a sentence JALESVEVA JAYAMAHE a. Create a frequency table for each letter or character (including blank, distinguish between uppercase and lowercase letters). b. If 1 letter takes 1 byte (8 bits) of memory, how many bytes is it? the memory required to store the text? c. Apply Huffman coding algorithm, to summarize (compress) the sentence. d. What is the summarization efficiency (what % of memory saving is generated)?|

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter2: Problem Solving Using C++using

Section2.4: Arithmetic Operations

Problem 6E

See similar textbooks

Similar questions

Consider a base 26 number system wherein the letters of the alphabet are the digits. That is, A=0, B=1, C=2, … Z=25 in base 10. Use the MAL as a number in the base 26 system, and KHA as another number in the base 26 system.Add these numbers together to obtain the sum in based 26. Example 1 — if your first name is “Peter” and your surname is “Pan”, then add up PET26 and PAN26, and show the sum in base 26.Example 2 — if your first name is “Peter” and your surname is “Pa”, then add up PET26 and PAA26, and show the sum in base 26.
Observe the logical sequence of digits below:(7,1,4,2,1,2,8,3,5,4,2,4,9,5,6,6,...)Mark the alternative that contains the hundred and first digit of this sequence. A. 2 B. 3 C. 5 D. 7 E. 9
Suppose that you are given the following logical statement:¬ P ∧ Q → ¬ R ∨ SBased on our discussion of order of operations, which is the correct way to interpretthis?(a) ¬(P ∧ ((Q → (¬R)) ∨ S))(b) (¬(P ∧ (Q → (¬R)))) ∨ S(c) ((¬P) ∧ (Q → (¬R))) ∨ S(d) (¬P) ∧ ((Q → (¬R)) ∨ S)(e) (¬(P ∧ Q)) → (¬(R ∨ S))(f) ((¬P) ∧ Q) → ((¬R) ∨ S)(g) ((¬P) ∧ (Q → (¬R))) ∨ S(h) ((¬P) ∧ (Q → (¬R))) ∨ S(i) (¬P) ∧ ((Q → (¬R)) ∨ S)(j) ¬((P ∧ Q) → (¬(R ∨ S)))
For each part, describe whether the following information is easier to remember or difficult to remember, give a proper justification? Similarly, for each part show whether this information is in correct format and also give proper justification that how the following information can increase short term memory? ANY OUC HUNKT HESEL ETTE RSIN TOWO RDSO NLY C Issabrinagoingtogetanewiosphone 1962001199503221879219402010
Consider the code C={00010, 01100,01011,11010,01010}. What is the minimum distance of C? For what k is the code C k-error detecting? Write the set of error patterns that C can detect?
1) Draw the Insert(o) TM, which changes the tape contents from yz to yoz. Here ye (20(A))*, σ € ZUIA), and ze 2. Assume that 2 = (a, b). 2) Draw a transition diagram for a TM with input alphabet (0,1) that interprets the input string as the binary representation of a nonnegative integer and adds 1 to it. You can use a TM INSERT (0).
Answer questions (a) and (b) below: (a) How many times exactly is the code block below executed? For (i = 1, n) { For (j = 1, i) { For (k = 1, j) { code block } } } Hint: You have to start with n=1, then make assumption what you make expect for any given n = N, and check if the formula you found works for n =N+1. This is what we call prove by induction. (b) What is the theta value of this code segment?
Answer the given question with a proper explanation and step-by-step solution. Qns: Write a Little Man program that adds a column of input values and produces the sum as output. The first input value will contain the number of values that follow as input to be added.
Q3) Solve each of the following: a) (0 10011000 10000100010100110000000)Floating Point = (?)2 b) If A = 10101010, B = 01010101, and C = 00110011, then find X = A ∨ B ∧ ￢C c) Create a truth table for the Boolean function Y = ￢(A ∧ Β). d) Using the value –128, write it as an integer literal in decimal, hexadecimal, and binary formats that are consistent with MASM syntax. e) Write the real number –7.823 × 10-38 as a real number literal using MASM syntax.
Using Python or awk script and any given text file such as a book find: (A) the number of unique words,(B) the ten most and least frequently used words,(C) the top five frequently used five-letter words,(D) the top five frequently used six-letter words,(E) the top five frequently used words with seven or more letters,(F ) the average number of words between each word with seven or more letters (and the standard deviation)
a)What is the output of the first round of the DES algorithm when the plaintextand the key are both all ones? Show work b)If the input in part ‘a’ changed and now it has a ‘1’ at bit position 57 and all other bits as well as the key are zero. (note that the input word has to run through the initial permutation). How many S-boxes get different inputs compared to the case when an all zero plaintext is provided? c)What is the minimum number of output bits of the S-box that will change according to the S-box design criteria?
You have to design a processing unit dealing with floating point numbers. The main purpose of using floating point numbers in your case is to make comparisons between two floating point numbers (a and b) in order to know if they are equal or not. If not, to know if a is strictly greater or smaller than b. For the mantissa and exponent, which represention you may choose or not and why, having in mind to have the fastest comparison operator as possible? Describe the algorithm you may use to do the comparison?