Suppose a file of 10,000 bytes is to be sent over a line at 2400 bps. A. Calculate the overhead in bits and time in using asynchronous communication. Assume one start bit and a stop element of length one bit, and 8 bits to send the byte itself for each character. The 8-bit character consists of all data bits, with no parity bit. B. Calculate the overhead in bits and time using synchronous communication. Assume that the data are sent in frames. Each frame consists of 1000 characters = 8000 bits and an overhead of 48 control bits per frame. C. What would the answers to parts (a) and (b) be for a file of 100,000 characters?

Suppose a file of 10,000 bytes is to be sent over a line at 2400 bps. A. Calculate the overhead in bits and time in using asynchronous communication. Assume one start bit and a stop element of length one bit, and 8 bits to send the byte itself for each character. The 8-bit character consists of all data bits, with no parity bit. B. Calculate the overhead in bits and time using synchronous communication. Assume that the data are sent in frames. Each frame consists of 1000 characters = 8000 bits and an overhead of 48 control bits per frame. C. What would the answers to parts (a) and (b) be for a file of 100,000 characters?

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

Consider an IEEE-like format ( one sign bit, 4 exp bits and 4 frac bits. ) with four frac bits and four exp bits. (i) What is the smallest integer m not exactly representable? Compute its decimal value. (ii) Is m+1 representable? Show the bit pattern for m+1 in this representation. (iii) What is the machine epsilon of this representation?
computer network 32. Given a binary data flow D as 10110, the bit pattern G as 10011, please calculate r CRC bits, i.e., R, such that is exactly divisible by G (mod 2).
The following figure demonstrates the parity bits, the data bits and the field coverage for a Hamming error correcting code (ECC) for eight data bits. Bit position 5 6 7 89 10 11 12 1 2 4. Encoded data bits p1 p2 d1 p4 d2 d3 d4 p8 d5 d6 d7 d8 p1 X X Parity p2 X X bit Coverage p4 p8 X Assume that the following code word has been created using the even parity Hamming ECC. 001101111010 Is it correct? If yes, explain why. If no, give the correct code and the original data value. Show your work.
Suppose a file of 10,000 bytes is to be sent over a line at 2400 bps. A. Calculate the overhead in bits and time in using asynchronous communication. Assume one start bit and a stop element of length one bit, and 8 bits to send the byte itself for each character. The 8-bit character consists of all data bits, with no parity bit. B. Calculate the overhead in bits and time using synchronous communication. Assume that the data are sent in frames. Each frame consists of 1000 characters = 8000 bits and an overhead of 48 control bits per frame. C. What would the answers to parts (a) and (b) be for a file of 100,000 characters?
Calculate the parity of a byte with the value 31 and show the pattern stored to memory. Assume the parity bit is on the right. Suppose the most significant bit was inverted in memory, and then you read it back. Did you detect the error? What happens if the two most significant bits are inverted?
Consider two possible floating point storage formats: Format 1 Format 2 • 16 bits total 32 bits total 1 bit for the number sign 1 bit for the number sign o 7 bits for the signed 23 bits for the signed exponent exponent O 8 bits for the mantissa O 8 bits for the mantissa Which format has the smaller maximum relative round-off error for a single calculation? • Format 2 It is impossible to tell Format 1 They are the same
Take the 127-bit binary BCH code with a 6-bit target distance and the 128-bit binary field extension F 128. How big is the code, and is there a minimum separation you can promise?
Suppose we are working with an error-correcting code that will allow all single-bit errors to be corrected for memory words of length 7. We have already calculated that we need 4 check bits, and the length of all code words will be 11. Code words are created according to the Hamming algorithm presented in the text. We now receive the following code word: 1 0 1 0 1 0 1 1 1 1 0 Assuming even parity, is this a legal code word? If not, according to our error-correcting code, where is the error?
1. Suppose (27.625 base 10) is represented using a 16-bit Floating Point Format where 1 bit is for the sign bit, 5 bits is for exponent and 10 bits is for mantissa. What is the exponent? Do not involve a space character when you type your answer. 2. Suppose (-27.625 base 10) is represented using a 16-bit Floating Point Format where 1 bit is for the sign bit, 5 bits is for exponent and 10 bits is for mantissa. What is the the result? Do not involve a space character when you type your answer.
[8.3] Calculate by hand 8.625 × 10¹ divided by -4.875 x 10°. Show all the steps necessary to achieve your answer. Assume there is a guard, a round bit, and a sticky bit, and use them if necessary. Write the final answer in both the 16-bit floating-point format (1 for sign bit, 5 for exponent, and 10 for fraction) and in decimal and compare the decimal result to that which you get if you use a calculator.
Suppose a file of 10,000 bytes is to be sent over a line at 2400 bps. A. Calculate the overhead in bits and time in using asynchronous communication. Assume one start bit and a stop element of length one bit, and 8 bits to send the byte itself for each character. The 8-bit character consists of all data bits, with no parity bit. B. Calculate the overhead in bits and time using synchronous communication. Assume that the data are sent in frames. Each frame consists of 1000 characters = 8000 bits and an overhead of 48 control bits per frame. C. What would the answers to parts (a) and (b) be for a file of 100,000 characters?
90. In CRC checksum method, assume that given frame for transmission is 1101011011 and the generator polynomial is G(x) = x^4 + x + 1.After implementing CRC encoder, the encoded word sent from sender side is ............. a. 11010110111110 b. 11101101011011 c. 110101111100111 d. 110101111001111