24 Suppose you are designing a sliding window protocol for a 1-Mbps point-to-factor hyperlink to the moon, which has a one-way latency of one.25 seconds. Assuming that every body consists of 1 KB of records, what is the minimal number of bits you need for the series quantity? 25 Suppose you're designing a sliding window protocol for a 1-Mbps factor-to-factor link to a desk bound satellite revolving across the earth at 3 104 km altitude. Assuming that each body consists of 1 KB of information, what's the minimum quantity of bits you want for the collection quantity in the following instances? Assume the speed of mild is three 108 m/s. The textual content suggests that the sliding window protocol can be used to put into effect flow control. We can believe doing this via having the receiver delay ACKs, this is, now not ship the ACK till there is loose buffer area to maintain the following frame. In doing so, every ACK might concurrently well known the receipt of the closing frame and inform the supply that there may be now loose buffer area to be had to preserve the next body. Explain why imposing waft manipulate on this manner isn't an excellent concept. 27 Implicit within the prevent-and-wait situations of Figure 2.19 is the notion that the re- ceiver will retransmit its ACK without delay on receipt of the replica records body. Suppose as a substitute that the receiver maintains its personal timer and retransmits its ACK only after the next predicted frame has now not arrived in the timeout interval. Draw timelines illustrating the scenarios in Figure 2.19(b)-(d); count on the re- ceiver's timeout cost is two times the sender's. Also redraw (c) assuming the receiver's timeout value is 1/2 the sender's. 28 In prevent-and-wait transmission, assume that each sender and receiver retransmit their last body straight away on receipt of a reproduction ACK or facts frame; such a approach is superficially affordable due to the fact receipt of any such replica is most in all likelihood to mean the other facet has experienced a timeout. (a) Draw a timeline showing what will show up if the first facts frame is by some means duplicated, however no frame is misplaced. How long will the duplications keep? This situation is referred to as the Sorcerer's Apprentice computer virus. (b) Suppose that, like data, ACKs are retransmitted if there may be no reaction inside the timeout duration. Suppose additionally that each aspects use the equal timeout c programming language. Identify a fairly probably situation for triggering the Sorcerer's Apprentice malicious program. 29 Give a few details of the way you would possibly augment the sliding window protocol with flow manipulate through having ACKs deliver extra records that reduces the SWS as the receiver runs out of buffer space. Illustrate your protocol with a timeline for a transmission; anticipate the preliminary SWS and RWS are 4, the hyperlink velocity is instan- taneous, and the receiver can unfastened buffers on the rate of 1 in step with second (i.E., the receiver is the bottleneck). Show what occurs at T = zero, T = 1, ... , T = four sec- onds.

question 1

Problem 1 (Numerical integration): Experimental data were collected as shown in Table 1. Compute the function integral from a = 0 to b = 1.2 using methods to attain the highest accuracy with optimum computational efforts, and explaining why the methods adopted were employed. Table 1: Experimental data X 0 0.1000 0.3000 0.5000 0.7000 0.9500 1.2000 f(x) 1.0000 0.9048 0.7408 0.6065 0.4966 0.3867 0.3012 Problem 2 (Numerical differentiation): The velocity v (m/s) of air flowing past a flat surface is measured at several distances y (m) away from the surface. Use Newton's viscosity law to determine the shear stress + (N/m ) at the surface (y = 0), t = u (du/dy). Assume a value of dynamic viscosity =1.8x10"'N- s/m . Explain the method used and show computation steps. 0 0:002 0.006 0 012 0018 01024 n. m/'s 0 0 287 0.890 1.915 3048 4.299Problem 1 Find data rate R for each of the following cases: a)Text Transmission: Sending 5 pages of text per second, where there are 100 ASCII characters per page, and using 8 bits per character. (5 points ) R= b)Audio Transmission: Taking 200 samples of audio signal per second, where using & bits per sample. (5 points) R= c) Video Transmission: Black and White Pictures Sending 30 images (pictures) per second, where there are 64 X 32 pixels per image, and using 8 bits per pixel. (5 points).QUESTION 3 DATA TRANSMISSION 3.1 Assume we wanted to transmit the decimal number 210. This can be represented in binary by the 8-bit number 11010010. 3.1.1 Sketch a digital signal to represent serial transmission of this number, if each bit is 1 ms. (3) 3.1.2 Determine the bit rate if each bit interval is 1 ms. (2) 3.1.3 Determine the baud rate if each bit interval is 1 ms. (1) 3.1.4 Determine bit rate if two bits are transmitted per 1 ms bit interval. (2) 3.2 What is the ASCII code for the character w? (2) [10] TOTAL = [40]