0% found this document useful (0 votes)
24 views5 pages

SC2008 AY2324 S2 Solutions

The document contains solutions to past exam questions for the SC2008 Computer Networks course, covering various topics such as IP addressing, throughput calculations, and protocol behavior. Each question is followed by a detailed answer, including calculations and explanations. The solutions address both theoretical and practical aspects of computer networking concepts.

Uploaded by

gptplusxv
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
0% found this document useful (0 votes)
24 views5 pages

SC2008 AY2324 S2 Solutions

The document contains solutions to past exam questions for the SC2008 Computer Networks course, covering various topics such as IP addressing, throughput calculations, and protocol behavior. Each question is followed by a detailed answer, including calculations and explanations. The solutions address both theoretical and practical aspects of computer networking concepts.

Uploaded by

gptplusxv
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

24th SCSE Club – Past Year Paper Solution (2023 – 2024 Semester 2)

SC2008 – Computer Networks

1 (1) Node A: 8.9.200.90 = 0000 1000 . 0000 1001 . 1100 1000 . 0101 1010
Node B: 8.9.100.60 = 0000 1000 . 0000 1001 . 0110 0100 . 0011 1100

First 16 bits are identical.

Answer: (D) 255.254.0.0

(2) ceil(4200/1500) = 3

Answer: (C) 3

(3) 0.3𝑛 < 1 − 0.99


𝑛 × 𝑙𝑛(0.3) < 𝑙𝑛(0.01)
𝑛 > 𝑙𝑛(0.01)/𝑙𝑛(0.3)
𝑛 > 3.825
𝑛≥4
Answer: (C) 4

(4) During triple ACK, congestion window will be halved into 16.
Therefore, the average is (16 + 32)/2 = 24

Answer: (B) 24

(5) Throughput = Window size * Maximum Segment Size / RTT

Inputting the values,


960000 ≤ 8000bits ∗ Window size/0.1secs
Window size ≥ 12
Answer: (A) 12

(6) Probability that only one station transmits = 0.2 * 0.8 * 0.8 = 0.128
Either Station A, B or C = 0.128 * 3 = 0.384

Answer: (B) 0.384

(7) After the first collision, the probability that each station will transmit is 0.5.
Probability of a successful transmission = 3 * 0.5 * 0.5 * 0.5 = 0.375

Answer: (D) 0.375

(8) 𝑇𝑓𝑟𝑎𝑚𝑒 = 1000Bytes/1Mbps


= 0.008𝑠

1
If there are errors, please report using the form in bit.ly/SCSEPYPErrorForm

Page 1 of 5 If there are errors, please report using the form in scds.cc/PYPError
24th SCSE Club – Past Year Paper Solution (2023 – 2024 Semester 2)
SC2008 – Computer Networks

𝑎 = 𝑇𝑝𝑟𝑜𝑝 /𝑇𝑓𝑟𝑎𝑚𝑒
= 0.020/0.008
= 2.5

𝑊
𝑈=
𝑁𝑟 (1 + 2𝑎)
2
=
1
× (1 + 2 × 2.5)
1−𝑝
2 × 0.99
=
6
= 0.33

Throughput = 1Mbps * 0.33 = 330Kbps


Answer: (D) 337 Kbps

(9) RTT = 16 microseconds

Maximum transmission rate = Minimum frame size/RTT = 512 bits/16 microseconds


= 32Mbps

Answer: (D) 32 Mbps

(10) Only Betha’s mask fits with the destination address:


196.94.5.18 = 11000100 01011110 00000101 00010010
196.94.4.0 = 11000100 01011110 00000100 00000000

Answer: (B) Betha

(11) 0ms (currently) = 15


200ms = 16
400ms = 17
600ms = 18
800ms = 19
1000ms = floor(19/2) = 9 (triple ack occurred)

Answer: (E) 9

(12) The route from Node B and Node A is reversed, so they would need to traverse the subnet
network 202.22.8.0/24, 155.69.8.0/22, 132.20.24.0/21 in this order.

Choice A: 132.20.39.100 is not in the 132.20.24.0/21 subnet


Choice B: all of the IPs are in the correct subnet
Choice C: 200.22.12.200 is not in the 202.22.8.0/24 subnet
Choice D: 155.69.16.200 is not in the 155.69.8.0/22 subnet
2
If there are errors, please report using the form in bit.ly/SCSEPYPErrorForm

Page 2 of 5 If there are errors, please report using the form in scds.cc/PYPError
24th SCSE Club – Past Year Paper Solution (2023 – 2024 Semester 2)
SC2008 – Computer Networks

Answer: (B) 202.22.8.56; 155.69.10.155; 132.20.31.5

(13) (i) Border Gateway Protocol (BGP) uses User Datagram protocol (UDP)
This is FALSE. BGP uses TCP (Transmission Control Protocol), not UDP.

(ii) Open Shortest Path First (OSPF) is a Link state routing protocol
This is TRUE. OSPF is indeed a link-state routing protocol.

(iii) Routing Information Protocol (RIP) is a Distance Vector protocol


This is TRUE. RIP is a classic example of a distance vector routing protocol.

(iv) OSPF uses Bellman-Ford algorithm


This is FALSE. OSPF uses Dijkstra's algorithm, not Bellman-Ford. The Bellman-Ford
algorithm is typically used in distance vector protocols like RIP.

Answer: (D) (ii), (iii)

(14) X should be 6 as it is retransmit frame No. 6 (due to the SREJ(6)).


Y should be 6 as the last acknowledged frame was 6 (due to the frame I(4,6) from B).

Answer: (E) None of the above

(15) Time Router Stn. Nouse


8ms Packet 1
16ms Packet 2 Packet 1
24ms Packet 3 Packet 2
32ms
40ms
48ms Packet 3
56ms
64ms

For this, calculate the time needed to transfer 1000 bytes of data, that is 1000B / 1Mbps =
8ms. We would use this as the unit of time needed to send 1000 bytes of data.

Note that for the router being able to forward the packet, it needs to fully receive it first.

Answer: (E) 64 msec

2 (a) Let P(x) be the probability that the link x breaks.

P(SG-HK-KR) = 1 – 0.9*0.9 = 0.19

3
If there are errors, please report using the form in bit.ly/SCSEPYPErrorForm

Page 3 of 5 If there are errors, please report using the form in scds.cc/PYPError
24th SCSE Club – Past Year Paper Solution (2023 – 2024 Semester 2)
SC2008 – Computer Networks

P(SG and KR breaks) = 0.2 * 0.19 = 0.038

P(SG and JP breaks if it goes through KR)= 1 – (1-0.038)*(1-0.1) = 1 – 0.962 * 0.9 = 0.1342
P(SG-JP) = 0.1342 * 0.3 = 0.04026

Answer: 0.04026

(b) During the first retransmit, station A has a uniform distribution with 2 slots, 0-1. If it were
successfully transmit on slot 0, then it will transmit on slot 1, 2, and so on (assuming there are
no collision). Therefore, Station A must transmit at slot 1, which has the probability of 0.5.

The probability that Station B transmit at slot 0 is 0.25.

Therefore, the probability that Station B transmit successfully on the first retry is 0.25 * 0.5 =
0.125.

Answer: 0.125

(c) Since production department needs 50 nodes, it needs at least 2^6 nodes => 6 bits for host.
For legal department, it needs at least 2^5 nodes => 5 bits for host.

For the last 8 bits, the occupied numbers are:


- 32 – 47 ((iii) 155.69.7.32/28 => 0010 XXXX)
- 64 – 127 ((i) 155.69.7.64/26 => 01XX XXXX)
- 128 – 143 ((iv) 155.69.7.128/28 => 1000 XXXX)
- 143 – 191 ((ii) 155.69.7.160/26 => 10XX XXXX)

0-31 32-63 64-95 96-127 128-159 160-191 192-223 224-256


(iii) (i) (iv) (ii)

For production department, the number 192 – 255 can fit 64 nodes (11XX XXXX), thus the IP
block would be 155.69.7.192/26.

For legal department, it can fit 32 nodes with the number 0 – 31 (000X XXXX), thus the IP
block would be 155.69.7.0/27.

Answer: Production Department = 155.69.7.192/26, Legal Department = 155.69.7.0/27

(d) The second packet sends an AN = 1401, therefore w = 1400 (as it return w + 1 as AN in
handshaking process). It also sends a packet with SN = 4000, therefore x = 4001 (same
reasoning as before).

On the third packet from A, the AN number is 4001, which means that Station A is expecting
to receive a packet with SN = 4001 from station B. Therefore, y = 4001.
4
If there are errors, please report using the form in bit.ly/SCSEPYPErrorForm

Page 4 of 5 If there are errors, please report using the form in scds.cc/PYPError
24th SCSE Club – Past Year Paper Solution (2023 – 2024 Semester 2)
SC2008 – Computer Networks

As for the AN of the second packet from B, it was sent when station B has not received packet
with SN = 1501 from station A. Thus, it is expecting to receive packet with SN = z = 1501.

Answer: w = 1400, x = 4001, y = 4001, z = 1501

Solver: Clayton Fernalo ([email protected])

5
If there are errors, please report using the form in bit.ly/SCSEPYPErrorForm

Page 5 of 5 If there are errors, please report using the form in scds.cc/PYPError

You might also like