Scribd
Upload
13 views

NAME: - : Computer Networks I MID-TERM EXAM 2 - PART 2 (TOTAL: 5 Points) Instructions

The document contains a midterm exam for a computer networks course. It consists of 6 problems testing knowledge of topics like protocols, line codes, throughput calculations, and more. It also contains a true/false section with 20 questions testing foundational networking concepts.

Uploaded by

ikejimenes
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
13 views

NAME: - : Computer Networks I MID-TERM EXAM 2 - PART 2 (TOTAL: 5 Points) Instructions

The document contains a midterm exam for a computer networks course. It consists of 6 problems testing knowledge of topics like protocols, line codes, throughput calculations, and more. It also contains a true/false section with 20 questions testing foundational networking concepts.

Uploaded by

ikejimenes
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

NAME: ____________________________________

Computer Networks I

MID-TERM EXAM 2 – PART 2 (TOTAL: 5 points) May 12, 2017

INSTRUCTIONS.
Write down your name as soon as you receive the questionnaire.
Answer questions 1 and 2 in the space provided.
Properly label each answer.
Calculators allowed
Six (6) problems.
Time allowed: 60 minutes

PROBLEM 1. Protocol operation (0,5 point)


Consider the operation of a Go-Back-N ARQ depicted in the figure. Assume that Station B has
received without error all the data frames shown in the figure.

A B

a) Assume the use of a 3-bit sequence


number field, what is the value of X?
____0___, since there are three bits, the
frames are numbered 000, 001,010, 011,
100,101,110,111,000,001…

b) Assume now the use of a 4-bit sequence


number field, what is the value of X?
____8___ since we have received frame
0111 (7), the next one will be 1000,…

PROBLEM 2. Line Codes (0,5 point)


Draw the graph of the Differential Manchester for the data stream: 11001100. Assume that the
voltage level is initially positive. Each mark denotes one bit period. (see the slides)
PROBLEM 3 Window protocols (2 points)

Consider a geo-stationary satellite communication system, see the figure, operating at 64 kbps with a
-6
propagation delay of 5 x 10 s/km using data frames of 100 Bytes. The distance between the satellite
and each one of the earth station is 36 000 km.

Assume the use of the Go-Back N protocol. Determine

a) the efficiency using 7-bit sequence numbers.

Since we use 7 bits, the maximum window size is N= 27 – 1 = 127

We use the formula: U = N/(1 + 2 x tprop/trans)

Carefull here tprop is the end to end delay from a ground station to the other ground station,
i.e., tprop = 2 x (36000 km/s x 5 x 10-6 s)

b) the optimal size of the window size and length of the sequence number field in bits.

Here, we are looking for Nopt for the case when U = 1

Assume now the use of the Selective Repeat protocol. Determine the length of the sequence number
field in bits.

Here, we have to find m for the optimal value of N taking into account that the window size for
this protocol as a function of m is given by: N = 2 m-1

PROBLEM 4. Token Ring (0,5 point)


Consider a token ring of length 5 km with a data rate of 100 Mbps and 50 repeaters, each of which
introduces a 1-bit delay. Assume that speed of the signal through the medium is 2 x 108 m/s

Answer the following questions.


a) What is the propagation time around the ring?
b) What is the total bit length of the ring?
PROBLEM 5. CSMA/CD (0,5 point)
A network using CSMA/CD has a bandwidth of 100 Mbps. If the maximum cable length has been
set to 100 m, what should be the minimum packet length in Bytes? (assume that the signal propagates
at 2 x 108 m/s)

PROBLEM 6. Nyquist and Shannon formulas (1 point)


a) Determine the channel capacity expressed in bits per second for a 2400 MHz channel whose
SNR ratio is 30 dB.

Carefull: before applying Shannon, notice that the SNR given in the statement is expressed in
dB

b) Determine the bit rate for a noiseless 1200 MHZ channel given that each signaling symbol
corresponds to 32 levels.

You should look at the hand-out posted in the website, there are several similar numerical
examples.
NAME: ____________________________________

Computer Networks I

MID-TERM EXAM 2 – PART 1 (TOTAL 5 points) May 12, 2017

INSTRUCTIONS
Write down your name as soon as you receive the questionnaire.
Answer all questions in the space provided.
Properly label each answer.
Calculators NOT allowed
Time allowed: 30 minutes

Questions: True or False (3 points)


Fill the box corresponding to each one of the following fifteen questions by: T = correct F = wrong.
Right answer: + 0,15 points Wrong answer: -0,1 No answer: 0 points.

1 F 2 F 3 T 4 F 5 F
6 T 7 T 8 F 9 T 10 F
11 F 12 T 13 T 14 F 15 T
16 F 17 T 18 T 19 F 20 T

1. Analog signals take discrete values.


2. The data link layer is responsible of routing the packets.
3. The physical layer takes bits from the upper layer and generates signals.
4. Optical fiber links operate at lower bit rates than coax cable links.
5. In analog communications, we used repeaters to regenerate the signal.
6. In a wireless network, the directional antennas of the sender and receiver must be aligned.
7. In a token ring, when a station has some data to transmit, it should wait until receives the token,
then holds the token and sends its data.
8. When using the slotted Aloha protocol, each station sends a frame whenever it has a frame to
send.
9. When using the CSMA/CD protocol, a station verifies the status of the channel whilst
transmitting.
10. The Simplest Protocol has been designed for noisy channels
11. PCM is an example of digital-to-analog conversion.
12. The implementation of sliding window protocols requires the use of buffers to temporally store
the frames to be acknowledged.
13. In the Stop-and-Wait Protocol, the sender sends one frame, stops until it receives confirmation
from the receiver, and then sends the next frame.
14. When using a sliding window protocol, we will obtain a higher efficiency by setting the window
size to 1 (one).
15. Twisted-pair links operate at lower bit rates than coax cable links.
16. In the case that a Selective-Repeat protocol uses a 3-bit sequence number field, the maximum
window size is 7.
17. The maximum throughput of the slotted ALOHA is higher than the maximum throughput of the
Aloha protocol.
18. The signal rate is sometimes called the baud rate.
19. The coax cable is an unguided medium.
20. Attenuation is a type of transmission impairment in which the signal loses strength due to the
resistance of the transmission medium.

QUESTION 1 Hidden station (2 points)


Describe in your own words the hidden station problem commonly encountered in IEEE 802.11
WLANs. Explain the use of the CTS/RTS exchange mechanism as a way to solve it. Include a time
diagram in your explanation. Answer in the space provided below.

You might also like