Q1. Prove that the utilization of sliding window protocol for the error free channel is U = W/1+2a, where ‘W’ is the window size and ‘a’ is ratio of propagation time to the transmission time.
Q2. Illustrate the Time Division Multiple Accesses? Describe in detail.
Q3. Describe the working of Synchronous Time Division Multiplexing.
Q4. Illustrate the datagram networks and how it is distinct with packet switching? Describe datagram network having four switches. Explain how routing table is maintained in this network?
Q5. Explain how Connection is established and Terminated in the TCP by using three way handshaking methods? Illustrate in detail.
Q6. Illustrate the criteria to select keys in the RSA algorithm? How encryption and decryption is done in the RSA algorithm. Describe with the help of illustration.