Computer Networks
Computer Networks
COMPUTER NETWORKS
Instructions to Candidates :—
(1) All questions carry marks as indicated.
(2) Assume suitable data and illustrate answers with neat sketches wherever necessary.
(iv) Piggybacking.
(v) Multiplexing.
Comment on the above design issues in detail. 5(CO1)
(b) With a non-technical and technical example, elaborate the concept of protocol
hierarchies. Also define the following terms :
(a) Interface,
2. (a) If the message bits are 1100110100011010. Calculate the check bits needed
to be sent with frame using hamming distance error correction algorithm.
Assume even parity. 5(CO2)
3. (a) Stations in pure ALOHA network sends frame of size 1000 bits at the
rate of 1 Mbps. What is the vulnerable time for this network ?
Describe the working of pure and slotted ALOHA. Comment on their efficiency.
5(CO2)
(b) Produce a sketch diagram to show the fields of a frame as used by
Ethernet / IEEE 802.3. Why a frame with a length less than 64 bytes is
not allowed on an IEEE 802.3 network. 5(CO2)
4. (a)
Consider the directed graph shown in the figure above. There are multiple
shortest paths between vertices S and T. Which one will be reported by
Dijstra's shortest path algorithm ? What is the difference between a adaptable
and non – adaptable routing algorithm ? 5(CO3)
(b) Differentiate between the two ways in which a network layer can be internally
organized. 5(CO3)
5. (a) What is Two army problem ? How does transport layer handles disconnection ?
Sketch all the scenarios where messages are lost. 5(CO2)
(b) For a host machine that uses the token bucket algorithm for congestion
control, the token bucket has a capacity of 1 megabyte and the maximum
output rate is 20 megabytes per second. Tokens arrive at a rate to sustain
(b) List the advantages of using a firewall for an IT infrastructure. What are
the different protection methods used in firewall implementation ?
5(CO3)
EZFY/RW-22 / 1238 3 75