COLLEGE OF COMPUTING AND INFORMATION SCIENCES

Mid-Term Assessment Fall 2020 Semester

Class Id 104968 Course Title Data Communication & Networks (DCN)
Program BSCS Campus / Shift Main Campus / Morning
Date 20th – October 2020 Total Points 50
Duration 02 hours Faculty Name Dr. Maaz Bin Ahmad
Student Id 9323 Student Name Muhammad Wasim

Instructions:
• Fill out your Student ID and Student Name in above header (MANDATORY).
• Do not remove or change any part of question paper.
• Write down your answers with title “Answer for Question# 00”.
• Answers should be formatted correctly
• Handwritten text or image should be on A4 size page with clear visibility of contents.
• Only PDF format is acceptable for submission
• In case of CHEATING, COPIED material or any unfair means would result in negative marking or
ZERO.
• Caution: Duration to perform Mid-Term Assessment is 02 hours only. Extra 1 hour is given to
cater all kinds of odds in submission of Answer-sheet. Therefore, if you failed to upload answer
sheet on LMS (in PDF format) within 3 hours limit, you would be considered as
ABSENT/FAILED.
///////////////////////////////////////////////////////////////////////////////////////////

Q1.
A) Build a link-state routing table at node-A. Show all the intermediate calculations and a final
routing table. Justify, why shortest path is not always the best path (6)
B) Create a network-graph of your own having x nodes (where x=highest digit in your ID). Use as
many links as you like to interconnect these nodes. Generate a scenario for each of the
followings in case of distance vector routing protocol: (6)

• When a link fails, how other nodes would update their routing table with an alternate
path
• How does the count-to-infinity problem arises in your network
C) Explain how a default route can be implemented in the routing table and how a router does
find a match for it, when it receives a packet. (You may take any 4-5 entries of the routing table
to show the process. (4)
Q2.
A) Suppose the network address given to your organization is 10.10.0.0/8. You are required
to create as many subnets as possible, each must have at-least x hosts/subnets, (where
x= 125* largest digit in your SID) Find the followings: (8)

• Total number of possible subnets

• Subnets addresses
• Valid host ranges and broadcast addresses for each subnet

Show all the calculations neatly within the solution part of the question.
B) Why error detection schemes are mostly preferred over error correction schemes?
Explain with logical reasoning. Describe any 2 practical scenarios where error correction
is preferred over error detection with reasoning. (4)
C) In HDLC, suppose the receiver received the following bit-stream
..1000010111110011110101110000111110100000010101010001111010111111101111
0000101011111000010101110111101111111000110011100011111010001101111110..
Remove all the stuffed bits by highlighting those. How many frames would be received
by the receiver? If there is any error then explain it. (3)

Ans)
..100001011111001111010111000011111010000001010101000111101011111110111
0000101011111000010101110111101111111000110011100011111010001101111110

Green font and yellow highlighted 0s is stuffed bits

Only 1 frame is received by the receiver because we have only one 01111110 in the
data in the end.
We have two error bits in the frame because in the bit stream we can’t have seven
consecutive 1s at a time. And we have two time seven consecutive 1s in given bit
stream.
Q3. A) Generate your own scenario for 2-D parity, showing how a 4-bit error in the data
goes undetected. (Use at-least 4-5 bytes for the scenario) (3)
 B) Suppose you want to design a sliding window mechanism b/w earth and moon
connected via a point-to-point link. Assume the distance b/w earth and moon is (your-
id)*10000, in km and bandwidth available is 106 bits/sec. Speed of light is 3*108 m/sec. The
path MTU is 512 bytes. Determine the followings: (11)
• Timeout value
• Sender window size
• # of bits used for sequence-number of the frames
• What type of media would you use for this scenario, explain with its specifications
C) The flow control mechanism you studied at the layer 2 is sliding window algorithm.
What would happen in your view, if the same algorithm is used at the transport layer for
flow control? What issues may arise (if-any) and how to tackle those issues? (5)