0% found this document useful (0 votes)
35 views

Tutorial Sheet 2 (Computer Networks) - 2

This document contains a tutorial on various topics related to computer networks including data encoding schemes (NRZ-L, NRZ-1, Manchester, differential Manchester, B1Q, MLT-3), circuit switching vs. packet switching, calculating propagation delay, packet switching delay for multiple links, throughput calculations for file transfers over networks of different bandwidths, calculating bandwidth where propagation delay equals transmission delay, types of packet switching with examples, and calculating the optimal number of packets to minimize transfer time.

Uploaded by

Areej Ahmad
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
35 views

Tutorial Sheet 2 (Computer Networks) - 2

This document contains a tutorial on various topics related to computer networks including data encoding schemes (NRZ-L, NRZ-1, Manchester, differential Manchester, B1Q, MLT-3), circuit switching vs. packet switching, calculating propagation delay, packet switching delay for multiple links, throughput calculations for file transfers over networks of different bandwidths, calculating bandwidth where propagation delay equals transmission delay, types of packet switching with examples, and calculating the optimal number of packets to minimize transfer time.

Uploaded by

Areej Ahmad
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Tutorial Sheet #02 (Computer Networks)

T1: Draw the graph of the NRZ-L scheme using each of the following data streams:
0101010I ii. 00110011

T2: Draw the graph of the NRZ-1 scheme using each of the following data streams:
1101010I ii. 10110010

T3: Draw the graph of the Manchester scheme using each of the following data streams:
1. 01011101 ii. 00110001

T4: Draw the graph of the differential Manchester scheme using each of the following data
streams:

01100101 ii. 00110101

T5: Draw the graph of the B1Qscheme using each of the following data streams:
i. 0101010101010101 ii. 0011001100110011

T6: Draw the graph of the MLT-3 scheme using each of the following data streams:
01010101 ii. 01011011

T7: Compare and contrast between Circuit switching and Packet switching.
T8: How long does it take a packet of length 1000 bytes to propagate over a link of distance
2500km, propagation speed 2.5x10 m/s, and transmission rate 2 Mbps?
T9: Consider a packet of length 1,500 bytes which begins at end system A and travels over three
links to a destination end system. These three links are connected by two packet switches, the
propagation speed on all the links is 2.5*10 m/s transmission rates of all three links are 2
Mbps, the packet switch processing delay is 3msec, the length of the first link is 5,000 km, the
length of the second link is 4,000 km, and the length of the last link is 1,000 km. For these
values, what is end to end delay?
T10: Suppose Host A wants to send a large file to Host B. The path from Host A to Host B has
three links, of rates RI = 500 kbps, R2 = 2 Mbps, and R3 =1 Mbps.
a. Assuming noother traffic in the network, what is the throughput for the file transfer?
b.Suppose the file is 4 million bytes. Dividing the file size by the throughput, roughly how long
will ittake to transfer the file to Host B?
c. Repcat (a) and (b), but now with R2 reduced to 100 kbps.
TIl:Consider a point to point link 50km. in length. At what bandwidth would propagation delay
(at a speed of 2*10* m/s) equal totransmit delay for 100 byte packets?
1/2
T12: What are the different types of Packet switching? Explain them with diagram and suitable
example.
T13: Here is a network having bandwidth of 1MBps. A message of size 1000 bytes has to be sent.
The packet switching technique is used. Each packet contains a header of 100 bytes. On the
following, in how many packets the message must be divided so that total time taken is minimum?
(propagation delay is ignored here).
A
a. 1Packet
b. 5 Packets
C. 10 Packets

d. 20 Packets

Calculate Total time taken for each case.

2/2

You might also like