Q1. describe the Dijkstra’s shortest path algorithm. As well illustrate the working of Dijkstra algorithm by the help of an illustration.
Q2. describe how does link state routing take care of the dilemma of wrapping of sequence numbers, crashing of routers and the corruption of sequence number?
Q3. Illustrate the purpose of fragment offset and time to live field in the IP diagram? Illustrate.
Q4. Describe the three-way handshake procedure of setting up or closing of a connection in the TCP.
Q5. Illustrate the purpose of the given fields in TCP segment header?
a) Urgent pointer
b) Six 1-bit flags
c) Window size
Q6. Distinguish between the UDP and TCP protocols.
Q7. Describe the RSA algorithm. By using the RSA public key cryptosystem find e for p = 5, q =13, and d = 11
Q8. describe symmetric and asymmetric key cryptography.
Q9. prepare a detail note on one of the given:
a) Modulation and Encoding