Computer Networks

Q.1. (a) Define mathematical models for M/M/1 and M/M/infinity. [8]

(b) Define Little's formula. [8]

Q.1. (a) How to work queuing theory for pure birth, pure death and birth death processes? [8]

(b) Define mathematical models for M/M/m and M/M/1/K. [8]

Q.2. (a) Explain OSI model with all layers. [8]

(b) Define Line Coding Schemes. [8]

Q.2. (a) Define Simplex Stop & Wait Protocol. [8]

(b) What is Protocol? Explain sliding window protocol. [8]

Q.3. (a) Differentiate Token Bus and Token Ring. [8]

(b) What is static and dynamic channel allocation? [8]

Q.3. (a) Differentiate ALOHA and Slotted ALOHA. [8]

(b) Define Virtual Circuit Network. [8]

Q.4. (a) Explain the difference between IPV4 and IPV6. [8]

(b) Differentiate Non-adaptive & adaptive routing algorithms. [8]

Q.4. (a) Define OSPF and BGP in brief. [8]

(b) What is Routing Protocol? Explain distance vector routing. [8]

Q.5. (a) Draw and explain Domain Name System (DNS) record structure. [8]

(b) Differentiate leaky bucket and token bucket implementation. [8]

Q.5. (a) Draw and explain TCP Header and segment structure. [8]

(b) Explain TCP frame format. [8]