Question Paper: Computer Communication Networks : Question Paper May 2016 - Electronics Engineering (Semester 7) | Mumbai University (MU)
Computer Communication Networks - May 2016
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) Assume data if required.
(4) Figures to the right indicate full marks.
Answer any four questions briefly
1(a) Compare Osi reference model and the TCP/IP reference model
1(b) Explain the authentication protocols of PPP
1(c) How does Token Bucket algorithm work?
1(d) Explain 'bit stuffing' in bit oriented protocols.
2(a) With a suitable sketch explain the transition/connection phases in Point to Point Protocol (PPP). Also explain the supported sets of protocols in the PPP stack.
2(b) Distinguish between go Back N ARQ and Selective Reject ARQ. Sketch the frame flow diagram for Go Back N ARQ and with 3 bit sequence number field and window size of 5, showing the following events: i) Frame 0 is sent ; Frame 0 is acknowledged ii) Frames 1 and 2 are sent ; Frames 1 and 2 are acknowledged iii) Frames 3,4,5 are sent ; Frame 4 is damaged. iv) timer for frame 5 expires.
3(a) Explain the different classes of IP addresses. Identify the class of the following IP addresses and give their default subnet masks: 1) 188.8.131.52.2
3(b) Explain TCP connection establishment and release.
3(c) Draw TST switch and three stage space division switch for N=20, n=5 and k=2 and estimate the number of crosspoints required for both cases. If the above space division switch is to be made non-blocking, calculate the minimum number of crosspoints required.
4(a) Explain ADSL with respect tp spectrum allocation and modulation technique
4(b) What are the conditions to be satisfied by a good CRC generator polynomial? For P=predetermined divisor = 110101(LSB) and D=k bit data block = 1010001101(LSB), find the CRC.
5(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
5(b) Explain how TCP handles error control and flow control