Scribd
Upload
7 views2 pages

Midterm 1 Summer 2021 1

This document is an examination paper for the CSE 405 Computer Networks course at East West University, detailing the structure and requirements for the Mid Term I Examination for the Summer 2021 semester. It consists of five questions covering topics such as byte stuffing, channel acquisition protocols, contention phases, collision handling, and CSMA/CD protocol analysis. Students are instructed to submit their answers in a specific format and are warned against sharing their responses.

Uploaded by

unfulfilleddreams57
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
7 views2 pages

Midterm 1 Summer 2021 1

This document is an examination paper for the CSE 405 Computer Networks course at East West University, detailing the structure and requirements for the Mid Term I Examination for the Summer 2021 semester. It consists of five questions covering topics such as byte stuffing, channel acquisition protocols, contention phases, collision handling, and CSMA/CD protocol analysis. Students are instructed to submit their answers in a specific format and are warned against sharing their responses.

Uploaded by

unfulfilleddreams57
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/ 2

EAST WEST UNIVERSITY

Department of Computer Science and Engineering


B.Sc. in Computer Science and Engineering Program
Mid Term I Examination, Summer 2021 Semester
Course: CSE 405 Computer Networks
Instructor: Dr. Anisur Rahman, Associate Professor, CSE Department
Full Marks: 30
Time: (50 min + 10 min) = 1 Hour

Note: There are FIVE questions, answer ALL of them. Course Outcome (CO), Cognitive Level and Mark
of each question are mentioned at the right margin.

1. a) Formulate the byte sequence transmitted for the following six-character frame [CO1,C3,
when “Byte stuffing” framing method is used. Please indicate the stuffed Mark: 6]
bytes.

A B Esc Esc Flag Flag

b) Briefly explain how violation is defined in “Physical layer coding violation”


framing method if binary encoding is used to transfer data.

2. Show and Solve which of the following numbered stations will acquire the channel at [CO1,C3,
first if B, C, D, G and H are interested to acquire channel by following “Binary Mark: 6]
countdown” protocol? In general, which stations has the possibility of getting into
starvation in binary count down method.

(A) (B) (C) (D) (E)


011101 011110 011010 010010 011001

(F) (G) (H)


011111 011100 011011

3. What would be the duration of contention phase if contention slot for each host is τ [CO1,C2,
for a 10 hosts LAN where a bit map protocol is followed for channel allocation. If Mark: 6]
the bit map is “1100101011” for the hosts A, B, ……,I,J respectively, how host G is
going keep track of its turn.

4. If number of collision is 4, what would be the elements of sets if ‘binary exponential [CO1,C3,
backoff’ algorithm is used? Illustrate how and when A, B and C will get into Mark: 6]
collision if sets to pick elements from are set={0,1,2,3,4,5,6,7}, set = {0,1,2,3} and
set ={0,1,2, ……………., 14,15} for the hosts respectively.

Page 1 of 2
5. Find and analyze the contention period for the node A when node D is to be [CO1,C3,
considered the destination in the following LAN. Assume the LAN uses CSMA/CD Mark: 6]
protocol for channel allocation purposes, and here propagation distance of τA-D is less
than τA-E.

A B C D E

τA-D
τA-E

Instructions:

a) Write the answers on pages and take pictures of the given answers, make a single pdf file and
upload the file in Google class room within the given time period, late submission will be
penalized.

b) Draw diagrams if deemed necessary.

c) Make sure your answers DO NOT get shared, resemblance will be penalized severely.

Page 2 of 2

You might also like