0% found this document useful (0 votes)
278 views

Computer Networks - CS3591 - Important Questions With Answer - Unit 2 - Transport Layer

cn notes important unit 2 qn

Uploaded by

shakthi sri
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
278 views

Computer Networks - CS3591 - Important Questions With Answer - Unit 2 - Transport Layer

cn notes important unit 2 qn

Uploaded by

shakthi sri
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 9

Click on Subject/Paper under Semester to enter.

Environmental Sciences
Professional English and Sustainability -
Professional English - - II - HS3252 Discrete Mathematics GE3451
I - HS3152 - MA3354
Statistics and Theory of Computation
Matrices and Calculus Numerical Methods - Digital Principles and - CS3452
3rd Semester

4th Semester
- MA3151 MA3251 Computer Organization
1st Semester

2nd Semester

- CS3351 Artificial Intelligence


Engineering Graphics and Machine Learning
Engineering Physics - - CS3491
- GE3251 Foundation of Data
PH3151
Science - CS3352
Database Management
Physics for
Engineering Chemistry System - CS3492
Information Science Data Structure -
- CY3151 - PH3256 CS3301

Basic Electrical and


Algorithms - CS3401
Problem Solving and Electronics Engineering Object Oriented
Python Programming - - BE3251 Programming - CS3391 Introduction to
GE3151 Operating Systems -
Programming in C -
CS3451
CS3251

Computer Networks - Object Oriented


CS3591 Software Engineering
- CCS356
Compiler Design - Human Values and
5th Semester

CS3501 Embedded Systems Ethics - GE3791


7th Semester

8th Semester
6th Semester

and IoT - CS3691


Cryptography and Open Elective 2
Cyber Security - Open Elective-1 Project Work /
CB3491
Open Elective 3 Intership
Distributed Computing Elective-3
- CS3551 Open Elective 4
Elective-4
Elective 1
Management Elective
Elective-5
Elective 2
Elective-6
All Computer Engg Subjects - [ B.E., M.E., ] (Click on Subjects to
enter)
Programming in C Computer Networks Operating Systems
Programming and Data Programming and Data Problem Solving and Python
Structures I Structure II Programming
Database Management Systems Computer Architecture Analog and Digital
Communication
Design and Analysis of Microprocessors and Object Oriented Analysis
Algorithms Microcontrollers and Design
Software Engineering Discrete Mathematics Internet Programming
Theory of Computation Computer Graphics Distributed Systems
Mobile Computing Compiler Design Digital Signal Processing
Artificial Intelligence Software Testing Grid and Cloud Computing
Data Ware Housing and Data Cryptography and Resource Management
Mining Network Security Techniques
Service Oriented Architecture Embedded and Real Time Multi - Core Architectures
Systems and Programming
Probability and Queueing Theory Physics for Information Transforms and Partial
Science Differential Equations
Technical English Engineering Physics Engineering Chemistry
Engineering Graphics Total Quality Professional Ethics in
Management Engineering
Basic Electrical and Electronics Problem Solving and Environmental Science and
and Measurement Engineering Python Programming Engineering
4931_Grace College of Engineering,Thoothukudi www.BrainKart.com

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

BE- Computer Science and Engineering

E
Anna University Regulation: 2021

O
C
CS3591- Computer Networks
E
III Year/V Semester
AC

Question Bank
R
G

Unit- II Transport Layer

Prepared By,

Ms. S. Abarna, AP/CSE

https://play.google.com/store/apps/details?id=info.therithal.brainkart.annauniversitynotes&hl=en_IN
CS3591_CN
4931_Grace College of Engineering,Thoothukudi www.BrainKart.com
CS3591-Computer Networks Department of CSE
UNIT II TRANSPORT LAYER
Introduction - Transport-Layer Protocols: UDP – TCP: Connection Management – Flow
control - Congestion Control - Congestion avoidance (DECbit, RED) – SCTP – Quality of
Service.
PART-A
1. List the advantages of a centralized scheme.
It may afford greater control over access for priorities, overrides, and guaranteed
capacity.
It enables the use of relatively simple access logic at each station.
It avoids problems of distributed coordination among peer entities.
2. Mention some of the physical properties of Ethernet. (May 11)
The Ethernet is a multiple-access network, meaning that a set of nodes send and receive
frames over a shared link. An Ethernet is like a bus that has multiple stations plugged
into it.
3. When a transmitting station will insert a new token on the ring?
It will insert a new token when the station has completed transmission of its frame.

E
The leading edge of the transmitted frame has returned to the station.
4. List the rules for CSMA/CD.
1) If the medium is idle, transmit; otherwise go to step 2. 2) If the medium is busy,

O
continue to listen until the channel is idle, and then transmit immediately. 3) If a collision
detected during transmission, transmit a brief jamming signal to all station to indicate
C
collision has occurred and then cease transmission.
5. What is Early Token Release (ETR)?
ETR allows a transmitting station to release a token as soon as it completes frame
E
transmission, whether or not the frame header has returned to the station.
6. What is CSMA/CD? (Nov 11)
Carrier Sense Multiple Access with Collision Detection is one of the methods of medium
AC

access. It is used to sense whether a medium is busy before transmission. If the medium
is busy, it refrains from transmitting the data or else proceeds with the transmission. Also
has the ability to check whether a transmission has collided with another.
R

7. What is a bridge? (Nov 11)


Bridge is a hardware networking device used to connect two LANs. A bridge operates a
data link layer of the OSI layer. A bridge observes and forwards all frames that it receives
G

It does forwarding & filtering frames using LAN destination address. Bridges are used t
connect LAN or WAN and works at data link layer level. Collision Probability is more.
8. What is the advantage of FDDI over a basic token ring? (Nov 10)
FDDI Token Ring (IEEE 802.5)
No priority and reservation bits. It has priority scheme by using
reservation bits.
No need of converting a token to start of data It converts a token to data frame
frame by inverting token bits because of high data changing token frame.
rate.
A station that transmits data frames releases a new A station that data transmissions
token as soon as it completes data. after releasing back its own
transmission, release the token.
FDDI uses a timed token protocol Token Ring uses
priority/reservation token access

Page 7 of 26
https://play.google.com/store/apps/details?id=info.therithal.brainkart.annauniversitynotes&hl=en_IN
CS3591_CN
4931_Grace College of Engineering,Thoothukudi www.BrainKart.com
CS3591-Computer Networks Department of CSE

9. Give the format of Ethernet address. (Nov 21)


Preamble Dest addr Src addr Type Body CRC
64 48 48 16 32
10. What does IEEE 10 Base 5 standard signify?
10 represents data rate 10 Mbps , 5 refers to segment length 5* 100 m that can run without
repeaters .Base represents Base band communication.
11. What is meant by the contention period of Ethernet? How many lines are required to
connect n systems in Direct Mesh topology?
When several stations on an Ethernet have data to send, there are contention periods
during which collisions happen and no data is successfully transmitted. n (n-1)/2 lines
are required.
12. Define Repeater and Hub.
Repeaters and hubs are interconnecting devices.
Repeater: Repeaters extends the Ethernet segment and it repeats the signal. It does not

E
amplify the signal.
Hub: A Hub has several point to point segments coming out. It is a multi way repeater.
It broadcasts any signal through all outgoing lines.

O
13. What is meant by Exponential back of algorithm?
After first collision, each station waits either 0 or 1 slot time before trying again. If two
C
stations collide and each one picks same random number 0/1.
After second collision, each one picks 0, 1, 2 or 3 slot at random and waits.
If collision occurs again, then next time the number of slots to wait is chosen at random
from 0 to [23 – 1]. This algorithm is called binary exponential “back off algorithm”.
E
14. Mention the different types of bridge. What are the limitations of bridges?
(Nov 13)
AC

 Simple Bridge connects two LAN ,Multi port Bridge connect more than 2 LANs
 Transparent Bridge it learns on its own about connected LANs.
 The limitations of bridges: Scalability and Heterogeneity
15. What are the functions of Bridges? (Nov 10,21)(May 17)
 A bridge should have enough buffer space to store the frames until it is transmitted
R

 It should be able to distinguish addresses of host on different LAN.


 It can contain information about other bridges, & works at layer 1 and layer 2.
G

 It should follow congestion control mechanisms to overcome congestion.


16. List out any four IEEE 802 standard with its name. (May 12)
 The IEEE 802 family of standards is maintained by the IEEE 802 LAN/MAN Standard
Committee (LMSC).
 The most widely used standards are for the Ethernet family, Token Ring, Wireless LAN,
Bridging and Virtual Bridged LANs.
 An individual Working Group provides the focus for each area.
17. Define Bridge and Switch. (May 12)
Bridge: used to send the message from one LAN into another LAN.
Switch: used to send the data from one node into another node directly in the network.
18. What is the access method used by wireless LAN? (May 14)
The access method used by wireless LAN is Carrier Sense Multiple Access with Collision
Avoidance (CSMA/CA)

Page 8 of 26
https://play.google.com/store/apps/details?id=info.therithal.brainkart.annauniversitynotes&hl=en_IN
CS3591_CN
4931_Grace College of Engineering,Thoothukudi www.BrainKart.com
CS3591-Computer Networks Department of CSE
19. Define hidden node problem. (May 16)
In wireless networking, the hidden node problem or hidden terminal problem occurs
when a node is visible from a wireless access point (AP), but not from other nodes
communicating with that AP. This leads to difficulties in media access control sub layer.
20. What is Bluetooth?
Bluetooth is a standard for the short-range wireless interconnection of mobile phones,
computers, and other electronic devices. Bluetooth is a wireless technology standard for
exchanging data over short distances (using short-wavelength UHF radio waves in the
ISM band from 2.4 to 2.485 GHz) from fixed and mobile devices, and building personal
area networks (PANs).
21. Distinguish between forward error correction versus error correction by
retransmission.
In forward error correction, the receiver tries to correct the corrupted codeword;
in error detection by retransmission, the corrupted message is discarded (the
sender needs to retransmit the message).
22. Distinguish between point-to-point and broadcast link. (Nov 19)
 A method of sending a signal where multiple parties may hear a single sender. Radio

E
stations are a good example of every day life "Broadcast Network". In this case the
radio station is a sender of information/signal and data is only expected to flow in

O
one direction only . ie. away from the radio broadcast tower.
 In networking, the Point-to-Point is a data networking commonly used to establish a
direct connection between two networking nodes. It can provide connection 1)Direct
C
Connection 2) Authentication 3) Transmission encryption privacy.
23. Outline the use of Cyclic Redundancy Check. (Nov 19)
 A cyclic redundancy check (CRC) is an error-detecting code commonly used in
E
digital networks and storage devices to detect accidental changes to raw data.
 In the cyclic redundancy check, a fixed number of check bits, often called a
AC

checksum, are appended to the message that needs to be transmitted.


 Mathematically, data receivers check on the check value attached by finding the
remainder of the polynomial division of the contents transmitted. If it seems that
an error has occurred, a negative acknowledgement is transmitted asking for data
retransmission.
R

 A cyclic redundancy check is also applied to storage devices like hard disks. In
this case, check bits are allocated to each block in the hard disk.
 When a corrupt or incomplete file is read by the computer, the cyclic
G

redundancy error is reported.


24. Find the hamming distance between two pair of code words. A = 01011 B = 11110
(Nov 20)(May 21 )
The Hamming distance between two pair of code words : A = 01011 B = 11110 is 3.
UNIT-II / PART-B
1. Explain various flow control mechanisms. i)Stop Wait protocol ii)Sliding window
protocol (Nov 15,20) (May 17,21)
2. Explain in detail the error detection. (Nov 10,12),(May 12,16)
3. The message 11001001 is to be transmitted, using CRC error detection algorithm.
Assuming the CRC polynomial to be x3+1, determine the message that should be
transmitted. If the second left most bit is corrupted, show that it is detected by the
receiver. (May 13)

Page 9 of 26
https://play.google.com/store/apps/details?id=info.therithal.brainkart.annauniversitynotes&hl=en_IN
CS3591_CN
4931_Grace College of Engineering,Thoothukudi www.BrainKart.com
CS3591-Computer Networks Department of CSE
4. Discuss in detail about the Byte- oriented Protocols (PPP), Bit-oriented Protocols (HDLC)
and SONET. (May 16) (Nov 19)
5. Discuss in detail about the Bit- oriented Protocols.
6. Given a remainder of 111, a data unit of 10110011 and a divisor of 1001, is there an error
in the data unit. Justify your answer with necessary principles. (May 14)
7. How frame order and flow control is achieved using the data link layer? (May 14)
8. i) Explain the challenges faced in building a network.
ii) Obtain the 4-bit CRC code for the data bit sequence 10011011100 using the polynomial
x4+x2+1. (May 17) /Polynomial M(X) = x5+x4+1 generating prime polynomial G(X) =
x3+x2+1 .Generate a 3 bit code, C(X) is to be appended to M(X). (Nov 20) (May 21)
iii) How is a hub related to a repeater? (Nov 20 ) (May 21 )
9. Discuss in detail about the Ethernet. (May 12,15)(Nov 15)
10. Explain CSMA in detail. Describe the CSMA/CD protocol and comment on its
performance for medium access. (May 11,14,17) (Nov 19,21)
11. Explain the functioning of wireless LAN in detail. (Nov 10,12,15)(May 15)

E
12. Explain how hidden node and exposed node problem is solved in IEEE 802.11.(Nov 13)
13. Give the comparison between different wireless technologies? Enumerate 802.11

O
protocol stack in detail.(May 16)
14. Explain the functions of MAC layer present in IEEE 802.11 with necessary diagrams.
(May 17)
15. i)
C
Explain the various connecting devices in detail
ii) Define Bluetooth and explain its architecture in detail. (Nov 21)
16. Two hosts are in a CSMA/CD network and the medium has a data transfer capacity of
E
1Gbps. The minimum frame length is fixed to 1,000 bits and the propagation speed is 2
×10 m/s.) (Nov 20) (May 21 )
AC

17. i) What will be the distance between the hosts?


ii) If it is an Ethernet network, what is the efficiency when the hosts have a maximum
distance between them? If the distance is reduced to 1 m, does it impact the efficiency?
(Nov 20 )(May 21 )
R
G

Page 10 of 26
https://play.google.com/store/apps/details?id=info.therithal.brainkart.annauniversitynotes&hl=en_IN
CS3591_CN
Click on Subject/Paper under Semester to enter.
Environmental Sciences
Professional English and Sustainability -
Professional English - - II - HS3252 Discrete Mathematics GE3451
I - HS3152 - MA3354
Statistics and Theory of Computation
Matrices and Calculus Numerical Methods - Digital Principles and - CS3452
3rd Semester

4th Semester
- MA3151 MA3251 Computer Organization
1st Semester

2nd Semester

- CS3351 Artificial Intelligence


Engineering Graphics and Machine Learning
Engineering Physics - - CS3491
- GE3251 Foundation of Data
PH3151
Science - CS3352
Database Management
Physics for
Engineering Chemistry System - CS3492
Information Science Data Structure -
- CY3151 - PH3256 CS3301

Basic Electrical and


Algorithms - CS3401
Problem Solving and Electronics Engineering Object Oriented
Python Programming - - BE3251 Programming - CS3391 Introduction to
GE3151 Operating Systems -
Programming in C -
CS3451
CS3251

Computer Networks - Object Oriented


CS3591 Software Engineering
- CCS356
Compiler Design - Human Values and
5th Semester

CS3501 Embedded Systems Ethics - GE3791


7th Semester

8th Semester
6th Semester

and IoT - CS3691


Cryptography and Open Elective 2
Cyber Security - Open Elective-1 Project Work /
CB3491
Open Elective 3 Intership
Distributed Computing Elective-3
- CS3551 Open Elective 4
Elective-4
Elective 1
Management Elective
Elective-5
Elective 2
Elective-6
All Computer Engg Subjects - [ B.E., M.E., ] (Click on Subjects to
enter)
Programming in C Computer Networks Operating Systems
Programming and Data Programming and Data Problem Solving and Python
Structures I Structure II Programming
Database Management Systems Computer Architecture Analog and Digital
Communication
Design and Analysis of Microprocessors and Object Oriented Analysis
Algorithms Microcontrollers and Design
Software Engineering Discrete Mathematics Internet Programming
Theory of Computation Computer Graphics Distributed Systems
Mobile Computing Compiler Design Digital Signal Processing
Artificial Intelligence Software Testing Grid and Cloud Computing
Data Ware Housing and Data Cryptography and Resource Management
Mining Network Security Techniques
Service Oriented Architecture Embedded and Real Time Multi - Core Architectures
Systems and Programming
Probability and Queueing Theory Physics for Information Transforms and Partial
Science Differential Equations
Technical English Engineering Physics Engineering Chemistry
Engineering Graphics Total Quality Professional Ethics in
Management Engineering
Basic Electrical and Electronics Problem Solving and Environmental Science and
and Measurement Engineering Python Programming Engineering

You might also like