Question Paper: Computer Communication Networks Question Paper - Dec 16 - Electronics Engineering (Semester 7) - Mumbai University (MU)
Computer Communication Networks - Dec 16
Electronics Engineering (Semester 7)
Total marks: 80
Total time: 3 Hours
(1) Question 1 is compulsory.
(2) Attempt any three from the remaining questions.
(3) Draw neat diagrams wherever necessary.
Q1) Answer any four:
Explain PPP header format.
Compare TCP and UDP.
List the categories Of UTP cables. How is noise minimized in twisted pair interference minimized in cables ?
Distinguish between OSPF and BGP.
What is sub netting? List advantages and disadvantages of the same
List and explain different ARQ techniques. Specify the maximum window size for each with justification
What is piggybacking? Give an example of Piggybacked flutter Sketch the appropriate HDLC frames for the following station 'A' and two Secondary stations B and C:
i. Primary station A wishes to establish a Normal Response mode Secondary stations B and C.
ii. Both the stations B and C send positive acknowledgements to A
iii. Station A sends a polling command Band B sends 4 data frames. The third frame is lost during transmission
iv. Assuming Selective repeat station A sends negative acknowledgement to station B.
v. Station B resends the frame and A sends positive acknowledgement
vi. Station A now polls station C and station C responds with ready response, A sends three data frames to C and C sends positive acknowledgement to indicate the receipt of error free data frames.
Differentiate between IPv4 and IPv6. Determine the class and network address for the following IP addresses
(Assuming subnetting is not being used and use default mask)
What is meant by "blocking" in circuit switching networks? Bring out the advantages of multi stage space division switching over single stage switching.
Sketch-three stage space division switch for N=15, n = 5 and k =2. What is the condition required to make it non-blocking? For the same specifications, sketch three stage TST switch using TSI modules.
Draw OSI reference model and explain function of each layer. Name the layers responsible for:
i) end to end reliability
ii) link to link reliability.
Define the utilization or efficiency of the line and derive the expression for stop and wait now control. Calculate the maximum link utilization for the following cases:
i) Stop and wait flow control
ii) Sliding window flow control with window sizes of 4 and 7
*Frame Length = 1000 bits/frame
*Velocity of propagation = 2 x 10 8 m/sec
*Link distance = 20km
*Data rate = 20 Mbps
Apply Dijkstra and Bellman Ford algorithm to the given network and find the
least cost path between source node 1 to all other nodes:
Draw and explain TCP header format with the help of a neat diagram.