National University of Sciences and Technology (NUST)

School of Electrical Engineering and Computer Science (SEECS)

EE-357: Computer and Communication Networks

Spring Semester 2020
ESE Exam – DL Mode
Total Time: 120 minutes
Name......................... Registration #............................
Program..................... Signature...................................
Instructions:
1. There are a total of 3 main problems of 100 marks in this exam.
3. Please try all the problems and answer precisely [any assumptions should be clearly highlighted and justified].
Understanding the question is part of the exam.
4. There are three parts in this exam. First two parts are to be attempted on LMS while the third part is to be
attempted on paper. A single PDF document [Max Size 150MB] is required to be uploaded on LMS for part 3.
5. This is a closed book and closed notes exam.
6. Anybody found cheating or helping any other in cheating will get his/her paper cancelled.

Date and Time: 19th of August, 14:30 – 16:45

Complete Exam Available on: LMS under EE357 Computer and Communication Networks BEE-9

MS Team Name: Computer and Communication Networks EE 357

MS Team Link:
https://teams.microsoft.com/l/team/19%3a3be94e7064724cd4ab0787b8a03d5e55%40thread.tacv2/conversations
?groupId=282226a2-3f0a-472f-869a-11999f2452bc&tenantId=1511ab2e-502b-4e2d-bd68-f679f549b5a2

Results:
Problem 1 [Time: 14:30 -15:00] on LMS Problem 2 [Time: 15:05-15:35] on LMS Problem 3 [Time: 15:40-16:40] on paper
MCQs [CLO 2] Short Questions [CLO 2] Long Questions [CLO 2]
Total Marks: 30 Total Marks: 25 Total Marks: 45

Total Obtained Marks:

KG Head Course Instructor

Dr. Syed Ali Hassan Dr. Hassaan Khaliq Qureshi

1
Name: ___________________ Reg. # _____________

CLO 2: Problem 3. [45 points] This is Part 3 of the exam

1. Consider a Go-back-N protocol with cumulative acknowledgements that uses

sequence numbers 0-3 and has a window size of 2. Assume that the sender
transmits four packets P0, P1, P2 and P3 and that P1 is discarded before it reaches
the receiver. No other packets or acks are lost. The beginning of this scenario is
shown at right, with the timeout interval shown. Complete the diagram to show all
the acknowledgements and all packet transmissions and retransmissions. Label all
packets and acknowledgements with their sequence numbers. Also, note when
each packet is available to the application at the receiver. Continue the scenario
until all four packets have been delivered and acknowledged for interpretation
[10]

2. Why is Binary Exponential Back-off algorithm used? How is back-off time

calculated for a user that collides once and twice? Why BEB is known to be an
unfair algorithm? Demonstrate. [10]

3. What is the remainder obtained by dividing x7+x5+1 by the generator polynomial

x3+1. Conclude by finding if the bits received are without error or not? [10]

4. For the following topology, categorize the link-state table provided below using
Dijkstra algorithm. Repeat question after adding the following two links to the
above topology: A—D with a cost of 2, and C—F with a cost of 2. [10]

2
5. The diagram below shows a network with 3 routers (shown as hexagons)
connected by an Ethernet switch. The routing table for the left-hand router is
shown. Interpret the routing table for the right-hand router; so that packets will be
delivered appropriately (use no more than 5 route table entries) [5]