a.
Explanation of Solution
Encode the sentence Does
The ASCII code is a set of character which stands for “American Standard Code for Information Interchange”.
Even parity: Even parity is set to
- To encode the sentence use the ASCII code table as shown below:
- Convert the sentence in the hexadecimal notation from the above table.
- To represent the hexadecimal notation in bit pattern, convert the hexadecimal notation into bit as shown below.
- Convert bit pattern into even parity bit pattern which is shown below
b.
Explanation of Solution
The total cost is
The ASCII code is a set of character which stands for “American Standard Code for Information Interchange”.
- To encode the sentence use the ASCII code table as shown below:
- Convert the sentence in the hexadecimal notation from the above table.
- To represent the hexadecimal notation in bit pattern, convert the hexadecimal notation into bit as shown below.
- Convert bit pattern into even parity bit pattern which is shown below
Want to see the full answer?
Check out a sample textbook solutionChapter 1 Solutions
Computer Science: An Overview (13th Edition) (What's New in Computer Science)
- The number -82 is represented as an integer with respect to the complement of 2 in 32 bits. According to this, a) If we rotate this number 8 bits to the left, what will be the result, show it in hexadecimal format? b) If we rotate this number 4 bits to the right, what will be the result, show it in hexadecimal format?arrow_forward7. A pair of 7-bit floating point formats, based on the IEEE standard, is described below: • Format (a) has k = 3 and n = 4. The exponent bias is 3. Format (b) has k = 4 and n = 3. The exponent bias is 7. (a) Convert the bit patterns below, given in format (a) to bit patterns in format (b). Convert exact values when possible, otherwise use the round-to-even rule. Also, write the values of each bit pattern, for the (a) and (b) formats. Write the values, in decimal, as rational numbers, or whole integers. Bits (a) Value Bits (b) Value 1 0111 000 011 0000 101 1010 110 1011 000 0011 1 (b) What is the smallest positive denormalized number in format (b)? What is the largest positive denormalized number in format (b)?arrow_forwardScenario: In a biased N-bit binary number system with bias B, positive and negative numbers are represented as their value plus the bias B. For example, for 5-bit numbers with a bias of 15, the number 0 is represented as 01111, 1 as 10000, and so forth. Biased number systems are sometimes used in floating point mathematics. Consider a biased 8-bit binary number system with a bias of 12710 Question: What is the representation and value of the most negative number?arrow_forward
- I want a clear solution and a clear line as well.arrow_forwardConvert the BCD NUMBER 0001 1001 0011 0110 . 1001 0011 0111 0101 to BINARY number showing the steps (Note : The problem should be solved in separate paper with steps and scanned copy should be submitted along with other answers The final answer must be entered in the boxes below. For the binary number, enter only one bit in a box and fill the unused boxes if any, with zeros) Decimal No. = Integer part (binary) = Fractional part (binary)=arrow_forward3. Decode the binary message and show it in ASCII characters. (10 Points - ½ point for each character) (Note: There are typos in the answer, so don't make assumptions.) You might find it easier to convert to Hexadecimal first. 01000000 01001110 00110100 01110100 01110011 00110000 00110001 00100000 01110010 01010101 01100110 01100110 00100000 01011001 00110011 01100001 01110010 00100000 00100011 00100001 Message in ASCII:arrow_forward
- Consider a floating point format that uses 4 digits in the significand including the leading 1. In other words, the significand is given by (1.d₁d2d3)2. (a) Assuming you have enough bits in the exponent, compute fl(25.75) for this floating-point format. (b) How many significant digits is fl(25.75) accurate to? (c) How many bits are needed in the exponent such that computing fl(25.75) will not result in nu- merical overflow?arrow_forwardHuffman Coding and Phrases Use the following chart to answer problems 15-19. 15. Calculate the total number of bits per character. Record your answers in the chart. Character Code Frequency Bits A 000 2 E 001 H 010 1 K 011 1 M 100 101 1 R 110 2 S 111 1 T 1000 4 U 1001 1 space 1010 4 What are the total bits in the original code? Use Huffman Coding to compress the following phrase: “MEET ME AT THE SUPERMARKET". Draw the Huffman Coding tree in the space provided below. Hint: You can use the Shape tool to draw the graph, or you can draw the graph by hand, then photograph or scan your graph to submit it.arrow_forwardFor 10 bits floating point representation using: seeeefffff, what is the bias for denormalized numbers? A. 7 B. 6 C. 4 D. 3 E. 2 What is the range of integers that can be represented using 8 bits 2's complement? A. -127 to 127 B. -128 to 127 C. -127 to 128 D. 0 to 255 E. 0 to 256arrow_forward
- ASCII Codes can be helpful to find binary code of different decimal numbers and alphabets etc. You have to consider 65 and its equivalent code of 16 bits will be considered for bit sequence and a divisor for CRC. Follow this process; first 8 bits will be used for data while next 4 bits will be used for divisor (if there are 4 zeroes in your case then replace with 1001), neglect last 4 bits. Also check your answer.arrow_forwardWe are using the simple model for floating point representation which is a 14-bit format, 5 bits for the exponent with a bias of 15, a normalized mantissa of 8 bits, and a single sign bit. Show step by step how the computer would represent the following numbers using this floating- point format | a. -6.47510 i. Convert it into a binary number ii. Normalize this binary number iii. Fill up the fieldsarrow_forwardHuffman Coding and Phrases Use the following chart to answer problems 15-19. 15. Calculate the total number of bits per character. Record your answers in the chart. Character Code Frequency Bits A 000 E 001 6. H 010 1 K 011 1 M 100 3 101 1 R 110 S 111 1 T 1000 4 U 1001 1 space 1010 4 What are the total bits in the original code? Use Huffman Coding to compress the following phrase: "MEET ME AT THE SUPERMARKET". Draw the Huffman Coding tree in the space provided below. Hint: You can use the Shape tool to draw the graph, or you can draw the graph by hand, then photograph or scan your graph to submit it. What are the new codes and total bits?arrow_forward
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education