Demir ner-Computer Networks-Review Questions and Problems

Issue-3

COMPUTER NETWORKS
REVIEW QUESTIONS AND PROBLEMS

1.

INTRODUCTION TO COMPUTER NETWORKS

1.1

What is a computer network? Briefly define.

1.2

Briefly define the client-server model.

1.3

What is scalability? Briefly define.

1.4

Classify computer networks with respect to their transmission technologies.

1.5

Classify computer networks with respect to their physical sizes.

1.6

Write the names of LAN topology types and draw their figures.

1.7

Draw the bus topology types and write their names.

1.8

Briefly explain the access methods used in broadcast networks. (BA--14/14.05.97/AS/2a)

1.9

Write the type (broadcast or point-to-point) and topology (bus, ring or star) of computer networks that
use terminating resistors. What does proper termination mean? What problem is encountered if proper
termination is not provided? (CSE-5/31.01.05/FS/1)

1.10 Briefly explain why the transmission time of a frame in LANs using CSMA/CD protocol should be
greater than the round-trip propagation time (2).
1.11 Consider building a CSMA/CD network running at 10 Mbps with a network cable of 2500 meter
(consisting of five network segments each having a length of 500 meter and connected by using four
repeaters). Considering the delays in the repeaters, the average signal speed in the network cable is
97.65625 m/sec. Calculate the minimum frame length in bytes, so that when a collision occurs,
computers can determine that the collision is related to the frame being sent (1 byte=8 bits).
Answer: 64 bytes. (BA-EE-11/08.04.2002/AS/4)
1.12 Briefly answer the following questions about WANs:
a) Specify the physical sizes of WANs.
b) Write the name of the transmission method used in WANs.
c) Write the name of the switching technique that is generally used in WANs.
d) What are the components of a subnet? Write their names.
e) What is the difference between a WAN and a subnet?
f) Write the name of the first network that used the TCP/IP protocol.
(e,f: BA--14/28.06.00/BS/1d)
1.13 (Extra Qestion)
Consider building a CSMA/CD network running at 1 Gbps with a frame size of 625 bytes. The signal
speed in the network cable is 200 000 km/sec. No repeaters are used in the network. What is the
maximum cable length? (Answer: 500 m). (CSE-2/24.12.04/1MT/4)
1.14 (Extra Question)
Briefly answer the following questions about terminating resistor.
a) Which type (transmission type) and which topology of computer networks use terminating resistors?
b) How is the value of the terminating resistor chosen for proper termination?
c) What problem is encountered if proper termination is not provided?
1/18

Demir ner-Computer Networks-Review Questions and Problems

Issue-3

2.

BASICS OF NETWORK ARCHITECTURE

2.1

What is network architecture? Briefly define. (BA--22/17.05.00/ASM/1a)

2.2

Briefly define protocol and peer protocol. Write the names of the peer protocols in the OSI
reference model. (BA--1/14.05.97/AS/2b)

2.3

What is service data unit (SDU)? Briefly define. (BA--23/31.05.00/FS/1e)

2.4

What is protocol data unit (PDU)? Briefly define. (BA--22/17.05.00/ASM/1b)

2.5

Briefly define the connection-oriented service and the connectionless service; write their advantages
and disadvantages. (BA--1/14.05.97/AS/1b)

2.6

By using only three of the proper terms among Connection-oriented, connectionless,

acknowledged, unacknowledged, communication channel, circuit switching service and packet
switching service, define the following:
a) Virtual circuit
d) Datagram service
(BA--14/28.06.00/BS/1c)

2.7

Write the names of the service primitives, and explain the transfer of these primitives by drawing a
figure. (BA--1/14.05.97/AS/2a)

2.8

Which service primitives are used in confirmed and unconfirmed services? Write their names.
(BA--14/27.04.99/1AS/1b)

2.9

Which service type (confirmed service/unconfirmed service/confirmed or unconfirmed service/none of

these services) can be used for each of the following phases of a connection-oriented communication
service?
a) Circuit establishment phase
b) Data transfer phase
c) Circuit release (termination) phase
(BA--5/27.04.98/1AS/1b)

2.10 Briefly explain why acknowledged datagram service is not used real-time digital voice or digital video
communication. (BA--5/27.04.98/1AS/1c)
2.11 Draw the OSI and TCP/IP models side by side, and write the layer numbers and names.
2.12 Write the name of the 2nd layer of the OSI reference model and write six of its tasks.
(BA--3/15.07.97/BS/1a)
2.13 Write the name of the 3rd layer of the OSI reference model and write its tasks. (BA--1/14.05.97/AS/1a)
2.14 Network devices generally functions at the lower three layer of the OSI reference model. Briefly explain
the reason.
2.15 Write three advantages of network standardization and mention about two aspects that can be seen as
disadvantages of network standardization. (BA--6/27.04.98/1AS/2a)
2.16 Briefly answer the following questions about ITU-T:
a) Write the full name of ITU-T and its field of interest.
b) Write the classes of ITU-Ts memberships.
c) Is it a must for the manufacturers to comply with the ITU-Ts recommendations? What can be the
consequences if these recommendations are not fulfilled? (BA--21/26.04.00/AS/3)
2.17 Write the full name and memberships of ISO. (BA--12/26.04.00/3a)
2/18

Demir ner-Computer Networks-Review Questions and Problems

Issue-3

3.

BASICS OF DATA TRANSMISSION

3.1

The binary signal at the output of a computer is shown in Figure 3.1(a). A character consisting of eight
bits is transmitted in 100 sec. The frequency characteristics of the transmission medium and the
amplitude spectrum of the transmitted binary signal are given in Figure 3.1 (b) and (c) respectively.
Using the amplitude and frequency values given in Figure 3.1,
a) Find the fundamental frequency (1st harmonic frequency) of the binary signal.
b) Find the bandwidth (Bt) of the transmitted binary signal by considering the frequency components
with amplitudes greater than or equal to 1/10 of the amplitude of the 1st harmonic.
c) Find the transmission rate (R) of the binary signal.
d) Find the 3-dB bandwidth of the transmission medium.
e) Find the bandwidth (Br) of the received signal.
f) Which harmonic is the highest frequency component of the binary signal arrived at the receiver?
|H(f)|

f(t) 1 0 1 0 1 0 1 0

1
0.707

0
0

t (s)

T = 100 s

60 70

f(kHz)

(b) Characteristics of the transmission medium.

(a) Transmitted signal.

Cn

3 dB

0.79
0.33

0 10

0.20

30

0.14

50

0.11

70

0.09

90

110

0.08
130

0.07

0.06
150

170 f (kHz)

(c) Amplitude spectrum of the transmitted signal.

Figure 3.1

(BA--2/01.07.97/FS/1)
Answer: (a) 10 kHz; (b) 90 kHz; (c) 80 kbps; (d) 60 kHz; (e) 50 kHz; (f) 5th harmonic.
3.2

A digital communication is performed by using a four-symbol alphabet (a four-symbol signal). Each

symbol is transmitted in symbol duration of 10 sec. The probabilities the symbols to be sent are given
as follows:
P1=1/2 ; P2=1/4 ; P3=P4=1/8
a) Find the symbol rate of the signal.
b) Find the average information content of the signal per symbol interval.
c) Find the minimum bandwidth and minimum channel capacity required for the transmission medium
in order to send this message with small probability of error.
d) Consider that, by using a binary encoder, the four-symbol signal is converted into a binary signal and
transmitted as a binary signal. Repeat part (c) for this case.
Auxiliary information: H =

P log ( P ) bits/interval
k =1

(BA--21/26.04.00/AS/4)
Answer: (a) 100 000 symbols/sec; (b) 1.75 bits/symbols; (c) 100 kHz, 175 kbps; (d) 200 kHz, 175 kbps.
3.3

In a facsimile transmission, 420,000 picture elements are needed for one page to provide proper picture
resolution. 16 brightness levels are specified for each picture element for good reproduction. Consider that
the modem circuit of the facsimile machine operates at the rate of 9600 bps.
a) Find the maximum information content of one page of fax message.
b) How long does it take to send one page of fax message?
(BA-EE-1/26.04.00/AS/4)
Answer: (a) 1 680 000 bits/page; (b) 2.92 minutes (or 2 minutes 55 seconds).
3/18

Demir ner-Computer Networks-Review Questions and Problems

3.4

Issue-3

An analog voice signal band limited to 4 kHz is sampled at Nyquist rate and then quantized at 256
levels.
a) Find the sampling rate fs and the sampling interval Ts.
b) Assuming the equally likely case (each level appears with equal probability), find the information
content (H) per interval (sample interval).
c) The output of the 256-level quantizer is applied to a binary encoder to obtain a PCM signal. Find the
information rate of the PCM signal.
d) What must be the minimum value of the channel capacity in order to transmit the PCM signal with
arbitrarily small frequency of errors?
(BA--14/27.04.99/1.AS/3)
Answer: (a) 8 kHz, 125 sec; (b) 8 bits/interval; (c) 64 kbps; (d) 64 kbps.

3.5

In a digital communication system a 32 symbol signal is used in transmission. Each symbol is

transmitted in a 5 sec time slot with equal probability.
a) Calculate the symbol rate of the 32 symbol signal.
b) Calculate the information content of a symbol.
c) Calculate the required bandwidth (in kHz) and the capacity (in kbps) of the transmission medium to
transmit the 32 symbol signal.
d) Consider that the 32 symbol signal is applied to a binary encoder and a binary signal is obtained at
the output of the encoder. Calculate the required bandwidth (in kHz) and the capacity (in kbps) of the
transmission medium to transmit the binary signal.
(BA--3/15.07.97/BS/2)
Answer: (a) 200 000 symbols/sec; (b) 5 bits/symbol; (c) 200 kHz, 1 Mbps; (d) 1 MHz, 1 Mbps.

3.6

In a digital communication system a 64 symbol signal is used in transmission. Each symbol is

transmitted in a 50 sec time slot with equal probability.
a) Calculate the symbol rate of the signal.
b) Calculate the information content of a symbol.
c) Calculate the required bandwidth (in kHz) and the capacity (in kbps) of the transmission medium to
transmit the signal.
(BA--17/23.06.99/FS/2)
Answer: (a) 20 000 symbols/sec; (b) 6 bits/symbol; (c) 20 kHz, 120 kbps.

3.7

Compare serial and parallel transmission with respect to the following attributes:
1) Transmission speed (fast/slow)
2) Length of transmission cable (long/short)
3) Cost of transmission cable (high/low)
4) Cost of transmission hardware (high/low)
(BA--13/31.05.00/FS/1e)

3.8

(Extra Question):
Briefly compare the synchronous and asynchronous transfer modes in the following aspects:
a) Which one is suitable for constant bandwidth channels and which one for variable (or dynamic)
bandwidth channels?
b) Which one is subjected to waste of bandwidth and which one uses the bandwidth efficiently?
(CN/S-2/01.06.00/FS/1d)

3.9

(Extra Question):
A channel is given with a bandwidth of 30 kHz and a Signal-to-Noise Ratio (SNR) of 40 dB. For error
free transmission the Shannons channel capacity formula is known as C=Blog 2 (1+SNR). Calculate
the channel capacity.
(CSE-2/24.12.04/1MTE/3)
Answer: 400 kbps

4/18

Demir ner-Computer Networks-Review Questions and Problems

Issue-3

3.10 (Extra Question):

A signal band-limited to 3.3 kHz is sampled.
a) Find the Nyquist sampling rate and the Nyquist sampling interval.
b) Find the minimum sampling rate and sampling interval when a guard band of 1.4-kHz is used in the
sampling.
(CSE-1/22.11.04/1MT/3)
Answer: (a) 6.6 kHz; 151.5 sec; (b) 8 kHz; 125 sec.
4.

DATA COMMUNICATION SERVICES

4.1

For each of below items, specify which feature belongs to SMDS (Switched Multimegabit Data Service).
1) Connection-oriented / Connectionless.
2) Circuit-switched / Packet-switched.
3) Is SMDS is suitable for busty traffic? Yes or no.
4) Is the mean transmission rate is greater than the burst mode rate? Yes or no.
5) Is SMDS is cheaper than leased lines? Yes or no.
6) Can subscribers access SMDS over MANs? Yes or no.
7) Can subscribers access SMDS over leased lines? Yes or no.
8) Does SMDS have multicasting feature? Yes or no.
9) Does SMDS use permanent virtual circuits? Yes or no.
10) If an SMDS subscriber has 1500 byte credit in his counter and he sends a 2000-byte packet, does SMDS
discard the whole packet? Yes or no.
(BA--21/26.04.00/AS/2)

4.2

In an SMDS network with a channel capacity of 45 Mbps, consider a subscriber with a counter
increment rate of one byte in 10 sec.
a) For continuous data transmission,
a1) Calculate the average data transmission rate,
a2) Calculate the transmission time of a 5625-byte packet.
b) Consider that the subscriber doesnt send any data for a while, and thus 5625-byte credit is
accumulated in its counter. At this moment the subscriber sends a 5625-byte packet.
b1) Calculate the transmission time of the packet that is sent in burst mode.
b2) Compare the results obtained in (a1) and (b1). How many times transmission rate is
increased when the packet is sent in burst mode.
b3) How many bytes of credit are left on the counter just after the packet is sent?
(BA--6/27.04.98/1.AS/3)
Answer: (a1) 800 kbps; (a2) 56.25 msec; (b1) 1 msec; (b2) 56.25 times; (b3) Zero credit is left.

4.3

In an SMDS network with a channel capacity of 45 Mbps, consider a subscriber with a counterincrement rate of 50000 bytes/sec.
a) In order to transmit a 5000-byte data block in burst mode, how long the subscriber should stay in idle
mode? If the subscriber sends a 5000-byte packet before the end of this duration, what operation
does the router make on this packet?
b) If the subscriber does not send data for 45 msec, how many bytes of data is the subscriber allowed to
send in burst mode? How long does it take to send this data in burst mode?
(BA--22/17.05.00/ASM/3)
Answer: (a) 100 msec; packet is discarded; (b) 2250 byte; 400 sec.

4.4

Compare Narrowband-ISDN and Broadband-ISDN for the following features:

a) Transmission capacity (give values in terms of kbps and Mbps),
b) Switching type (circuit-switching, packet-switching),
c) Transmission type (synchronous, asynchronous).
(BA--23/31.05.00/FS/1d)

5/18

Demir ner-Computer Networks-Review Questions and Problems

Issue-3

4.5

For the basic access ISDN,

a) Write the names and the capacities of the channels used for communication and for signaling.
b) At the maximum, how many ISDN terminal equipments can be connected to the S interface? How
many of them can make communication at the same time? Specify the channels for the type of
communication service (telephone, telefax, PC, short message, etc).
(BA--15/08.06.99/2.AS/2c)

4.6

Briefly define bearer services, teleservices and supplementary services in ISDN.

(BA--1/14.05.97AS/4)

4.7

Briefly answer the following questions about ISDN:

a) For a basic access ISDN subscriber, draw a block diagram showing the access of ISDN terminal
units and non-ISDN terminal units to the ISDN exchange. Show the S and U interfaces on your block
diagram. Write the number of wires used at these interfaces.
b) For a basic access ISDN subscriber, what is the maximum access rate (in kbps) of a PC with an
ISDN communication card (ISDN modem) to the Internet? Which ISDN channels are used for this
access?
c) Which layers of OSI reference model is included in an ISDN in the network?
(BA--10-1/17.09.98/BS/2)

4.8

In a basic access ISDN, a data frame in the data link layer contains 16 bits for B1 channel, 16 bits for B2
channel, 4 bits for D channel and 12 bits for framing and control. The time required to transmit one frame
is 250 s. By using these figures,
a) Calculate the channel capacities of B1, B2 and D channels in terms of kbps. Show how they are
calculated. Dont write the results by heart.
b) Calculate the transmission rate (in terms of kbps) and bandwidth (in term of kHz) of this signal.
c) This binary signal is applied to an M-ary encoder with M=8 (that is, three successive bits are encoded
as one symbol). Find the symbol rate and the bandwidth of the signal at the output of the M-ary
encoder.
(BA--3/15.07.97BS/2)
Answer: (a) 64 kbps for B1 and B2; 16 kbps for D; (b) 192 kbps, 192 kHz; (c) 64 ksymbols/sec, 64 kHz.

4.9

A basic access ISDN subscriber has the following equipment:

3 ISDN telephone sets
1 ISDN fax machine
1 PCs (Personal Computers) with ISDN card installed
3 non-ISDN Terminal Equipment (non-ISDN telephone or non-ISDN data terminal)
3 ISDN Terminal Adaptors (TA)
1 Network Termination Unit of type 1 (NT1)
Draw a block diagram showing the connection of this equipment to an ISDN exchange. Show the
reference points R, T (or S) and U on the block diagram.
(BA--6/27.04.98/1.AS/4a)

4.10 Define briefly adaptation and internetworking in ISDN.

(BB--12/26.04.00/AS/2b)
4.11 Briefly answer the following questions about the Frame Relay (FR) technique.
a) Define the FR technique by specifying its service type and in important feature.
b) Compare an FR network with an X.25 network from the aspects of error detection, error correction
and performance.
c) Draw a block diagram showing the access of a PC to a FR network.
(BA--9/18.06.98/FS/1)

6/18

Demir ner-Computer Networks-Review Questions and Problems

Issue-3

4.12 Which of the following properties belongs to a Frame Relay service? Specify for each item.
1) Acknowledged / Unacknowledged.
2) Connected-oriented / Connectionless.
3) Circuit-switched / Packet-switched.
4) Slow / Fast.
5) Virtual circuits are used / Virtual circuits are not used.
6) Composed of OSI layers 1 and 2 / Composed of OSI layers 1, 2 and 3.
7) Performs frame routing in the network / Performs packet routing in the network.
8) The network performs error detection (at NNI) / The network does not perform error detection (at NNI).
9) The terminal equipments perform only error detection (at UNI) / The terminal equipments perform
both error detection and error correction (at UNI).
10) Cheaper than leased lines / More expensive than leased lines. (BA-EE-1/26.04.00/AS/4)
4.13 Briefly answer the following questions about ATM (Asynchronous Transfer Mode) technique.
a) Describe the ATM technique in one sentence by specifying the following properties:
1) Service type: Connection-oriented / Connectionless.
2) Transmission type: Synchronous / Asynchronous.
3) Transmission speed: Low speed / High speed.
4) Switching type: Circuit switched / Packet switched.
b) Draw an ATM cell showing the header and the data field and their lengths in terms of bytes.
(BA--14/27.04.99/1.AS/2)
4.14 (Extra question):
Consider an SMDS (Switched Multimegabit Data Service) network operating at 100 Mbps. The counter
of an SMDS subscriber, which resides in the router to which the subscriber is connected, increments one
byte in 10 sec.
a) If the subscriber transmits data continuously,
(1) Calculate the average data transmission rate.
(2) Calculate the required time to transmit a 4000-byte packet.
b) Suppose that the line is idle for a period of time, and the user sends a data of 4000 bytes at the end of
this period. Calculate the transmission time for the 4000-byte data in burst mode. Compare the
results obtained in (a) and (b). How many times the burst mode transmission is faster than the
continuous mode transmission?
(BA--14/27.04.99/1.AS/4)
Answer: (a1) 800 kbps; (a2) 40 msec; (b) 320 sec; 125 times faster.
4.15 (Extra Question):
An SMDS (Switched Multimegabit Data Service) network operating at 45 Mbps is used for LAN-toLAN traffic. A subscriber of this SMDS network having a contract for an average transmission rate of
10 000 bytes/sec wants to send data. If the line is idle for a period, a credit (in terms of bytes) will be
accumulated on the subscribers counter at the router and the subscriber will be allowed to send an
amount of data equal to or less than the counter reading in burst mode.
a) Calculate the transmission time required to transfer a 4500 byte data to the transmission medium for
continuous transmission case.
b) Suppose that the line is idle for a period of 500 msec, and the user sends a data of 4500 bytes at the
end of this period. Calculate the transmission time for the 4500 byte data in burst mode.
c) Compare the results obtained in (a) and (b). How many times the burst mode transmission is faster
than the continuous mode transmission?
d) Briefly explain what happens if the user sends a data of 5500 bytes at the end of a 500 msec idle
period.
(CN/S-3/30.04.01/MT/4)
Answer: (a) 450 msec; 0.8 msec; (c) 562.5 times faster; (d) Data is discarded by the router.

7/18

Demir ner-Computer Networks-Review Questions and Problems

Issue-3

4.16 (Extra Question):

Which of the following teleservices may be offered over the B, H and D channels in narrowband ISDN?
Specify.
(1) Packet data communication (64 kbps-2 Mbps)
(8) Alarms
(2) Teleconference
(9) Facsimile
(3) Packet data communication (at 9.6 kbps)
(10) Packet data communication (at 64 kbps)
(4) Telemetering
(11) Signaling
(5) Videophone
(12) User info (short user messages)
(6) Videoconference
(13) Remote control
(CSE-3/27.12.04/2MT/2)
(7) Telephone
4.17 (Extra Question)
Which of the following properties belongs to an ATM (Asynchronous Transfer Mode) service? Specify for
each item.
(1) Service type: Connection-oriented service / Connectionless service / Both.
(2) Switching type: Circuit switching / Packet switching / Both.
(3) Transmission rate is suitable for: Only wide-band data transmission / Only narrow-band data transmission
/ Both.
(4) Cell length: Constant / Variable depending on transmission rate / Variable depending on the length
of data field.
(5) Error correction on the data field is performed by: The ATM layer / The TC (Transmission
Convergence) sublayer / The upper layers.
(6) Header error control is performed by: The ATM layer / The TC sublayer / The AAL (ATM Adaptation
Layer).
(7) Congestion control is performed by: The AAL / The ATM layer / The upper layers.
(8) Flow control is performed by: The AAL / The ATM layer / The TC sublayer.
(9) Virtual path and virtual channel management is performed by: The ATM layer / The AAL / The TC
sublayer.
(10) Cell rate adaptation is performed by: The CS (Convergence Sublayer) / The ATM layer / The TC
sublayer.
(CSE-3/27.12.04/2MT/3)
5.

PHYSICAL LAYER

5.1

Briefly answer the following questions about the RS-232-C interface.

a) Draw a block diagram showing the place of RS-232-C interface in the communication of two
computers over the telephone network. Show the DTE and DCE units on your block diagram and
briefly define these units.
b) For a 25-pin RS-232-C interface, specify which unit (DTE or DCE) activates the following pins:
Pin Nr.
Pin Name
Abbreviation
20
Data Terminal Ready
DTR
6
Data Set Ready
DSR
4
Request to Send
RTS
5
Clear to Send
CTS
22
Ring Indicator
RI
c) Compare the balanced and unbalanced transmission methods with regard to the type of signal
grounds and performances of the interfaces. (BA--9/22.04.99/1AS/2)

5.2

What is null modem? Briefly define. Between which units the null modem is used? Which type of
transmission (series or parallel; synchronous or asynchronous) does it use? Which type of connector
does it use?

5.3

(Extra question)
Put into order the following transmission mediums with regard to increasing probability of creating
transmission errors: Coaxial cable, fiber optic cable, the atmosphere (for radio waves), twisted pair
cable.

8/18

Demir ner-Computer Networks-Review Questions and Problems

Issue-3

6.

DATA LINK LAYER

6.1

In a data link layer, character-oriented framing and character stuffing method is applied. In this method,
FLAG characters are used as the starting and ending delimiter.
a) At the sender, if the character string delivered by the network layer to the data link layer is given as
follows, obtain the character string at the data field of the senders data link layer frame.
A B FLAG ESC C ESC D E F FLAG G
b) At the receiver, if the character string at the data field of the receivers data link layer frame is given as
follows, obtain the character string that will be delivered by the data link layer to the network layer.
ESC FLAG A ESC ESC B C ESC FLAG ESC ESC
Caution: Note that (a) and (b) are independent.

6.2

In the data link layer of a computer network, bit-oriented framing and bit stuffing method is applied.
Assuming that 01110 bit string is used as the starting and ending delimiter,
a) At the sender, if the bit string delivered by the network layer to the data link layer is given as
follows, obtain the bit string at the data field of the senders data link layer frame.
10111111001110001111
b) At the receiver, if the bit string delivered by layer 1 to layer 2 is as follows, obtain the bit string
before bit stuffing.
011100010100110011011000110011010001110
Caution: Note that (a) and (b) are independent.
(BA--1/14.05.97/AS/3)

6.3

In the data link layer of a computer network, bit-oriented framing and bit stuffing method is applied.
Assuming that 01111110 bit string is used as the starting and ending delimiter,
a) At the sender, if the bit string delivered by the network layer to the data link layer is given as
follows, obtain the bit string at the data field of the senders data link layer frame.
01111111011110011111
b) At the receiver, if the bit string at the data field of the receivers data link layer frame is given as
follows, obtain the bit string that will be delivered by the data link layer to the network layer.
11111001111101011110
Caution: Note that (a) and (b) are independent.
(BA--8/12.06.98/2MS/2)

6.4

Write the link utilization formula for the stop-and-wait protocol in terms of Tf (frame transmission time)
and Tp (propagation time). Briefly define these parameters.
(BA--11/23.06.99/FS/1d)

6.5

Write the Link Utilization formula for the sliding window protocol with N frames per window in
terms of Tf (frame transmission time) and Tp (propagation time). Briefly define these parameters.

6.6

Two computers are communicating over a 60000 km satellite link by using 4000-bit frames at a
transmission rate of 100 kbps. Assuming errorless transmission, and taking the signal speed as 2108
m/sec,
a) Calculate the time required to transmit a frame (time for the transmitter to send out all of the bits of
the frame).
b) Calculate the link utilization for the stop-and-wait protocol.
c) Calculate the window size (in terms of frames) for the sliding window protocol in order to have
100% link utilization?
(BA--8/12.06.98/2MS/3)
Answer: (a) 40 msec; (b) 6.25 %; 16 frames:
9/18

Demir ner-Computer Networks-Review Questions and Problems

Issue-3

6.7

Two computers are communicating over a 10 km fiber optic link by using 500-byte frames at a
transmission rate of 100 Mbps. The propagation speed as 2108 m/sec. Assuming errorless transmission,
a) Calculate the transmission time required to transfer one frame to the transmission medium.
b) Calculate the link utilization (U) for the stop-and-wait protocol.
c) Calculate the link utilization (U) for the sliding window protocol for a window size of 7 frames.
(BA--7/28.05.98/2.AS/3)
Answer: (a) 5 sec; (b) 4.76 %; (c) 33.3 %.

6.8

Two computers are communicating over a 3000 km fiber optic link by using 1500-byte frames at a
transmission rate of 1 Mbps. The propagation speed as 2108 m/sec. Assuming errorless transmission,
a) Calculate the transmission time required to transfer one frame to the transmission medium.
b) Calculate the link utilization (U) for the stop-and-wait protocol.
c) Calculate the window size (in terms of frames) for the sliding window protocol in order to have
100% link utilization?
(BA--15/08.06.99/2AS/3)
Answer: (a) 1.5 msec; (b) 4.76 %; (c) 21 frames.

6.9

Two computers are communicating over a 39000 km satellite link by using 1920-bit frames at a
transmission rate of 64 kbps. The propagation speed as 2108 m/sec. Assuming that no error occurs in
transmission,
a) Calculate the transmission time required to transfer one frame to the transmission medium.
b) Calculate link utilization (U) for stop-and-wait protocol.
c) Calculate the window size for the sliding window protocol in order to have %100 link utilization.
(BA--23/31.05.00/FS/2)
Answer: (a) 30 msec; (b) 7.1 %; (c) 14 frames.

6.10 In the figure shown below, frames are generated at node A and sent to node C through node B.
Determine the minimum transmission rate required between nodes B and C so that the buffers of B are
not flooded, based on the following assumptions:
Assumptions:
1. The data rate between A and B is 100 kbps.
2. The propagation delay is 10 sec/km for both lines.
3. There are full-duplex lines between the nodes.
4. All data frames are 1000 bits long; ACK frames are separate frames of negligible length.
5. Between A and B, a sliding window protocol with a window size of 5 is used.
6. Between B and C, stop-and-wait is used.
7. There are no transmission errors.

2000 km

250 km

Hint: In order not to flood the buffers of B, the average number of frames entering and leaving B must
be the same over a long interval.
(BA--9/18.06.98/FS/4)
Answer: RBC = 200 kbps.

10/18

Demir ner-Computer Networks-Review Questions and Problems

Issue-3

6.11 Go-back-N sliding window protocol is used between the data link layers of machines A and B with a
window size of 7 frames at both sides. The figure below shows the a0 and b0 states of the sliding
windows of machines A and B, respectively, just before Frame 2 is sent by A. The same figure also
shows the sequence numbers of the frames sent by A and acknowledgements sent by B.
a) Indicate the frame numbers that should be contained in the sliding windows and buffer memories at
the sender and receiver for the states a1, b1, a2, b2, a3, b3, a4, b4,a5, b5, and b6.
Machine B

Machine A
(a0)

0 1 2 3 4 5 6 7 0 1 2 3 4 5 6 7 0

(a1)

0 1 2 3 4 5 6 7 0 1 2 3 4 5 6 7 0

0 1 2 3 4 5 6 7 0 1 2 3 4 5 6 7 0

(b0)

0 1 2 3 4 5 6 7 0 1 2 3 4 5 6 7 0

(b1)

0 1 2 3 4 5 6 7 0 1 2 3 4 5 6 7 0

(b2)

0 1 2 3 4 5 6 7 0 1 2 3 4 5 6 7 0

(b3)

0 1 2 3 4 5 6 7 0 1 2 3 4 5 6 7 0

(b4)

2
3
4
5
ACK 6

(a2)

0 1 2 3 4 5 6 7 0 1 2 3 4 5 6 7 0

(a3)

0 1 2 3 4 5 6 7 0 1 2 3 4 5 6 7 0

6
7
NAK 7

(a4)

b)

0 1 2 3 4 5 6 7 0 1 2 3 4 5 6 7 0

Write a formula showing the relation between the window size (N, in terms of number of
frames) and the size of the sequence number field (k, in terms of bits).

Answer: (a) Content of the following table must be shown as a figure; (b) N=2k-1.

State
a1
a2
a3
a4

Machine A
Place of the
Frames in the
Buffer Line
Sliding Window
Between 1-2
6, 7, 0
Between 5-6
6, 7, 0, 1, 2, 3, 4
Between 5-6
0, 1, 2, 3, 4
Between 6-7
7, 0, 1, 2, 3, 4, 5

State
b1
b2
b3
b4

Machine B
Place of the
Frames in the
Buffer Line
Sliding Window
Between 1-2
6, 7, 0
Between 5-6
6, 7, 0, 1, 2, 3, 4
Between 5-6
0, 1, 2, 3, 4
Between 6-7
7, 0, 1, 2, 3, 4, 5

(BA--8/12.06.98/2.MS/4)
A

6.12

Sliding window protocol with window size of 7 frames are used

between the data link layers of machines A and B. Assume that
machine B sends an ACK (acknowledgement) for every frame
it receives without error, and it sends a NAK (negative
acknowledgement) for every frame it receives with error. This
corresponds to a receiver window size of 1 frame. Assume also
that no frames are lost in the transmission medium. For the
scenario shown in the figure on the right hand side, write the
numbers of the data frames indicated by a, b, c, d, e, f, g, and
write the numbers of the ACKs indicated by h, i, j, k, l, m, n,
and also explain what kind of process does the receiver perform
on the frames indicated by p for each of the following cases:
a) For the Go-back-N Automatic Repeat Request method.
b) For the Selective Reject Automatic Repeat Request method.
(BA--6/28.05.98/2.AS/4)
Answer:
(a) a: F2
b: F3
c: F4
d: F5
e: F6
f: F7
g: F0

h: ACK 3
(b) a: F2 h: ACK 7
i: ACK 4
b: F7 i: ACK 0
j: ACK 5
c: F0 j: ACK 1
k: ACK 6
d: F1 k: ACK 2
l: ACK 7
e: F2 l: ACK 3
m: ACK 0
f: F3 m: ACK 4
n: ACK 1
g: F4 n: ACK 5
p: Discarded
11/18

F0
F1
F2
F3
F4
F5
F6
a
b
c
d
e
f
g

ACK 1
ACK 2
NAK 2
p

h (ACK)
i (ACK)
j (ACK)
k (ACK)
l (ACK)
m (ACK)
n (ACK)

p: Saved in the buffer memory and put into order.

ACK 2, 3, 4, 5, 6 may not be sent.

Demir ner-Computer Networks-Review Questions and Problems

Issue-3

6.13 Briefly define the piggybacking method used in Layer 2 (data link layer) protocol, and write its
advantage. (BA--3/15.07.97/BS/1b)
6.14 Briefly define the pipelining method used in Layer 2 (data link layer) protocol, and write its
advantage. (BA--11/23.06.99/FS/1a)
6.15 Briefly answer the following questions about the balanced configuration used in the HDLC protocol.
(1) What name is given to the stations communicating in balanced mode?
(2) How many stations can simultaneously communicate on the same link?
(3) Which type (or types) of transmission is used among the following? Simplex, half-duplex, fullduplex.
(4) Which type (or types) of connection are used among the following? Point-to-point, point-tomultipoint.
(BA--23/31.05.00/FS/1g)
6.16

In a data link connection where CRC (Cyclic Redundancy Check) is used, an 8-bit information is given
as 1 1 0 1 0 0 1 0. The generating function used in the CRC is G(x) = x3 + x + 1.
a) Calculate the CRC code.
b) Write the T(x) polynomial corresponding to the bit string that will be sent, and show which terms
belong to data and which terms belong to the CRC code.
c) Write the bit string that will be sent, and show which bits belong to data and which bits belong to the
CRC code.
(BA--2/01.07.97/FS/2)
Answer: 1 1 0 1 0 0 1 0 0 0 0
Data bits

CRC

6.17 In a data link connection where CRC (Cyclic Redundancy Check) is used, a 10-bit information is given
as 1 0 0 1 0 1 1 0 1 1. The generating function used in the CRC is G(x) = x4 + x3 + x + 1.
a) Calculate the CRC code.
b) Write the T(x) polynomial corresponding to the bit string that will be sent, and show which terms
belong to data and which terms belong to the CRC code.
c) Write the bit string that will be sent, and show which bits belong to data and which bits belong to the
CRC code.
(BA--7/28.05.98/FS/2AS/1)
Answer: 1 0 0 1 0 1 1 0 1 1 1 0 0 1
Data bits

CRC

6.18 In a communication using CRC (Cyclic Redundancy Check) error detection method,
The information bits and CRC code arrived at the destination machine is given as follows:
Information bits
CRC code
1 1 0 1 0 0 1 1 0 1 1 0 0 1
The generating function used in CRC is given as G(x) = x4 + x2 + x + 1.
a) Perform the mathematical operation done by the data link layer of the destination machine and
decide whether the received bit stream has error or not and give reason.
b) Calculate the coding efficiency of the above coding.
c) How many bits of burst error can be detected by the above given generating function?
(BA-FB-2/30.06.00/FS/2)
Answer: (a) Residue: R(x)=x3+10. Therefore there is error; (b) % 71.4; (c) Ne=4.

12/18

Demir ner-Computer Networks-Review Questions and Problems

Issue-3

6.19 The transmitted and received bit streams in a transmission with Hamming coding are given below.
Assuming that there is only one bit error in transmission, show the mathematical procedure how the
receiver decides that bit I4 is incorrectly received.
I1 I2 I3 I4 C1 C2 C3
Transmitted bit stream : 1 0 0 1 0 0 1
Received bit stream

Transmission error
(BA--2/01.07.97/FS/2)
6.20 In a computer network Hamming coding is used for error detection and correction.
a) By using m control bits, one error bit can be corrected in a data block of n information bits. Express
n in terms of m and calculate n for m=4.
b) Write the control bits C1, C2, C3, C4 as functions of information bits (Is) by considering the
combinations Cs and modulo-2 addition.
c) The data block of 6 information bits and four control bits sent by computer A has arrived at the
computer B with one information bit changed in transmission. The bit stream consisting of the data
block and the control bits received by computer B is as follows:
I1 I2 I3 I4 I5 I6 C1 C2 C3 C4
1 1 0 1 1 1 0 0 1 1
Assume that both the source machine and the destination machine use the following functions to
calculate the control bits:
C1=I1 I2 I3 ; C2=I1 I4 I5 ; C3=I2 I4 I6 ; C4=I3 I5 I6
Find out which information bit is changed in transmission by assuming that control bits are not
destroyed and only one information bit is changed.
(BA--3/15.07.97/BS/4)
6.21

Answer the following questions related to Hamming coding.

a) Calculate the maximum number information bits in a block of data that can
be controlled by using Hamming code of five control bits (C1, C2, C3, C4, C5)
to correct one bit error?
b) Obtain the mathematical expressions used in the calculation of the control bits
(C1, C2, C3, C4, C5) in terms of information bits (Im).
c) A code of 8 code words is given on the right-hand side.
(1) Find the Hamming distance of the code and explain your method.
(2) How many bits of error in a code word can be detected by this code?
Calculate.
(3) How many bits of error in a code word can be corrected by this code?
Calculate.
(BA--9/18.06.98/FS/3)
Answer: (a) 26 data bits; (c1) d=3; (c2) 2 bit; (c3) 1 bit.

Given code
000 000 000
000 000 111
000 111 000
000 111 111
111 000 000
111 000 111
111 111 000
111 111 111

6.22 (Extra question)

Go-back-N sliding window protocol is used between the data link layers of machines A and B with a
window size of 7 frames at both sides. The figure below shows the a0 and b0 states of the sliding
windows of machines A and B, respectively, just before Frame 0 is sent by A. The same figure also
shows the sequence numbers of the frames sent by A and acknowledgements sent by B.
a) Indicate the frame numbers that should be contained in the sliding windows and buffer memories at
the sender and receiver for the states a1, b1, a2, b2, a3, b3, a4, and b4.

13/18

Demir ner-Computer Networks-Review Questions and Problems

Issue-3

A Makinesi
(a0)

B Makinesi

0 1 2 3 4 5 6 7 0 1 2 3 4 5 6 7 0

0 1 2 3 4 5 6 7 0 1 2 3 4 5 6 7 0

(b0)

0 1 2 3 4 5 6 7 0 1 2 3 4 5 6 7 0

(b1)

0 1 2 3 4 5 6 7 0 1 2 3 4 5 6 7 0

(b2)

0 1 2 3 4 5 6 7 0 1 2 3 4 5 6 7 0

(b3)

0 1 2 3 4 5 6 7 0 1 2 3 4 5 6 7 0

(b4)

0
1
2
3
4

(a1)

0 1 2 3 4 5 6 7 0 1 2 3 4 5 6 7 0
ACK 5

(a2)

0 1 2 3 4 5 6 7 0 1 2 3 4 5 6 7 0

(a3)

0 1 2 3 4 5 6 7 0 1 2 3 4 5 6 7 0

5
6
7
NAK 6

(a4)

0 1 2 3 4 5 6 7 0 1 2 3 4 5 6 7 0

b) Write a formula showing the relation between the window size (N, in terms of number of frames)
and the size of the sequence number field (k, in terms of bits).
(BA--17/23.06.99/FS/3)
Answer: (a) Content of the following table must be shown as a figure; (b) N=2k-1.

State
a1
a2
a3
a4

7.

Machine A
Place of the
Buffer Line
At the left of 0
Between 4-5
Between 4-5
Between 5-6

Frames in the
Sliding Window
5, 6
5, 6, 7, 0, 1, 2, 3
0, 1, 2, 3
6, 7, 0, 1, 2, 3

Machine B
Place of the
Buffer Line
At the left of 0
Between 4-5
Between 4-5
Between 5-6

State
b1
b2
b3
b4

Frames in the
Sliding Window
5, 6
5, 6, 7, 0, 1, 2, 3
0, 1, 2, 3
6, 7, 0, 1, 2, 3

MEDIUM ACCESS CONTROL SUBLAYER

7.1

Compare the delay of pure ALOHA versus slotted ALOHA at low and high traffic loads. Which method
causes less delay for low and high traffic loads?

7.2

A group of N stations share a 56-kbps pure ALOHA channels. Each station outputs a 1000-bit frame on
an average of every 100 sec. Considering that the maximum efficiency of the pure ALOHA is 18.4 %,
calculate the maximum number of N.
Answer: 1030 stations.
A 1-km long, 10-Mbps CSMA/CD LAN has propagation speed of 200 m/sec. Data frames are 66 bytes
long, including 26 bytes header, checksum and other overhead. The first bit slot after a successful
transmission is reserved for the receiver to capture the channel to send a 32-bit acknowledgement frame.
What is the effective data rate (TRIB: Transmission Rate of Information Bits), assuming that there are
no collisions.
Hint: Take the time required to capture the channel as 2. This is the round trip propagation time for the
electrical signal.
Answer: 3.72 Mbps

7.3

7.4

Eight stations with station numbers 0 through 7 use the basic bit map protocol. The figure below
shows the bits transmitted by these stations in the contention slots. Write the number of the stations that
send the frames a, b, c, d and e shown in the figure.
Contention slots

Frames sent Contention slots

01234567

01234567

1
1 bit

d bits

14/18

11

Frames sent

Demir ner-Computer Networks-Review Questions and Problems

Issue-3

7.5

Four stations using the binary count down protocol are transmitting their addresses at the same time to
get a shared channel. The addresses of the stations are 0110, 1011, 1010 and 0010. Explain the
algorithm by indicating which station gives up in each bit interval and which stations continue to
compete for the channel, and determine which station wins and transmits its frame.

7.6

Stations A, B, C, D, E, F, G, H, J and K using the binary count down protocol with virtual station
numbers have the virtual station numbers 9, 8, 7, 6, 5, 4, 3, 2, 1, and 0 at a certain instant. The next
three stations to send are E, C, and A, in that order. What are the new virtual station numbers after all
three have finished their transmissions?
Answer: 0, 9, 1, 8, 2, 7, 6, 5, 4, and 3.

7.7

16 stations (0 through 15) are using the adaptive tree walk protocol to access a shared channel. In the
contention slot 0, stations 2, 3, 5, 7, 11, and 13 suddenly become ready at the same time to transmit
frames, and start contending for the channel.
a) Draw the binary tree defining the tree walk.
b) Starting from the contention slot 0, determine which stations will compete under which node, and
which station will transmit a frame.
c) How many contention slots of one bit are needed to resolve contention?
Answer: (c) 11 contention slots.

8.

NETWORK DEVICES

8.1

Briefly explain the operation principle of transparent bridges. (BA--15/08.06.99/2AS/1a)

8.2

Briefly define the problem that may appear in the operation of transparent bridges during the flooding
phase, and explain how we can eliminate this problem. (BA--9/18.06.98/FS/2b)

8.3

Answer the following questions about the spanning tree algorithm:

(1) What type of bridges use this algorithm?
(2) For which problem this algorithm is used, and in which phase?
(3) How does this algorithm bring a solution for the problem?
(BA-FB-2/30.06.00/FS/1b)

8.4

Briefly explain the operation principle of source routing bridges. What is frame explosion that may
appear in the operation of this type of bridges?
(BA--10/10.06.99/2AS/1b)

8.5

Draw an illustrative block diagram that explains the operation principle of a translator bridge connected
between an Ethernet LAN (CSMA/CD: IEEE 802.3) and a Token bus LAN (IEEE 802.4). Show the
headers and trailers appended by each layer and sublayer to a packet sent by the network layer of
computer A on the Ethernet LAN and addressed for the network layer of computer B on the Token Ring
LAN. Show also the layers and sublayers that the packet passes while it travels from A to B.
(BA--7/18.06.98/FS/2)

8.6

Briefly define filtering rate and forwarding rate which are known as the performance criteria of
bridges. ((BA--15/08.06.99/2AS/1c)
Explain the differences between a router that gives connection-oriented service and a transparent bridge
in the following aspects:
(1) Layers they operate;
(2) Addresses maintained in their tables;
(3) Packets whose destination address are read;
(4) Procedure they apply in forwarding the packets.
(BA--9/18.06.98/FS/2a)

8.7

8.8

What is tunneling? Briefly explain and draw an illustrative figure. Specify the MAC addresses and
network addresses of the frames on the LANs and those for the packets through the WAN.
(BA--13/31.05.00/FS/1b)
15/18

Demir ner-Computer Networks-Review Questions and Problems

8.9

Issue-3

In the computer network given below, delays between the routers are given in milliseconds.
a) Apply Dijkstras algorithm for Router A. In applying the algorithm, establish a table with the labels
showing the minimum delay value and the corresponding path from Router A to all other routers for
each iteration step.
b) Briefly explain at which iteration and why the algorithm ends.
c) Indicate which labels will be stored in the routing table of Router A.
3

B
6

2
3

C
2

1
2

1
2

(AB--3/15.07.97/BS/3)
Answer: (a) B(1, A); C(4, A-B-C); D(5, A-E-D); E(3, A-E); F(3, A-G-F); G(2, A-G); H(5, A-B-C-H).
8.10 In the computer network given below, delays between the routers are given in milliseconds.
a) Apply Dijkstras algorithm for Router 1. In applying the algorithm, establish a table with the labels
showing the minimum delay value and the corresponding path from Router 1 to all other routers for
each iteration step.
b) Briefly explain at which iteration and why the algorithm ends.
c) Indicate which labels will be stored in the routing table of Router 1.
3

(BA--17/23.06.99/FS/4)
Answer: (a) D2(1, 1-2); D3(3, 1-2-5-3); D4(3, 1-2-5-4); D5(2, 1-2-5); D6(5, 1-2-5-3-6).
8.11 In the network given below, delays between the routers are given in milliseconds.
a) Apply Bellman-Ford algorithm for the Router 1. In applying the algorithm, establish a table in which
the maximum number of hops is started from zero and incremented by one for each iteration (h=0, 1,
2, 3, ). In the table you will establish, include the label values consisting of minimum delay and
path definition from Router 1 to other routers for each value of h.
b) Briefly explain how the iteration ends.
c) Indicate which labels will be stored in the routing table of Router 1 at the end of the algorithm.
2

3
1

2
1

4
1

6
1

(BA--23/31.05.00/FS/3)
Answer: (a) D2(2, 1-2); D3(3, 1-5-6-3); D4(2, 1-5-4); D5(1, 1-5); D6(2, 1-5-6).
16/18

Demir ner-Computer Networks-Review Questions and Problems

Issue-3

8.12 Distance vector routing algorithm is used in the subnet shown below. The delay vectors that have just
come in to router C from its neighbor routers and the measured delays to the neighbors of C are given
below. Find the new routing table of C. Give both the outgoing line to use and the expected delay.
Delay vectors received from Cs neighbors:
To
A
B
C
D
E
F
G

B
1
0
4
12
17
3
9

D
11
12
10
0
9
13
7

F
2
3
5
13
14
0
6

E
F

Delay measurements made by C:

CB
3

CD
7

CF
8

(BA--3/15.07.97/BS/3)
Answer:
To
A
B
C
D
E
F
G

New estimated
delay from C
4
3
0
7
16
6
12

Path
Over B
Directly to B
Directly to D
Over D
Over B
Over B

8.13 Distance vector routing algorithm is used in the subnet shown below. The following delay vectors have
just come in to router A:
A, B, C, D, E, F
B
C
From B: (6, 0, 5, 10, 6, 3)
From C: (12, 7, 0, 3, 8, 11)
From D: (4, 3, 6, 0, 5, 7)
F
A
The measured delays to B, C, and D are 13, 9, and 7 msec,
respectively. Find the new routing table of A. Give both the
D
E
outgoing line to use and the expected delay.
(BA--18/15.09.99/BS/4)
Answer:
To
A
B
C
D
E
F

Delay from A
0
10
9
7
12
14

Path
Over D
Over C
Over D
Over D
Over D

8.14 (Extra question)

Distance vector routing algorithm is used in the subnet shown below. The following delay vectors have
just come in to router C:
From B: (5, 0, 8, 12, 6, 2)
From D: (16, 12, 6, 0, 9, 10)
From E: ( 7, 6, 3, 9, 0, 4)
The measured delays to B, D, and E are 6, 3, and 5 msec, respectively. Find the new routing table of C.
Give both the outgoing line to use and the expected delay.

17/18

Demir ner-Computer Networks-Review Questions and Problems

Issue-3

(BA--2/01.07.97/FS/4)
Answer:
To
Delay from C
A
11
B
6
C
0
D
3
E
5
F
8

Path
Over B
Over B
Over D
Over E
Over B

8.15 (Extra question)

Distance vector routing algorithm is used in the subnet shown below. The delay vectors that have just
come in to router A from its neighbor routers and the measured delays to the neighbors of A are given
below. Find the new routing table of A. Give both the outgoing line to use and the expected delay.
Delay vectors received by A:
To
Delay
Delay
Delay
from B from C from D
(ms)
(ms)
(ms)
A
3
2
2
B
0
3
7
C
3
0
3
D
6
6
0
E
3
8
6
(BA-FB-2/30.06.00/FS/3)
Answer:
To Delay from A
A
0
B
4
C
1
D
4
E
8

Delay measurements made by A:

To
Delay
from A
(ms)
B
5
A
C
1
D
4

Path
Over A
Over C
Over C
Over D
Over B

18/18