Question Paper: Computer Communication & Telecom Networks : Question Paper Dec 2013 - Electronics & Telecomm. (Semester 6) | Mumbai University (MU)

Computer Communication & Telecom Networks - Dec 2013

Electronics & Telecomm. (Semester 6)

(1) Question 1 is compulsory.
(2) Attempt any three from the remaining questions.
(3) Assume data if required.
(4) Figures to the right indicate full marks.
1 (a) Explain the difference between data link layer delivery and network layer delivery.(5 marks) 1 (b) Differentiate between circuit switching and packet switching.(5 marks) 1 (c) Why do you require a limit on minimum size of Ethernet frame?(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 OSI model and explain the process of encapsulation in detail.(10 marks) 3 (a) Explain in detail HDLC protocol with all the frame types supported by HDLC. Differentiate HDLC and PPP protocols.(10 marks) 3 (b) Discuss various scheduling medium access control techniques. (10 marks) 4 (a) Explain exterior and interior routing. Explain in brief distance vector routing and Link state routing.(10 marks) 4 (b) Write a note on IEEE 802.3 in detail.(10 marks) 5 (a) Explain fragmentation and the fields related to fragmentation in IP datagram header. Discuss why IPV4 protocol needs to fragment some packets.(10 marks) 5 (b) Discuss queuing system classification. Explain M/M/1 queuing system.(10 marks) 6 (a) Explain the various fields in TCP header format.(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 short notes on :-

7 (a) Private IPV4 addresses.(10 marks) 7 (b) Looping in distance vector routing protocol.(10 marks) 7 (c) DHCP and RARP.(10 marks)

written 3.2 years ago by gravatar for Team Ques10 Team Ques10 ♦♦ 410
Please log in to add an answer.