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

Related questions

Q: r the divisor 10011, and suppose that the data-word has the value 1010100000. What is the value of…

A: Consider the divisor 10011, and suppose that the data-word has the value 1010100000. What is the…

Q: Consider 7-bit messages that we encode into 11-bit codewords using 4 parity bits. Thus our codewords…

A: Summary:Given pseudocode can be converted to a code by importing packages or header files and…

Q: 5. For the 8-bit word 11010001, calculate the check bits to be stored with it. Suppose when the word…

A: Below is the answer to above question. I hope this will be helpful for you..

Q: Internet Checksum. Consider the two sixteen bit numbers: 10111100 01000111 01101101 00000010 Compute…

A: Check sum is a error detection method. By using the checksum we can detect the errors but we can't…

Q: Consider the design of the block code technique. What is the Hamming distance between this pair of…

A: The Hamming distance is a key factor in evaluating a code's error repair and detection capabilities…

Q: The Asynchronous Transfer Mode (ATM) uses an 8-bit CRC for error detection. The 8 bit CRC uses the…

A: Asynchronous transfer mode (ATM) is defined as the method of switching used by telecommunication…

Q: The ASCII code has 128 binary-coded characters. If a computer generates 125,000 characters per…

A: Answer : The American standard code for information interexchange (ASCII) has 128 binary coded…

Q: this

A: 1.False Because The two-dimensional parity check can detect up to three errors that occur anywhere…

Q: Suppose a file of 10,000 bytes is to be sent over a line at 2400 bps. A. Calculate the overhead in…

A: ANSWER:-

Q: Internet Checksum. Consider the two sixteen bit numbers: 10110100 01000110 01001000 01101111 Compute…

Q: The correct statements are: If L₁ is reducible (regardless of the complexity of the reduction) to L2…

A: A reduction is a method of converting one computer issue into another so that the first problem's…

Q: What is the percentage overhead for the following system: The system sends three 7-bit ASCII…

A: Here total bits sent is = 7*3 (characters)+ (1 (start bit) + 1 (parity bit) + 1 (stop bit) ) = 24…

Q: Suppose we are working with an error-correcting code that will allow all single-bit errors to be…

A: Given: The length of memory word is 12. The number of parity bits is 5. The number of bits present…

Q: 5. You have received the following 7+4 bit Hamming encoded message (the Hamming bits are…

A: According to the information given:- We have to follow the instruction in order to get most single…

Q: Assume bit stream of 1110010 as data, polynomial X²+X as divisor. Using the Cyclic Redundancy Check…

A: The Cyclic Redundancy Check (CRC) algorithm is an error-detection technique widely used in data…

Q: Given the sequence of 16-bit control words below for the datapath in Figure 8-11 and the initial…

A: Given data: A sequence of 16-bit control words and the initial ASCII character codes in…

Q: Describe the detains of the encoding process when the next two inputs bits are both 1;

A: The question has been answered in step2

Q: In this exercise you are to construct an ALU with the following specification: • The ALU takes 3…

A: Note- As per guidelines I am answering the 1st question. Here is the ALU (32 bit) diagram: -

Q: Parity is a function in which the output depends on the number of 1s in the input. For an even…

A: ROM stand read only memory that means in this memory storage space we can only store our data and…

Q: A modified NRZ code known as enhanced-NRZ (E-NRZ) is sometimes used for high-density magnetic tape…

Question

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?

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

SEE SOLUTION Check out a sample Q&A here

Step 1

Step 2

Step 3

Step 4

Step by step

Solved in 4 steps with 4 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

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?
[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?
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?
internet Checksum. Consider the two sixteen bit numbers: 10110100 01000110 00001000 01101110 Compute the Internet Checksum of these two values Enter the 2 bytes each as an 8-bit number with only O's and 1's, and make a single blank space between the two 8-bit numbers (e.g., 01010101 00101000).
Internet Checksum. Consider the six sixteen bit numbers: 10110101 01000110 01001001 01101011 10110100 01000110 01001001 01101101 10110101 01010110 01011010 01101111 Compute the Internet Checksum field value of these six words (each word has sixteen bits) Enter the 2 bytes each as an 8-bit number with only O's and 1's, and make a single blank space between the two 8-bit numbers (e.g., 01010101 00101000). [Note: you must use bitwise XOR logic function and don't use 2's or 1's complement] Not quite. This answer is incorrect.
The type of encoding in which manipulation of bit streams without regard to what the bits mean is ..................... a. Destination encoding b. Entropy encoding c. Source encoding d. Differential encoding
Suppose the window of a data stream is as shown below. (Most recent bit is on the right side) Using the DGIM method, estimate the number of 1s in the last k positions, if k=24