1PDF Exam - Practice - 41092 Network Fundamentals - Spring 2022

Exam_Practice
Due
No due date
Points
50
Questions
12
Time Limit
60 Minutes
Allowed Attempts
Unlimited
Instructions
This is a practice exam to help your preparation for the online final exam.
You have one hour to complete the exam. Marks and answers are given after the test.
Marks are not counted. You may practice as many times as you like.
Note: The practice exam doesn't provide a comprehensive review, nor does it offer any implication on
the exam contents.
Take the Quiz Again (https://canvas.uts.edu.au/courses/24165/quizzes/53997/take?

user_id=150193)
Attempt History
Attempt Time Score
Attempt 1
(https://canvas.uts.edu.au/courses/24165/quizzes/53997/history? 60 0 out of
LATEST
version=1) minutes 50
Submitted Nov 9 at 0:46
Unanswered Question 1 0
/ 1 pts
During TCP Slow Start, how does TCP congestion window (cwnd)
change?

Increase by 1 MSS every RTT

Decrease by 1 MSS every RTT
orrect Answer
Double its value every RTT

Halve its value every RTT
Unanswered
Question 2 0
/ 1 pts
Which part of a modern router is implemented in software
orrect Answer
Routing processor

Input port

Switching fabric

Output port
Unanswered
Question 3 0
/ 1 pts
You want to know how many IP datagrams have been forwarded by

router A's interface Fa0/1. What message should be sent from your
SNMP managing server to achieve the purpose?
orrect Answer
GetRequest

InformRequest

SetRequest

Trap
Unanswered
Question 4 0
/ 1 pts
Which one of the following scheduling mechanisms treats all service

classes equally

FIFO

Priority
orrect Answer
Round Robin

Weighted Fair Queueing
/ 1 pts
Link state routing requires what information

Bandwidth of all the links in the network

Delay of all the links in the network

Cost of links to directly connected neighboUrs
orrect Answer
Complete network topology and all link costs
/ 3 pts
Calculate the checksum of following 2 bytes: 01011010 and 10110100,

and fill in the blank:
Checksum:
Answer 1:
ou Answered (You left this blank)
orrect Answer 11110000
/ 2 pts
In the received data shown in the table below, the 4x4 bit pattern data
(in black text) were protected by two-dimensional even parity scheme
with parity bits at 5th row and 5th column (red text).
1 1 0 0 0
0 1 1 0 0
1 0 0 1 1
1 1 0 1 1
1 0 1 0 0
Given there is single bit error in the received data, please identify the
error data bit position by choosing the row and column numbers below:
ou Answered Row number:

Correct Answer 3
ou Answered Column number:

Correct Answer 2
Other Incorrect Match Options:

4
1
5
/ 5 pts
Suppose a router has the following forwarding table:

Destination Address Range Link Interface
30.155.0.0/16 0
130.125.0.0/16 1
130.125.34.0/24 2
153.15.0.0/16 3
otherwise 4
For the following destination addresses in the left column, identify the
forwarding interface in the right column:
ou Answered 153.15.34.3

Correct Answer 3

Correct Answer 1

Correct Answer 4

Correct Answer 0

Correct Answer 2
/ 5 pts
In the simple TCP client/server socket programming experiment, the

client sends a word 'network' (total 8 bytes, including carriage return),
and the server echoes with 'NETWORK', as shown in the figure below.
Assume the client has a SendBase of 50, and the server has a
SendBase of 90.
Please calculate the sequence numbers A-F for the above figure and
fill in the spaces below:
A. Seq-A:
B. ACK-B:
C. Seq-C:
D. ACK-D:
E. Seq-E:
F. ACK-F:
Answer 1:

orrect Answer 50
Answer 2:
orrect Answer 90
Answer 3:
orrect Answer 90
Answer 4:
orrect Answer 58
Answer 5:
orrect Answer 58
Answer 6:
orrect Answer 98
A. 50
B. 90
C. 90
D. 58
E. 58
F. 98
Unanswered
Question 10 0
/ 5 pts
The source Host A is going to send 5KB (5120byte) of data to the

destination Host B over an established TCP connection, which has a
window size (rwnd) of 4KB (4096byte) and a maximum segment size
(MSS) of 1KB (1024byte). Assuming Go-Back-N is used in TCP.
Suppose there are errors in the transmissions. For each of the

following independent transmission error cases, please calculate the
total number of segments sent out from the source (including
retransmissions) in order to complete the transmissions of the 5KB
data to the destination.
A. Case A. The 2nd segment is corrupted. Other transmissions are

fine. What is the total number of segments sent out from the source
(including retransmissions)?
Answer:
.
B. Case B. The 2nd segment is correctly received, but the ACK to the
2nd segment is lost. Other transmissions are fine. What is the total
number of segments sent out from the source (including
retransmissions)?
Answer:
.
C. Case C. The 4th segment is lost. All other transmissions are fine.
What is the total number of segments sent out from the source
Answer:
.
D. Case D. The 5th segment is lost. All other transmissions are fine.
What is the total number of segments sent out from the source
Answer:
.
E. Case E. The 5th segment is correctly received, but the ACK to the
5th segment is lost. Other transmissions are fine. What is the total
number of segments sent out from the source (including
retransmissions):
Answer:
.
note: Please fill in integer numbers only in the blanks

Answer 1:
orrect Answer 9
Answer 2:
orrect Answer 5
Answer 3:
orrect Answer 7
Answer 4:
orrect Answer 6
Answer 5:
orrect Answer 6
A. 9
B. 5
C. 7
D. 6
E. 6
Unanswered
Question 11 0
/ 10 pts
Consider two LANs interconnected by a router, as shown in the figure
below, with IP address and MAC address next to each interface.
A. Host A is trying to send an IP datagram to Host B. Assume that Host

A's ARP table is empty (ARP query is required). Please fill in the
following table with IP or MAC addresses.
action\address source IP addr source MAC addr destination IP a
A sends ARP
query
A sends
datagram
B. Host A is now sending an IP datagram to Host D. Assume all ARP

tables in all hosts are up to date (no ARP query is required). Please fill
in the following table with IP or MAC addresses.
action\address source IP addr source MAC addr destination IP a
A sends
datagram
D receives
datagram
Answer 1:

orrect Answer 192.168.1.1
Answer 2:
orrect Answer 11-11-11-11-11-11
Answer 3:
Answer 4:
orrect Answer FF-FF-FF-FF-FF-FF
orrect Answer ff-ff-ff-ff-ff-ff
Answer 5:
Answer 6:
orrect Answer 11-11-11-11-11-11
Answer 7:
Answer 8:
orrect Answer 33-33-33-33-33-33
Answer 9:
Answer 10:
orrect Answer 11-11-11-11-11-11
Answer 11:
Answer 12:
orrect Answer 22-22-22-22-22-22
Answer 13:
Answer 14:
orrect Answer 55-55-55-55-55-55
Answer 15:
Answer 16:

orrect Answer 66-66-66-66-66-66
A.
source IP source destination destination

action\address
addr MAC addr IP addr MAC addr
A sends ARP 11-11-11- FF-FF-FF-
192.168.1.1 192.168.1.3
query 11-11-11 FF-FF-FF
A sends 11-11-11- 33-33-33-
192.168.1.1 192.168.1.3
datagram 11-11-11 33-33-33
B.
source IP source destination destination

action\address
addr MAC addr IP addr MAC addr
A sends 11-11-11- 22-22-22-
192.168.1.1 192.168.2.4
datagram 11-11-11 22-22-22
D receives 55-55-55- 66-66-66-
192.168.1.1 192.168.2.4
datagram 55-55-55 66-66-66
/ 15 pts
Consider the following network. With the indicated link costs, use
Dijkstra's shortest-path algorithm to compute the shortest path from
node u to node z.
A. Show how the algorithm works by computing the table shown below.
Note on answer format:
Fill in the N* set with selected nodes without space. For example, if
the node set contains nodes, x, y, and z, enter xyz in the blank.
Fill in the D(.)p(.) cell without space, for example, for D(.)=5 and
p(.)=u, fill in 5u in the blank.
When the distance is infinity, write in the abbreviation inf in the
blank.
When there is a tie in node distances, please choose from left to
right, i.e. the node in the left column is chosen first.
Step N* D(t)p(t) D(v)p(v) D(w)
1
2
3
4
5
6

B. Enumerate the shortest paths from u to z. Enter only one node

name, v, w, x, or y, into each of the intermediate node cells. Fill in the
total path cost of u to z in the last cell.
last
1st node 2nd node 3rd node Total path
node
u →
u z
z
Answer 1:
orrect Answer u
Answer 2:
orrect Answer 2u
Answer 3:
orrect Answer 3u
Answer 4:
orrect Answer 3u
Answer 5:
orrect Answer inf
Answer 6:
orrect Answer inf
Answer 7:
orrect Answer inf
Answer 8:
orrect Answer ut
Answer 9:
orrect Answer 3u
Answer 10:
orrect Answer 3u
Answer 11:
orrect Answer inf
Answer 12:
orrect Answer 9t
Answer 13:
orrect Answer inf
Answer 14:
orrect Answer utv
Answer 15:
orrect Answer 3u
Answer 16:
orrect Answer 6v
Answer 17:
orrect Answer 8v
Answer 18:
orrect Answer inf
Answer 19:
orrect Answer utvw
Answer 20:
orrect Answer 6v
Answer 21:

orrect Answer 8v
Answer 22:
orrect Answer inf
Answer 23:
orrect Answer utvwx
Answer 24:
orrect Answer 8v
Answer 25:
orrect Answer 14x
Answer 26:
orrect Answer utvwxy
Answer 27:
orrect Answer 12y
Answer 28:
orrect Answer utvwxyz
Answer 29:
orrect Answer v
Answer 30:
orrect Answer y
Answer 31:
orrect Answer 12
A.
Step N* D(t),p(t) D(v),p(v) D(w),p(w) D(x),p(x) D(y),p(y) D(z),p(z)

0 u 2u 3u 3u inf inf inf
1 ut 3u 3u inf 9t inf
2 utv 3u 6v 8v inf
3 utvw 6v 8v inf
4 utvwx 8v 14x
5 utvwxy 12y
6 utvwxyz
B.
1st node 2nd node 3rd node last node Total path cost
u → z u v v z 12

1PDF Exam - Practice - 41092 Network Fundamentals - Spring 2022

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

1PDF Exam - Practice - 41092 Network Fundamentals - Spring 2022

Uploaded by

Copyright:

Available Formats

Exam_Practice

Take the Quiz Again (https://canvas.uts.edu.au/courses/24165/quizzes/53997/take?

Submitted Nov 9 at 0:46

Which part of a modern router is implemented in software

You want to know how many IP datagrams have been forwarded by

Which one of the following scheduling mechanisms treats all service

Link state routing requires what information

Calculate the checksum of following 2 bytes: 01011010 and 10110100,

ou Answered (You left this blank)

orrect Answer 11110000

ou Answered Row number:

ou Answered Column number:

Other Incorrect Match Options:

Suppose a router has the following forwarding table:

In the simple TCP client/server socket programming experiment, the

ou Answered (You left this blank)

ou Answered (You left this blank)

ou Answered (You left this blank)

ou Answered (You left this blank)

ou Answered (You left this blank)

ou Answered (You left this blank)

The source Host A is going to send 5KB (5120byte) of data to the

Suppose there are errors in the transmissions. For each of the

A. Case A. The 2nd segment is corrupted. Other transmissions are

note: Please fill in integer numbers only in the blanks

ou Answered (You left this blank)

ou Answered (You left this blank)

ou Answered (You left this blank)

ou Answered (You left this blank)

ou Answered (You left this blank)

A. Host A is trying to send an IP datagram to Host B. Assume that Host

action\address source IP addr source MAC addr destination IP a

B. Host A is now sending an IP datagram to Host D. Assume all ARP

action\address source IP addr source MAC addr destination IP a

ou Answered (You left this blank)

ou Answered (You left this blank)

orrect Answer 11-11-11-11-11-11

ou Answered (You left this blank)

orrect Answer 192.168.1.3

ou Answered (You left this blank)

orrect Answer FF-FF-FF-FF-FF-FF

orrect Answer ff-ff-ff-ff-ff-ff

ou Answered (You left this blank)

orrect Answer 192.168.1.1

ou Answered (You left this blank)

orrect Answer 11-11-11-11-11-11

ou Answered (You left this blank)

orrect Answer 192.168.1.3

ou Answered (You left this blank)

orrect Answer 33-33-33-33-33-33

ou Answered (You left this blank)

orrect Answer 192.168.1.1

ou Answered (You left this blank)

orrect Answer 11-11-11-11-11-11

ou Answered (You left this blank)

orrect Answer 192.168.2.4

ou Answered (You left this blank)

orrect Answer 22-22-22-22-22-22

ou Answered (You left this blank)

orrect Answer 192.168.1.1

ou Answered (You left this blank)

orrect Answer 55-55-55-55-55-55

ou Answered (You left this blank)