written 16 months ago by
modified 6 months ago
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.
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.
Encode the message 1011111000001 using biary encoding, Manchester encoding and
differential Manchester encoding.
Find the shortest path between A and D using Dijkstra Algorithm.
What are the different world wide unique identifiers? Explain the components of
Uniform Resource Locators.
Explain how a strong Generator Polynomial is formed. Give the Algorithm for computing the checksum.
Explain any two collision free protocols.
Explain the reasons for congestion in a network. Explain open loop congestion control
Explain TCP IP reference model and compare it with OSI reference model.
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.
Prove that the slotted ALOHA performs better than Pure ALOHA.
Compare Guided media w.r.t unguided media.
Compare Routing protocols RIP, OSPF and BGP.
Q6) Write short notes on (any two):
Sockets and Socket Programming.