Scribd
Upload
1 views

Computer Networks Cat 1

This document outlines the Continuous Assessment Test I for the B.Tech (ECM) program at Vellore Institute of Technology, covering the course Computer Networks. It includes various questions on the OSI model, network topologies, switching networks, error detection, and coding schemes. The test is designed to assess students' understanding of key concepts in computer networking within a 90-minute timeframe for a maximum of 50 marks.

Uploaded by

Naman Masodkar
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
1 views

Computer Networks Cat 1

This document outlines the Continuous Assessment Test I for the B.Tech (ECM) program at Vellore Institute of Technology, covering the course Computer Networks. It includes various questions on the OSI model, network topologies, switching networks, error detection, and coding schemes. The test is designed to assess students' understanding of key concepts in computer networking within a 90-minute timeframe for a maximum of 50 marks.

Uploaded by

Naman Masodkar
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Reg. No.

:
Name
1y

VIT
Vellore Institute of Technology
(Dewd to le Uulersty mret ecton lof Act, 1956)

Continuous Assessment Test I- May 2023


Programme B.Tech (ECM) Semester Fall Inter Sem
2022-23
Course Code BCSE308L
CH202223250037S.
Class Nbr. CH2022232500377,
Computer Networks
CH2022232500378.
CH202223250037(6.
CII2022232500379
Faculty Dr.Jayavignesh T, Dr.Kalaivanan K, Slot
Dr.Markkandan S, Dr.Vijayakumar V, C2+ TC2
Dr.Vydeki D
Time :90 Minutes Max. Marks 50

Answer ALL thequestions

Sub.
Q.No. Sec. Questions Marks

ldentify one or more layers of the OSI model that carry out the following
responsibilities and explain them in detail:
i) Transmission of bit stream across physical medium.
1.
Defines Frames.
a.
|10|
ii) Error correction and retransmission.
iv) Reliable Process-to-process message delivery.
V) Route selection.
vi) Provides user services such as e-mailand file transfer.
b. Compare and contrast star and mesh topologies using suitable examples.
Assume that processing delay, queuing delay and control overhead-bits are ignored.
Consider the message size as 30,000 bits, the propagation time is 10ms per hop, packet
length is 1000 bits, transmission rate per hop is 10000 bps and call set-up time is 2ms.
2 a. Find the total time for both the circuit and packet switching networks when number of |10]
intermediate nodes as (i) 2, (ii) 5,(ii) 10, (iv) 50, (v) 100. Also, comment on the
network performance in terms of the total delay in both the switching networks when
the number of intermediate nodes incrcases.

Consider an Intermet application running on two Internet hosts, Hostl and Host2, which
are communicating using a path through router R. Assume that the average service time
b (queuing and processing delay) at R is 15 ms, packets are 6,000 bits long and the
propagation delay between Hostl and Host2 is 250ms. Also, ignore the control
overhead.
() If the application running on Host I and Host2 cannot tolerate latencies over 350ms,
what is the minimum capacity of the link connccting the two hosts?
Give an example of a delay-intolerant Internet application, and identity whicn
switching network is suitable for a delay-intolerant application.
d. Compare the merits and demerits of packet datagram approach and circuit switching
network.
(5]

The Bluetooth and USB standards use CRC-16 polynomial for error detection in data [10]
communications. Ifthe adopted CRC-16 Generator Polynomial x16 4 x12 + x+1
is used for error detection,

3. a. i) What is the number of check bits generated by this polynomial? [l mark]


ii) Does it detect a single bit error? Defend your answer. [3 marks]
ii) What willbe the probability of detecting burst error of size 14? (2 marks]
iv) What will be the probability of detecting burst error of size 17? (2 marks]
v) What will be the probability of detecting burst error of size l8? (2 marks]

Following Table Ishows a block code C(n,k) generation scheme (5]


Dataword Codeword
00 00000
01 01011
10 10101
b. 1 11110
Table 1
i) Prove whether this scheme is a linear block code or not.
ii) Determine how the code word table is generated.
ii) What is the minimum hamming distance of this scheme?
iv) What is the error detecting and eror correction capability of this scheme? Justify it
with suitable examples.

You might also like