2018 Scheme 1 N T

ANSWER SCHEMA - MID SEMESTER EXAMINATION-II

Course Title with COMPUTER NETWORKS / 18CS51 Maximum Marks 30 Marks

code
Date and Time 31/12/2021 / 9:30AM -10:30AM No. of Hours 1.0
Course Instructor(s) MS. SOWMYA M. R. /MS. DEEPTHI SHETTY
Instructions to Students
1. Answer any two full questions.
2. Any missing data may assume suitably.

MAX PO/P
Q. B
Question MARK CO
L
SO
No S
1. a 2 4 L 1
3

Role of Syndrome bit:

• The remainder is generated after dividing the Data-word
appended with (r-1) 0s with the shared divisor, where ‘r’ is the
number of bits in the Divisor.
• The remainder bits are replaced in the place of appended 0s in
the Data-word and transmitted.
• The receiver divides the codeword with the shared same divisor
and generates the remainder bits, which are the Syndrome bits. 2
• If the Syndrome bits are 0s then it indicates that there is no
error. If the Syndrome bits are not 0s indicates the Data sent is
corrupted.

Simulation using the Fletcher 8-bit algorithm to calculate the checksum

of the following bytes: (2B)16, (3F)16, (6A)16, and (AF)16.
HEX DEC R=0 L=0
2B 43 43 43
3F 63 106 149
6A 106 212 105
AF 175 131 236 2
CHECKSUM = (L*256) + R
= (236*256) + 131
= (60547)10
= (EC83)16
2

Page 1 of 3
2018 Scheme

1. b Controlled Access protocols: 1 2 L 1,2

Reservation: ‘N’ Mini slots for ‘N’ stations. 2

Polling:
Select and Poll functions
2

Token Passing
- Each station has a predecessor and a successor.
- A special packet called token circulates in the ring. 2
- The station that wants to send data should access the token
and transmits data.
- Once the data is transmitted completed the node releases
the token.
2. a Frame sent by station ‘A’ and ‘B’ collide at 25 μs. 3 L 1
It takes another 25 μs for the collision information o reach both 1 3
stations. (that is at 50 μs the signal is received by both stations).

Station ‘A’ chooses R=0 and waits for R*2Tfr = 0*240 μs = 0. 2

Hence station ‘A’ immediately retransmits and the frame takes Tp = 50
μs to reach ‘B’, (that is at 100 μs the frame reaches ‘B’).

Station ‘B’ has chosen R=1 and hence waits for R*2Tfr = 1*240 μs = 2
240+50 =290 μs to retransmit.

With this it is clear that the Retransmitted frames from ‘A’ and ‘B’ do 1
not collide second time and are successfully transmitted.
The Random number chosen has avoided the collision.
Diagram ------------------------------------------------------------------------- 2

2. b The two data-words transmitted are: 4 L 1,2

10101111011111100110111101110 2 3
100101100111111 2
In Bit oriented protocol: The FLAG Byte is 01111110
The technique is: Append a ‘0’ bit after every 5 consecutive 1s.
Unstuff the ‘0’s appended after every 5 ‘1’s since that bit an extra bit
stuffed in order to differentiate between FLAG byte and actual data
with the FLAG pattern.
Also, unstuff the FLAG Bytes at the end and beginning of the data 3
words.

Page 2 of 3
2018 Scheme

3. a Slotted ALOHA. 2 3 L 1
3

There is still a possibility the trains will collide if more than one train start at
the same scheduled time.

Vulnerable time = Tfr.

Throughput:

3. b A computer sends out a frame using one of the bit-oriented protocols 3 L 1

used for communication over point-to-point and multipoint links. The 3
following frame is received by the receiver computer as below:
01111110 00001100 10100011 1011011001110110 01111110.
Identify:
i. 01111110 – FLAG 1
00001100 – Address
1011011001110110 – CRC
10100011 – Control

ii. 10100011 – Control

Secondary station is sending the data because the P/F bit is 0. 2
iii. S-frame: Receive Not Ready (RNR) - Supervisory frame – used
for flow and Error control. 2
iv. NAK number is sent by receiver to inform about the congestion
and also to indicate it is busy. 2

Faculty Signature Course Coordinator/Mentor HoD Signature

Signature

MS. SOWMYA M. R./ MS. DR. DILEEP REDDY BOLLA DR. SAROJADEVI H.
DEEPTHI SHETTY

Page 3 of 3