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.)

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter2: Problem Solving Using C++using

Section2.3: Data Types

Problem 9E: (Practice) Although the total number of bytes varies from computer to computer, memory sizes of...

See similar textbooks

Similar questions

**Please do C****C IS different from B** a. Compute CBC-MAC for a message of 16 bits, “8642” (in Hexa). Assume a block size of 8 bits with an IV=F1 (in hexa). For simplicity, assume the encryption to be a simple XOR of the key with the plaintext. Let the encryption key be B4 (in Hexa). (Hint: Divide the message into blocks of 8 bits each; XOR each block with the previous cipher output; then encrypt this with the key. For the first block, XOR it with IV. Details in pages 325-326 Ch.12 of the textbook) b. Suppose Alice computes the Secret prefix MAC (page 322: secret prefix MAC(x) = h(key || x)) for the message ”AM” (in ASCII) with key “G” (in ASCII) that both Alice and Bob know. The hash function that is used is h(x1x2x3)= g(g(x1 XOR x2) XOR x3 ) where each xi is a character represented as 8 bits, and g(x) is a 8-bit string that is equal to the complement of bits in x. For example, g(10110011) = 01001100. The MAC is 8 bits. (8-bit ASCII representation of the characters is given…
I88. Consider the following bit stream-a. 00000000 b. 11111111 c. 01010101 d. 00110011 Draw the graph of the i. Manchester using each of the given data streams, assuming that the last signal level has been positive. From thegraphs, guess the bandwidth for this scheme using the average number of changes in the signal level...
Problem with constructing MAC. The messages X to be authenticated consists of z independent blocks, so that: X = x1||x2|| . . . ||xz, where every xi consists of |xi| = 8 bits. The input blocks are consecutively put into the compression function ci = h(ci−1, xi) = ci−1⊕xi At the end, the MAC value: MACk(X) = cz+k mod 28 is calculated, where k is a 64-bit long shared key. Describe how exactly the (effective part of the) key k can be calculated with only one known message X.
(Practice) Although the total number of bytes varies from computer to computer, memory sizes of millions and billions of bytes are common. In computer language, the letter M representsthe number 1,048,576, which is 2 raised to the 20th power, and G represents 1,073,741,824, which is 2 raised to the 30th power. Therefore, a memory size of 4 MB is really 4 times 1,048,576 (4,194,304 bytes), and a memory size of 2 GB is really 2 times 1,073,741,824 (2,147,483,648 bytes). Using this information, calculate the actual number of bytes in the following: a. A memory containing 512 MB b. A memory consisting of 512 MB words, where each word consists of 2 bytes c. A memory consisting of 512 MB words, where each word consists of 4 bytes d. A thumb drive that specifies 2 GB e. A disk that specifies 4 GB f. A disk that specifies 8 GB
**Please do A or C** a. Compute CBC-MAC for a message of 16 bits, “8642” (in Hexa). Assume a block size of 8 bits with an IV=F1 (in hexa). For simplicity, assume the encryption to be a simple XOR of the key with the plaintext. Let the encryption key be B4 (in Hexa). (Hint: Divide the message into blocks of 8 bits each; XOR each block with the previous cipher output; then encrypt this with the key. For the first block, XOR it with IV. Details in pages 325-326 Ch.12 of the textbook) b. Suppose Alice computes the Secret prefix MAC (page 322: secret prefix MAC(x) = h(key || x)) for the message ”AM” (in ASCII) with key “G” (in ASCII) that both Alice and Bob know. The hash function that is used is h(x1x2x3)= g(g(x1 XOR x2) XOR x3 ) where each xi is a character represented as 8 bits, and g(x) is a 8-bit string that is equal to the complement of bits in x. For example, g(10110011) = 01001100. The MAC is 8 bits. (8-bit ASCII representation of the characters is given below.) What is the…
ʙᴇʟᴏᴡ ɪꜱ ʜᴏᴡ ᴛʜᴇ ꜰɪʟᴇɴᴀᴍᴇꜱ ᴀʀᴇ ʀᴇᴘʀᴇꜱᴇɴᴛᴇᴅᴀʀʀᴀʏ[] = [50, 11, 33, 21, 40, 50, 40, 40, 21]ʙᴇʟᴏᴡ ɪꜱ ᴛʜᴇ ᴇxᴘᴇᴄᴛᴇᴅ ᴏᴜᴛᴘᴜᴛ ᴀꜰᴛᴇʀ ᴅᴇ-ᴅᴜᴘʟɪᴄᴀᴛɪᴏɴᴀʀʀᴀʏ[] = [11, 21, 33, 40, 50] ʏᴏᴜ ᴄᴀɴɴᴏᴛ ᴜꜱᴇ ʟɪʙʀᴀʀʏ ꜰᴜɴᴄᴛɪᴏɴꜱ ᴛᴏ ᴇɪᴛʜᴇʀꜱᴏʀᴛ ᴀɴᴅ ᴏʀ ᴘᴇʀꜰᴏʀᴍ ᴛʜᴇ ᴅᴇ-ᴅᴜᴘʟɪᴄᴀᴛɪᴏɴ ᴏᴘᴇʀᴀᴛɪᴏɴ. ɪɴ ᴊᴀᴠᴀ ɪᴍᴘʟᴇᴍᴇɴᴛ ᴛʜᴇ ꜰᴜɴᴄᴛɪᴏɴ ɪɴ ꜱᴜᴄʜ ᴀ ᴡᴀʏ ᴛʜᴀᴛ ʏᴏᴜʀ ꜱᴏʟᴜᴛɪᴏɴ ꜱᴏʟᴠᴇꜱᴛʜᴇ ᴘʀᴏʙʟᴇᴍ ᴡɪᴛʜ ᴏ(ɴ ʟᴏɢ2(ɴ)) ᴛɪᴍᴇ ᴄᴏᴍᴘʟᴇxɪᴛʏ ᴏᴠᴇʀᴀʟʟ ʙᴜᴛ ꜱᴛᴀʏꜱ ᴡɪᴛʜɪɴ ᴛʜᴇ ʙᴏᴜɴᴅꜱ ᴏꜰ ᴏ(1) ꜱᴘᴀᴄᴇ ᴄᴏᴍᴘʟᴇxɪᴛʏ. ʜᴇʀᴇ, ɴ ɪꜱ ᴛʜᴇ ʟᴇɴɢᴛʜ ᴏꜰ ᴛʜᴇ ʟɪꜱᴛ ᴏꜰɪɴᴘᴜᴛ ɪɴᴛᴇɢᴇʀꜱ (ᴀʀʀᴀʏ). ɪ ʙᴇʟɪᴇᴠᴇ ᴛʜᴇ ꜱᴏʀᴛɪɴɢ ʀᴏᴜᴛɪɴᴇ ᴛʜᴀᴛ ᴄᴀɴ ʙᴇ ᴜꜱᴇᴅ ʜᴇʀᴇ ɪꜱ Qᴜɪᴄᴋ ꜱᴏʀᴛ. ᴘʟᴇᴀꜱᴇ ꜱᴛᴀᴛᴇ ᴀꜱ ᴄᴏᴅᴇ ᴄᴏᴍᴍᴇɴᴛ ᴡʜɪᴄʜ ꜱᴏʀᴛɪɴɢ ʀᴏᴜᴛɪɴᴇ ʏᴏᴜ ᴀʀᴇ ᴜꜱɪɴɢ, ꜱᴏʀᴛ ᴛʜᴇ ᴀʀʀᴀʏ ᴡɪᴛʜ ᴛʜᴀᴛ ᴀʟɢᴏʀɪᴛʜᴍ ᴀɴᴅ ꜱᴏʟᴠᴇ ᴛʜᴇ ᴅᴇ-ᴅᴜᴘʟɪᴄᴀᴛɪᴏɴ ᴘʀᴏʙʟᴇᴍ ᴛʜᴇʀᴇᴀꜰᴛᴇʀ. ᴅᴇ-ᴅᴜᴘʟɪᴄᴀᴛɪᴏɴ ᴘᴀʀᴛ ᴏꜰ ᴛʜᴇ ꜱᴏʟᴜᴛɪᴏɴ ɪɴ ɪᴛꜱᴇʟꜰ ᴍᴜꜱᴛ ᴀᴅʜᴇʀᴇ ᴛᴏ ᴏ(ɴ) ᴛɪᴍᴇ ᴀɴᴅ ᴏ(1) ꜱᴘᴀᴄᴇ ʙᴏᴜɴᴅꜱ ᴄᴏᴍᴍᴇɴᴛ ᴇᴠᴇʀʏ ʟɪɴᴇ ᴏꜰ ᴄᴏᴅᴇᴘʟᴇᴀꜱᴇ ᴡʀɪᴛᴇ ᴛᴇꜱᴛ-ᴄᴀꜱᴇꜱ ᴏɴ ʜᴏᴡ ᴏɴᴇ ᴡᴏᴜʟᴅᴛᴇꜱᴛ ᴛʜᴇ ꜱᴏʟᴜᴛɪᴏɴ ᴀꜱꜱᴜᴍᴘᴛɪᴏɴꜱ ᴀɴᴅ ʜᴇɴᴄᴇ ᴛʜᴇ ᴄᴏᴅᴇ ᴇxᴀᴍᴘʟᴇ ᴏꜰ ᴄᴀꜱᴇꜱ ᴛᴏ ʙᴇ ᴛᴇꜱᴛᴇᴅ ꜰᴏʀ ᴀʀᴇ ʟɪᴋᴇ : ᴡʜᴀᴛ ɪꜰ ᴛʜᴇ ᴀʀʀᴀʏ ɪɴᴘᴜᴛ ᴡʜɪᴄʜɪꜱ…
SUBJECT:- NETWORKING NOTE:- TAKE X = 1149 QUESTION# 1:- A bit stream X is being transmitted, where; X is the ASCII of last digits of your arid number (For example a student having 19-ARID-1149 will use ASCII of 1149 as X). a) Use 100001 as flag (starting/ending delimiter) and apply bit stuffing approach at layer 2. b) Apply Polar (RZ or NRZ) signaling/coding scheme on the resultant data obtained from part a of this question and represent the signal.
We compress the video with the pattern GoP (16 : 3) by using MPEG coding. Assume that the average compression ratios of frame I, frame P, and frame B are 1:5, 1:20, and 1:60, respectively. We put the compressed frames in 512 B packets and send them. The header size of each packet is 5% of the size of packet. Each packet contains information on one frame and its header, Each frame can be sent in multiple packets. Picture resolution is 196 × 144 for a video at 32 fps. (a)What is the compression ratio in this pattern? (b)What is the order of coding and transmitting frames in this pattern? (c)If frame 6 is lost while transmission, which frames will be faulty? (d)If frame 5 is lost while transmission, which frames will be faulty? (e)If frame 17 is lost while transmission, which frames will be faulty? (f)Find the size of uncompressed image frame? (g)In how many packets can an I-frame be transmitted on average? (h)In how many packets can an I-frame be transmitted on average? (i)In how many…
Assume the following parameters for Go-Back-N a) N 3 b) Round Trip Time (RTT)10 ms c) Retransmission Timeout period 40 ms d) Segment Size: 1200 bytes. Suppose that Bob sends 7 segments, numbere1 through 7, to Alice using the Go-Back-N mechanism. Suppose that Segment 3 and Segment are lost the first time the segments are sent to Alice, but reach Alice correctly when retransmitted. Apart from the above, there were no other segment losses. What is the average throughput obtained in sending all segments (in bytes/sec)? Draw a diagram to show your work in detail. 2. Assume the following parameters for Selective Repeat: b) Round Trip Time (RTT)10 ms c) Retransmission Timeout period 40 ms d) Segment Size: 1200 bytes Suppose that Bob sends 6 segments, numbered 1 through 6, to Alice using Selective Repeat. Suppose that Segment 3 gets lost the first time Bob sends it to Alice, but reaches Alice correctly when retransmitted Apart from the above, there were no other segment losses. What is the…
1. (A=0,Z=25) Encode: BE HONEST using the encrypting function f (p) = (p+ 3) mod 26. 2. Decode: GPWJO if the original message was encrypted using f (p) = (7p+ 10) mod 26. 3. What is the 6th term in the following sequence? 11, 15, 19, 23, ___, Blank 1 4. Using the Euclidean algorithm to compute for the gcd (1283, 7295), what is the value of the last nonzero remainder? 5. Is the given integer 9321 a prime or composite?
Compute CBC-MAC for a message of 16 bits, “ABCD” (in Hexa). Assume a block size of 8 bits with an IV=C9 (in hexa). For simplicity, assume the encryption to be a simple XOR of the key with the plaintext. Let the encryption key be D8 (in Hexa). (Hint: Divide the message into blocks of 8 bits each; XOR each block with the previous cipher output; then encrypt this with the key. For the first block, XOR it with IV.
10. The technique of temporarily delaying outgoing acknowledgements so that they can be hooked onto the next outgoing data frame is known as a. Bit stuffing b. Piggy backing c. Pipelining d. Broadcasting