Name : Taha AliKindly send solution on this name. Q1. Create two n-bit codes Cl and C2 (where n is the minimum number of bits) sufficient touniquely encode each letter (in upper and lower case) of your full name (exclude spacesbetween first/second/third names). Each letter, even if it repeats in the name (as S repeats inCOMSATS), should get only one unique code. No two codes in Cl and C2 should be thesame. For example, to encode upper and lower case letters of COMSATS, the binary codesCl and C2 are given in the Table 1. Calculate odd and even parity bits of code C2 as shownin the table 1.Oddparity parity bitbit of C2(ОР)1EvenUpper case lettersof nameCodeLower caseCodeC1letters of nameC2of C2(EP)01100111C000000010010Mm10001001101000101Table 1: Binary letter codes1001101010111AaQ2. Using combinational logic with MSI and LSI, implement the function OP and EP (inTable 1, but for your own full name) with multiplexers.Use variables .W, X, Y, Z for the inputs and OP (odd parity) and EP (even parity) for theoutputs. The dimensions (sizes) of the multiplexers are dependent on your name. You mustshow the implementation table for each multiplexer.

Two n bit codes for name TAHA ALI change it to unique letter as given in question excluding space…

Q1. Create two n-bit codes Cl 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 Cl and C2 should be the same. For example, to encode upper and lower case letters of COMSATS, the binary codes Cl and C2 are given in the Table 1. Calculate odd and even parity bits of code C2 as shown in the table 1. Even parity parity bit of C2 Odd Upper case letters of name Code Lower case letters of name Code C1 C2 bit of C2 (OP) (ЕР) 0000 0001 0010 0011 0100 0101 Table 1: Binary letter codes 0110 0111 M m 1000 1001 a 1010 1 T 1011

Q1. Create two n-bit codes Cl 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 Cl and C2 should be the same. For example, to encode upper and lower case letters of COMSATS, the binary codes Cl and C2 are given in the Table 1. Calculate odd and even parity bits of code C2 as shown in the table 1. Even parity parity bit of C2 Odd Upper case letters of name Code Lower case letters of name Code C1 C2 bit of C2 (OP) (ЕР) 0000 0001 0010 0011 0100 0101 Table 1: Binary letter codes 0110 0111 M m 1000 1001 a 1010 1 T 1011

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

Generate a histogram of 20,000 randomly generated floating-point numbers according to a uniform distribution with a user-specified range [a, b], where a and b are parameters. The histogram will include the frequencies of numBins (>=21) values equal-width data bins that are equally evenly distributed between a and b. For instance, if a=2.0, b=10.0, you will calculate the frequencies total number of randomly generated values that fall into each of following data bins, where each bin has a width of (b-a)/21 and centers at 2.0, 2.0+(8.0/20)*1, 2.0+(8.0/20)*2, 2.0+(8.0/20)*3, ..., 2.0+(8.0/20)*20=10, respectively. To keep it simple, your can set the precision of each center at 0.1 (i.e., only consider the first digit after the decimal point, e.g., 2.0, 2.4, 2.8, etc.). Put all the above together, if the randomly generated value is 2.44323, it falls into the bin centering at 2.4 since rounding 2.44323 with a precision of 0.1 is 2.4.
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
Create an RLE class that uses fixed-length encoding to reduce ASCII bytestreams with a limited number of characters, including the code as part of the compressed bitstream. Add code to compress() to generate a string alpha containing all of the unique letters in the message and use it to generate an Alphabet for use in compress(), prepend alpha (8-bit encoding plus its length) to the compressed bitstream, and then add code to expand() to read the alphabet before expansion.
You have two 32-bit numbers, N and M, as well as two bit positions, I and j. Create a method for inserting Minto N in such a way that M begins at bit j and ends at bit i. You can assume that bits j through I have enough space to accommodate all of M. That is, if M = 10011, you can presume at least 5 bits exist between j and i. You wouldn't have j = 3 and I = 2, for example, because M couldn't completely fit between bit 3 and bit 2.Input: N=10000000000, M=10011,i=2,j=6Output: N=10001001100
Create an RLE class that employs fixed-length encoding to compress ASCII bytestreams with a limited number of characters, including the code as part of the encoded bitstream. Add code to compress() to generate a string alpha containing all of the different characters in the message and use it to generate an Alphabet for use in compress(), prepend alpha (8-bit encoding plus its length) to the compressed bitstream, and then add code to expand() to read the alphabet before expansion.
Consider the following code which includes a parity check for the third digit: C=(000,011,101,110). You get the third digit by adding the first two and then using the remainder on division by 2. Can this code detect and count single errors? how can this be implemented?
A. The original Caesar cypher shifts each character by one: a becomes b, z becomes a, and so on. Let's make it a bit harder, and allow the shifted value to come from the range 1..25 inclusive. Moreover, let the code preserve the letters' case (lower-case letters will remain lower-case) and all non-alphabetical characters should remain untouched. Your task is to write a program which: asks the user for one line of text to encrypt; asks the user for a shift value (an integer number from the range 1..25 - note: you should force the user to enter a valid shift value (don't give up and don't let bad data fool you!) Test your code using the data we've provided. Test data Sample input: abcxyzABCxyz 123 2 Sample output: cdezabCDEzab 123 Sample input: The die is cast 25 Sample output: Sgd chd hr bzrs
Write code that prints a random number of lines between 2 and 10 lines inclusive, where each line contains a random number of 'x' characters between 5 and 20 inclusive. For example: xxxxxxx xxxxxxxxxxxxxxxxxx xxxxxxxxxxxx xxxxxx xxxxxxxxxxx xxxxxxxxxxxxxxxx
Writing left to right, draw a number line representing the integers ranging from from 4 to 7.(a) Add the binary representations to each point on your number line.(b) How far is (0110)2 from where (0000)2 would be on your number line? Can you reason about itsposition without actually drawing the missing numbers?(c) Draw a second number line, this time ranging from 65, 540 to 65, 543 in decimal and in in binary.(d) How far is (1 0000 0000 0000 0110)2 from where (1 0000 0000 0000 0000)2 would appear on thisnumber line? Even though there are a lot more digits involved, is this inherently more complex than (a)and (b) above? All Parts please
Create an RLE class that uses fixed-length encoding to compress ASCII bytestreams with a defined number of characters, including the code in the encoded bitstream. Add code to compress() to generate a string alpha containing all of the message's characters and use it to generate an Alphabet for use in compress(), prepend alpha (8-bit encoding plus its length) to the compressed bitstream, and then add code to expand() to read the alphabet before expansion.
Create a class RLE that employs fixed-length encoding and very few distinct characters to compress ASCII bytestreams, incorporating the code as a component of the encoded bitstream. Add code to compress() to create an Alphabet using all the message's different characters, prepend alpha (8-bit encoding plus its length) to the compressed bitstream, and then add code to expand() to read the alphabet before expansion.
(a) Convert n to binary form, call it B. You may use the bin( ) function. (b) Split B into two “halves”, call them F and S, where if the length of B is odd, then include the extra digit in the first half. For example, if B = 101110, then the first half is F = 101 and the second half is S = 110. As another example, if B = 1100111, then the first half isF = 1100 and the second half is S = 111. (c) Convert F and S to decimal form, add one to each decimal form, and then return the product of these new values.