COMSATS University Islamabad

Sahiwal Campus
(Department of Computer Science)
Terminal Examinations Fall-2020
Course Title: CCN/DCCN Course Code: CSC339 Credit Hours 4
Course Instructor Mr. Zafar Iqbal Roy Programme Name BSSE, MCS
Semester 5th, 3rd Batch: B10, B15 Section: A+B, - Date 04-01-2021
Time Allowed 180 Minutes Maximum Marks 30
Student’s Name Reg. No. CUI/ /SWL
Important Instructions / Guidelines:
Read the question paper carefully and answer the questions according to their statements.
Mobile phones are not allowed. Calculators must not have any data/equations etc. in their memory.

Subjective Part
Q.1
a) What is the responsibility of the Data Link layer as well as state the name of devices, protocols,
naming convention of the data on each Network Layer and Data Link layers.? Marks:
3.5
b) State the names of the network collision detection protocols as well as state the advantages of the
Slotted Aloha over Pure Aloha. Marks:
3.5
Q.2
a) What are the parallels or resembles of Network Layer connection and connectionless services
with the Transport Layer connection-oriented and connectionless services? Show the working or
steps involves in Virtual Circuits and Datagram Networks using schematic diagrams.
Marks: 3.5
b) What is the high-level view of a generic router architecture and discuss the various switching
fabric techniques using suitable diagrams.
Marks: 3.5
Q.3
a) Suppose the information content of a packet is the bit pattern 1100 0011 0110 1001 and an even
parity scheme is being used. What would the value of the field containing the parity bits be for the
case of a two-dimensional parity scheme? Your answer should be such that a minimum-length
checksum field is used.
Marks: 3.0
b) State and differentiate the various approaches to detect the errors, if the original message is
1010101010 with generator polynomial is X4 +X1 + 1 then show the working of the CRC. Marks: 5.0
Q.4
a) What is the difference between Forwarding and Routing, state and describe in brief all the
possible ways to Classify the Routing Algorithms? Marks:
0.5+1.5
b) What the purpose of Dijkstra algorithm, compose its algorithm as well as using Dijkstra’s
algorithm, find the shortest path between nodes A and E. List the hops or links (node tuples) in the
order that they are added by the algorithm. Also mention the shortest path. Marks:
0.5+2.0+2.5+1.0

Page 1 of 2
<<<<<<< Best of Luck >>>>>>>

Page 2 of 2