Computer Network Question Paper - May 18 - Computer Engineering (Semester 5) - Mumbai University (MU)

Computer Network - May 18

Computer Engineering (Semester 5)

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.

1(a) Explain the method to find number check bits required to correct single bit error for a 10-bit message and compute the check bits for 11100 00101.
(5 marks) 00

1(b) Encode the message 1011111000001 using biary encoding, Manchester encoding and differential Manchester encoding.
(5 marks) 00

1(c) Find the shortest path between A and D using Dijkstra Algorithm.
(5 marks) 1899

1(d) What are the different world wide unique identifiers? Explain the components of Uniform Resource Locators.
(5 marks) 00

2(a) Explain how a strong Generator Polynomial is formed. Give the Algorithm for computing the checksum.
(10 marks) 00

2(b) Explain any two collision free protocols.
(10 marks) 00

3(a) Explain the reasons for congestion in a network. Explain open loop congestion control methods.
(10 marks) 1883

3(b) Explain TCP IP reference model and compare it with OSI reference model.
(10 marks) 1852

4(a) Explain how the value of 'n' is decided in an n bit sliding window protocol. Explain the advantages of Selective repeat over go-back n protocol.
(5 marks) 1860

4(b) Prove that the slotted ALOHA performs better than Pure ALOHA.
(10 marks) 1865

5(a) Compare Guided media w.r.t unguided media.
(10 marks) 00

5(b) Compare Routing protocols RIP, OSPF and BGP.
(10 marks) 1904

Q6) Write short notes on (any two):

6(a) DNS
(10 marks) 1916

6(b) SNMP
(10 marks) 00

6(c) Sockets and Socket Programming.
(10 marks) 1913


Next up

Read More Questions

If you are looking for answer to specific questions, you can search them here. We'll find the best answer for you.


Study Full Subject

If you are looking for good study material, you can checkout our subjects. Hundreds of important topics are covered in them.

Know More