A common measure of transmission for digital data is the baud rate, defined as symbols (bits in our case) per second. As a minimum, transmission is accomplished in packets consisting of a start bit, a byte (8 bits) of information, and a stop bit. Using these facts, answer the following: (a)* How many seconds would it take to transmit a sequence of 500 images of size 1024 x 1024 pixels with 256 intensity levels using a 3 M-baud (10 bits/sec) baud modem? (This is a representative medium speed for a DSL (Digital Subscriber Line) residential line. (b) What would the time be using a 30 G-baud (10° bits/sec) modem? (This is a represen- tative medium speed for a commercial line.)

A common measure of transmission for digital data is the baud rate, defined as symbols (bits in our case) per second. As a minimum, transmission is accomplished in packets consisting of a start bit, a byte (8 bits) of information, and a stop bit. Using these facts, answer the following: (a)* How many seconds would it take to transmit a sequence of 500 images of size 1024 x 1024 pixels with 256 intensity levels using a 3 M-baud (10 bits/sec) baud modem? (This is a representative medium speed for a DSL (Digital Subscriber Line) residential line. (b) What would the time be using a 30 G-baud (10° bits/sec) modem? (This is a represen- tative medium speed for a commercial line.)

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

The table below represents a line in the code for Hamming's code where d = 12 and m = 5. Compute the syndrome and determine if there is an error and which bit, 1-17, is wrong. Recall that if there is no error then position 0 is given as the "error position." 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 D po P1 d11 P2 d10 d9 dɛ p3 d7 do ds dą dz d2 d1 P4 do ? 0 1 0 1 1 0 1 0 0 1 0 1 1 0 0 1 1 So = [ Select ] S1 = [ Select ] S2 = [ Select ] S3 = [ Select ] S4 = [ Select ] Error Position = [ Select ]
Assume that a system uses 10-bit floating-point representation based on the IEEE floating-point format, in which: . There is 1 sign bit. There are k= 6 exponent bits. The exponent bias is 31. . There are n= 3 fraction bits. ● Convert the decimal number -5.5 into the 10-bit IEEE floating point representation explained above. Write the final result in 10-bit binary format. Show your steps.
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?
How many bits are needed to digitally record 90 seconds of your favorite music tune? The sampling rate commonly used for music is 44.1 kHz (i.e. 44100 Hz). Each sample is represented using 16 bits. Note that music is usually recorded in stereo, requiring hence twice the number of samples that would be needed for a non-stereo recording of an audio signal
Using the Hamming code given in classfor 8 bit data words, determine whether there is an error, and if so, in which bit, for each of the following words fetched from memory: A.0010 0011 0010 B.0110 0011 1010
For each of the following binary codes, answer all of the following questions with justification: (a) (b) (c) (d) ● ● Is it linear? What is its block length, message length, and rate? What is its distance? How many errors can it detect, and how many can it correct? (To answer this question you should give the largest number of errors that the code can guarantee to detect or correct. For example a simple parity bit can detect 1 or 3 errors but cannot detect 2 errors so we would say this can detect only a single error. No calculations of probability are required.) The code with seven codewords where seven messages are encoded as follows: 0000000 0010011 0100101 0110110 1001001 101 1010 1101100 The code consisting of thirty-two codewords where each codeword consists of a 5-bit message padded with an additional bit to give ODD parity: that is, each codeword contains an odd number of 1s. For example the word 11111 would be padded with a 0 to give 111110, while 00000 would be padded with a 1…
A certain animal has 13 eyes having 59.8 million pixels in each eye. Each pixel is a superposition of 5 primary colors, where each color can be one of 10,938 different intensities. What is the data rate (in GB/s to two decimal places) needed to save all that the animal sees in real time, if it "takes" 18 images per second?
1- Given RO, R1, R2, and R3 followed by the indicated base; i- Convert each value into its corresponding 9 bit binary value, the most significant bit is used as the sign bit, separate the sign bit with a comma, for example; 0,10100000 (RO)8 = 165 (RO)2= Use the 9 least significant bits, discard the extra bits. (RI)16 - FSF (RI)2= (R2)16 = F81 (R2)2= (R3)7 152 (R3)2- %3D (Separte the sign from the other bits with a comma, for example; 110011000 is written as; 1,10011000) ii- Evaluate; R4 - RO + RI. (consider negative numbers to be already given in 2's complement) bit8 bit 7bitóbitit4bit3bit2bitl bito RO RI R4
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.
implement bitMask(x,y) Generate a mask consisting of all 1’s from lowbit to highbit /* * bitMask - Generate a mask consisting of all 1's * lowbit and highbit* Examples: bitMask(5,3) = 0x38* Assume 0 <= lowbit <= 31, and 0 <= highbit <= 31* If lowbit > highbit, then mask should be all 0's* Legal ops: ! ~ & ^ | + << >>* Max ops: 16* Rating: 3*/int bitMask(int highbit, int lowbit) {return 2;}
The modulus for the field GF(25) is x5+x2+1 and its elements are all five-bit strings. Calculate each of the following and enter your answer in exactly five bits (Example, 01101). 1. 11111 + 00001 2. 00011 x 00011 3. 01100 x 01100
If we record a song that is one minute long using 16 bits for each sample and is sampled at 44.1 KHz in mono channel, without any metadata or compression, how large would the file be? Express your answer in MB. Show you work. (Note that 1KHz means 1000Hz while 1K means 1024 (and IM means 10242) for capacity calculations.)