1You are asked to design binary codes to be used to transmit a list of numbers whichare made up of the digits 2 - 8 only: the list is separated by dashes (so everycharacter in the list is one of the symbols 2, 3, 4, 5, 6, 7, 8, and -. You sample 1000characters from a typical list and find the number of occurrences of each symbol tobe as follows, where a, b, c area = 9, b = 1, and c = 5(a)(b)Dash3002240 + a3160+ b499-c582 - a660-b730+ c829Use each of the Huffman and Shannon-Fano methods to create prefix-freecodes for this alphabet.Calculate the expected average wordlength for each of your codes.(c)Calculate the entropy for the distribution.(d)Explain whether your answers for (b) and (c) correspond to the theoreticalbounds.

Huffman Coding:Merge Symbols: Start by merging the symbols with the lowest frequencies until only…

You are asked to design binary codes to be used to transmit a list of numbers which are made up of the digits 2 – 8 only: the list is separated by dashes (so every - character in the list is one of the symbols 2, 3, 4, 5, 6, 7, 8, and -. You sample 1000 characters from a typical list and find the number of occurrences of each symbol to be as follows, where a, b, c are a = 9, b = 1, and c = 5

You are asked to design binary codes to be used to transmit a list of numbers which are made up of the digits 2 – 8 only: the list is separated by dashes (so every - character in the list is one of the symbols 2, 3, 4, 5, 6, 7, 8, and -. You sample 1000 characters from a typical list and find the number of occurrences of each symbol to be as follows, where a, b, c are a = 9, b = 1, and c = 5

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

As input, enter two non-negative number sequences in increasing order (the numbers entered are always getting bigger, and no number repeats), both terminated by a -1. The size of each sequence can vary (maybe sequence-1 has four numbers, and sequence-2 has seven). Your code needs to then output a third sequence that is a combination of sequence 1 and sequence 2 and is sorted in non-decreasing order. How is non-decreasing order different from increasing order? This means there can be a repeated number in the third sequence (see Example runs 1&2 for examples of output with a repeated number). A strictly increasing order sequence cannot have repeat numbers at all (Example runs 3 & 4 have output that is in increasing order). Remember, all input sequences must be in strictly increasing order! HINT: use three separate lists to solve this!
A binary number is to be transfromed by appending three 0's to the end of the number. For example , 11101 is transformed to 11101000. Which of the following best dewcribes the relationship between the transformed number and the original.- The transfromed number is 3 times the value of the original number- The transformed number is 4 times the value of the original number- the transformed number is 8 times the value of the original number- The transformed value is 1000 times the value of the original number
Create two n-bit codes C1 and C2 (where n is the minimum number of bits) sufficient to uniquely encode each letter (in upper and lower case) of your full name (exclude spaces between first/second/third names). Each letter, even if it repeats in the name (as S repeats in COMSATS), should get only one unique code. No two codes in C1 and C2 should be the same. For example, to encode upper and lower case letters of COMSATS, the binary codes C1 and C2 are given in the Table 1. Sum all the bits of code C2 and produce a sum (S) and a carry (C) bit for each row of code C2 as shown in the table 1. Upper case letters of name Code C1 Lower case letters of name Code C2 SUMing bits of C2 Carry bit (C) Sum bit (S) C 0 0 0 0 c 0 1 1 0 1 0 O 0 0 0 1 o 0 1 1 1 1 1 M 0 0 1 0 m 1 0 0 0 0 1 S 0 0 1 1 s 1 0 0 1 1 0 A 0 1 0 0 a 1 0 1 0 1 0 T 0 1 0 1 t 1 0
Transcribed Image Text You are given a sequence of 16N positive integers a1, a2, . .. , a16N - You may shuffle this sequence in any way you choose, i.e. change it to any one of its permutations. Then, let (a1 Đ a2) ® (az e a4) ...® (asN-1 asN), (a8N+1 O a8N+2) ® (asN+3 O a8N+4) ®...® (a16N-1 O A16N), where O and O denote bitwise AND and XOR respectively. Find the maximum possible value of x – y
# Write a MIPS assembly program that converts upper case characters to lower case. Given an ASCII string with lower case and upper case ASCII characters a-z or A-z. no number. Change the upper case characters to lower case, modify this code, to convert all upper case characters to lower case for ASCII string.. .text main: li $v0,11 la $t1,str loop: lb $a0,0($t1) beqz $a0,done blt $a0,0x61,next bgt $a0,0x7a,next syscall next: addi $t1,$t1,1 j loop done: li $v0,10 syscall .data str: .asciiz "abH1r2C9mXd"
A bit shift is a procedure whereby the bits in a bit string are moved to the left or to the right. For example, we can shift the bits in the string 1011 two places to the left to produce the string 1110. Note that the leftmost two bits are wrapped around to the right side of the string in this operation. Define two scripts, shiftLeft.py and shiftRight.py, that expect a bit string as an input. • The script shiftLeft shifts the bits in its input one place to the left, wrapping the leftmost bit to the rightmost position. • The script shiftRight performs the inverse operation. • Each script prints the resulting string. An example of shiftLeft.py input and output is shown below: Enter a string of bits: Hello world! ello world!H An example of shiftRight,py input and output is shown below: Enter a string of bits: Hello world! !Hello world
18. Which of the following are not regular?(A) Strings of even number of a’s.(B) Strings of a’s, whose length is a prime number.(C) Set of all palindromes made up of a’s and b’s.(D) Strings of a’s whose length is a perfect square. a. (A) and (B) only b. (A), (B) and (C) only c. (B), (C) and (D) only d. (B) and (D) only
Write a program that takes a single integernas a command-line argumentand finds its prime factors, excluding 1. The output should consist of asingle line listing each prime factor in non-decreasing order, separated by aspace. Ifnis prime, just printnitself. If there are repeat factors, print thefactor as many times as it dividesn. You can assume that2≤n≤231−1(i.e.,nwill fit in a signed 32-bit integer). ./factor 247 13 19. /factor 7 7 ./factor 32 2 2 2 2 2
A number in base 2 (binary) is a number such that each of its digits is 0 or 1. To convert frombinary to decimal (base 10), the digits starting from the right are multiplied by powers of 2(starting at 0) and added. For example, the value in decimal of 10011 is calculated as follows:
Write a program that calculate the values of (X + Y) x (X – Y) where X, Y = 0, 1, 2, …, 9and prints the following table:X|Y 0 1 2 3 4 5 6 7 8 90| 0 -1 -4 -9 -16 -25 -36 -49 -64 -811| 1 0 -3 -8 -15 -24 -35 -48 -63 -802| 4 3 0 -5 -12 -21 -32 -45 -60 -773| 9 8 5 0 -7 -16 -27 -40 -55 -724| 16 15 12 7 0 -9 -20 -33 -48 -655| 25 24 21 16 9 0 -11 -24 -39 -566| 36 35 32 27 20 11 0 -13 -28 -457| 49 48 45 40 33 24 13 0 -15 -328| 64 63 60 55 48 39 28 15 0 -179| 81 80 77 72 65 56 45 32 17 0
Evaluate the following Postfix: "4 9 + 8 * 1 - 6 6 + - 13 - 2 /" (All the numbers are in single digit. Everything is separated with a space)* 50.0 49.5 39.5 39 38 76
Given a number n, identify and print which in the given set of numbers are factors of n. Should there be no factors listed in the set of numbers, print "I'm alone". For example, given the number 36 and the set of numbers 2, 3, 5, 7, 12. Only print the numbers which are factors of 36, which are 2, 3, 12. Input The first line contains the number n; The second line contains how many numbers there are in the set of numbers; The third line contains the set of numbers. INPUT: 36 5 2·3·5·7·12 Output The set of numbers that are factors of n separated by a new line in order of appearance. If there are none, print "I'm alone" OUTPUT: 2 3 12