Engineering BE Electronics and Computer Science Sem 6 May 2019 2019 Computer Communication Network Question Paper - Mumbai University | munotes

Questions asked in this paper

1. Q2 Attempt any three from the remaining questions
2. Q1 Answer any FOUR
   • a) Explain different types of network addresses. 5
   • c) List the categories of UTP cables. How is noise interference 5 minimized in twisted pair cables?
   • d) Distinguish between synchronous and statistical TDM. 5
   • e) Whatis sub netting? List advantages and disadvantages of the same. — 5
3. Q2 a Explain Different ARQ techniques. Also explain the maximum window size for each with justification 10 marks
4. Q2 b What is piggybacking? Give and example of Piggybacked frame. ketch the appropriate HDLC frames for the following scenario involving Primary station 'A' and two Secondary stations B and C 10 marks
5. Q1 Primary station A wishes to establish Response mode. link with Secondary stations B and C
6. Q2 Both the stations B and C,, send positive ackowledgements to A 3.Station A sends.a polling command to B and B sends 4 data frames The third frame is lost during transmission acknowledgement to station B 5, Station B resends the frame and A sends positive acknowledgement
7. Q6 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
8. Q3 a Differentiate between IPv4 and ExplainTunneling. Determine the class and network address for the following IP addresses(Assuming subnetting is not being used and use default mask) 10 marks
9. Q3 b What is meant by in circuit switching networks? Bring out the advantages of multi stage space division switching over single stage switching. (1). Sketch the three stage Space Division switch with N=15, group size of n=5, k=2. the condition required to make it non blocking? 10 marks
   • (2). For. the same specifications sketch three stage TST switch using TSI
10. Q4 a Draw model and explain function of each layer. Name the layers responsible for (1). end to end reliability (2). link to link reliability 10 marks
11. Q4 b Define the utilization or efficiency of the line and derive the expression for stop and wait flow control. Calculate the maximum link utilization for the 10 marks
12. Q1 Stop and wait flow control
13. Q2 Sliding window flow control with window sizes of Velocity of propagation = 2 X m/sec 4 marks
14. Q5 a Apply Dijkstra's and Bellman Ford algorithm to the given network and find the least cost path between source node 1 to all other nodes 10 marks
15. Q5 b Draw and Explain TCP header format with the help of a neat diagram. 10 marks
16. Q6 Write short note on:( Any TWO) Compare. and IPv6 20 marks

Read from the scan above, so a character or two may differ. The scan is the original.