COMPUTER COMMUNICATION NETWORKS (CCN), B.E. Electronics & Telecommunication, Semester 7, May 2013.

COMPUTER COMMUNICATION NETWORKS (CCN),

B.E. Electronics & Telecommunication,

Semester 7, May 2013.

Con. 9370-13.

GS- 5788

(REVISED COURSE)

(3 Hours)

[Total Mark: 100]

N.B. (1) Question No 1 is compulsory.

(2) Attempt any four questions out of remaining six questions.

(3) Illustrate answers with sketches wherever required.

(4) Figures to the right indicate marks.

1. (a) Explain the difference between a connection oriented and connection less service. --- (5 Marks)

(b) What is data transparency? Explain bit stuffing and destuffing. ---- (5 Marks)

(c) What is collision and broadcast domain? How can they be reduced ? ---- (5 Marks)

(d) Explain ALOHA and Slotted ALOHA. ---- (5 Marks)

2. (a) What does the term error control mean in data link layer? Explain Go back N and selective repeat ARQ protocols. ---- (10 Marks)

(b) Explain count to infinity problem with an example and a method to avoid this Problem. ---- (10 Marks)

3. (a) Compare circuit switching, packet switching and message switching in detail. ---- (10 Marks)

(b) Explain TCP header in detail. ---- (10 Marks)

4. (a) Explain in detail repeaters, hub, bridges, routers, gateway and switches. ----(10 Marks)

(b) What is exterior and interior routing? Explain in brief distance vector routing and Link state routing. ---- (10 Marks)

5. (a) Explain HDLC frame formate. Describe configuration and response modes supported by HDLC protocol. ----- (10 Marks)

(b) Explain looping problem in bridge LAN with appropriate example. How to solve it. ---- (10 Marks)

6. (a) Write a note on IEEE 802.3 standard in detail. ----- (10 Marks)

(b) Find the shortest path between the source nodes 1 to all other nodes for the network given below using Dijkstra’s algorithm. Also draw the shortest path tree from node 1 to all other nodes. ---- (10 Marks)

7. Write short notes on any two: ---- (20 Marks)

(i) M/M/I model

(ii) ARP and RARP

(iii) ICMP