0% found this document useful (0 votes)
42 views3 pages

Computer Networks

This document is an exam for a computer networks course. It contains 6 questions testing students' knowledge of various computer network concepts: 1. The first question asks students to identify which network layer different design issues belong to and provide details on those issues. It also asks students to define protocol hierarchies, interfaces, network architecture, and protocol stacks. 2. The second questions covers error detection and correction using hamming distance and CRC algorithms. 3. The third question covers concepts in ALOHA and slotted ALOHA networks like vulnerable time and efficiency. It also asks about frame fields in Ethernet. 4. The fourth question tests knowledge of shortest path algorithms like Dijkstra's and different types of

Uploaded by

xyz86538
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
42 views3 pages

Computer Networks

This document is an exam for a computer networks course. It contains 6 questions testing students' knowledge of various computer network concepts: 1. The first question asks students to identify which network layer different design issues belong to and provide details on those issues. It also asks students to define protocol hierarchies, interfaces, network architecture, and protocol stacks. 2. The second questions covers error detection and correction using hamming distance and CRC algorithms. 3. The third question covers concepts in ALOHA and slotted ALOHA networks like vulnerable time and efficiency. It also asks about frame fields in Ethernet. 4. The fourth question tests knowledge of shortest path algorithms like Dijkstra's and different types of

Uploaded by

xyz86538
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Course Code : CCT 204 EZFY/RW – 22 / 1238

Third Semester B. Tech. ( Computer Science and Engineering /


Cyber Security ) Examination

COMPUTER NETWORKS

Time : 3 Hours ] [ Max. Marks : 60

Instructions to Candidates :—
(1) All questions carry marks as indicated.
(2) Assume suitable data and illustrate answers with neat sketches wherever necessary.

1. (a) Which layer does the following :—


(i) Token management.

(ii) Solving fast sender swamping slow receiver problem.

(iii) Dealing with Electrical, procedural and mechanical aspects.

(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,

(b) Network Architecture,

(c) Protocol Stack. 5(CO1)

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)

EZFY/RW-22 / 1238 Contd.


(b) A bit stream 10011101 is transmitted using the standard CRC method.
The generator polynomial is x3 + 1. Calculate the actual bit string transmitted.
Suppose the third bit from the left is inverted during transmission. Show
that this error is detected at the receiver's end. 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

EZFY/RW-22 / 1238 2 Contd.


output at a rate of 10 megabytes per second. The token bucket is currently
full and the machine needs to send 12 megabytes of data. The minimum
time required to transmit the data is __________ seconds.
Also explain the working of Token bucket algorithm. 5(CO2)

6. (a) Describe the functions of the following components of Bluetooth :—


(i) Link Manager Protocol.
(ii) Host Controller Interface.
(iii) Logical Link Control and Adaptation Protocol.
(iv) Radio Frequency Communication.
(v) Service Discovery Protocol. 5(CO3)

(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

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy