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

[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.
Assume a fixed priority scheme where Processor3> Processor2 > Processor1. Processor3 makes a request and is granted access. Then, Processor2 and Processor1 make requests. Which processor is granted access first? O Processor 1. Processor2 O Processor3 O An error will occur because two requests are pending
Suppose that data are stored on 2.44 Mbyte floppy diskettes that weight 20 gm each. Suppose that an airliner carries 104 kg of these floppies at a speed of 2000 km/h over a distance of 8000 km. What is the data transmission rate in bits per second of this system?
Is there a reason why the duration between bytes in asynchronous transmission varies?
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?
Consider a hypothetical 8 bit floating point machine representation with a sign bit, a 3 bit exponent, and a 4 bit mantissa (se1e2e3b1b2b3b4), where the exponent bias is 3 (add 3 to exponent of number to form machine representation). Recall that actual mantissa has 5 bits, since the leading 1 is not stored on the machine. (a) What is the number ?≈2.718 in this 8-bit format? (b) What is the number that (10100111)2 represents in this 8-bit format? (c) What is the upper bound of the relative error when representing a real number in this 8-bit format?
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
Please enter all answers as strings of 0's and 1's. Consider the 64 bit DES block below. 0001100001000000000010000000000000000000000001000000000000000000 Suppose that this is the initial input to DES. What will the block look like after the initial permutation (IP) is applied? If we apply the IP- transformation to the above, what will the result be?
Show that the Internet checksum will never be 0xFFFF (that is, the final value of sum will not be 0x0000) unless every byte in the buffer is 0. (Internet specifications in fact require that a checksum of 0x0000 be transmitted as OxFFFF; the value 0x0000 is then reserved for an omitted checksum. Note that, in ones complement arithmetic, 0x0000 and 0xFFFF are both representations of the number 0.)
Four computers are sending the digital data over a multiplexed line as shown in the Figure below. A). Show how the messages are multiplexed into frames using synchronous TDM and Asynchronous TDM. B). How many frames are generated if you are using Synchronous TDM? C.) How many frames are generated if you are using asynchronous TDM with frame size 3?
2) Consider the following D and G bit-strings D 1001, G=1011 Compute the frame to be transmitted by the sender (1
In a Von Neumann architecture, groups of bits have no intrinsic meanings by themselves. What a bit pattern represents depends entirely on how it is used. The following table shows bit patterns expressed in hexadecimal notation i. 0x000940C2 ii. 0x8C90FFFC Qa)What decimal number does each bit pattern represent if, i.It is a two’s-complement integer? ii.It is an unsigned integer? b) If each bit pattern represents an MIPS instruction, what instruction will be executed? c) What decimal number does each bit pattern represent if it is a floating-point number in IEEE 754 standard?