Question Paper: Computer Communication Networks : Question Paper May 2013 - Electronics & Telecomm. (Semester 7) | Mumbai University (MU)
0

Computer Communication Networks - May 2013

Electronics & Telecomm. (Semester 7)

TOTAL MARKS: 100
TOTAL TIME: 3 HOURS
(1) Question 1 is compulsory.
(2) Attempt any four from the remaining questions.
(3) Assume data wherever required.
(4) Figures to the right indicate full marks.
1 (a) Explain the difference between connection oriented and connection-less service.(5 marks) 1 (b) What is data transparency? What is bit stuffing and De-stuffing?(5 marks) 1 (c) What is collision and broadcast domain? How can they be reduced?(5 marks) 1 (d) Explain ALOHA and slotted ALOHA.(5 marks) 2 (a) What does the term error control mean in the data link layer? Explain Go-Back ARQ and selective repeat ARQ protocols. (10 marks) 2 (b) Explain count to infinity problem and methods to overcome this problem.(10 marks) 3 (a) Compare circuit switching, packet switching and message switching in detail.(10 marks) 3 (b) Explain TCP header in detail.(10 marks) 4 (a) Explain in detail repeaters, hubs, bridges, routers and switches.(10 marks) 4 (b) What is exterior and interior routing? Explain in detail distance vector routing or link state routing?(10 marks) 5 (a) Explain HDLC frame format. Describe configuration and response modes supported by HDLC protocol.(10 marks) 5 (b) Explain looping problem in bridge LAN with appropriate example. How to solve it.(10 marks) 6 (a) Write a note in detail on IEEE 802.3 standard in detail.(10 marks) 6 (b) Find the shortest path between the source node 1 and and to all the 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)


Write notes on (Any two) :-

7 (a) M/M/I model(10 marks) 7 (b) ARP and RARP(10 marks) 7 (c) ICMP(10 marks)

Please log in to add an answer.