12/8/21, 5:21 PM
Review Test Submission: Chapter-5 – CSC_329
Courses
Home
CSC_329
Digital Library
21992_1_431 ‫( ﺷﺑﻛﺎت اﻟﺣﺎﺳﺑﺎت‬COMPUTER NETWORKS)
21992_1_431
Live Support
Knowledge Center
Review Test Submission: Chapter-5
Review Test Submission: Chapter-5
‫( ﺷﺑﻛﺎت اﻟﺣﺎﺳﺑﺎت‬COMPUTER NETWORKS) User
Course
Test
Chapter-5
Started
12/8/21 5:20 PM
Submitted
12/8/21 5:21 PM
Status
Completed
Attempt Score 0 out of 27 points
Time Elapsed
0 minute
Results
Displayed
All Answers, Submitted Answers, Correct Answers, Feedback, Incorrectly Answered
Questions
Question 1
0 out of 1 points
5.1-1. Routing versus forwarding. Which of the following statements correctly
identify the differences between routing and forwarding. Select one or more
statements.
Selected
Answers:
Answers:
[None Given]
Routing refers to determining the route taken by packets from source to
destination, and is implemented in the data plane.
Forwarding refers to determining the route taken by packets from
source to destination, and is implemented in the data plane.
Routing refers to determining the route taken by packets from source to
destination, and is implemented in the control plane.
Routing refers to moving packets from a router’s input to appropriate
router output, and is implemented in the control plane.
Forwarding refers to determining the route taken by packets from
source to destination, and is implemented in the control plane.
https://lms.ksu.edu.sa/webapps/assessment/review/review.jsp?attempt_id=_7911675_1&course_id=_252097_1&content_id=_3761981_1&return_co…
1/15
12/8/21, 5:21 PM
Review Test Submission: Chapter-5 – CSC_329
21992_1_431
Forwarding refers to moving packets from a router’s input to
appropriate router output, and is implemented in the control plane.
Routing refers to moving packets from a router’s input to appropriate
router output, and is implemented in the data plane.
Forwarding refers to moving packets from a router’s input to
appropriate router output, and is implemented in the data plane.
Response Feedback:
Not quite. This answer is incorrect.
Question 2
0 out of 1 points
5.1-2. Approaches towards implementing the control plane. Match the name
of the approach towards implementing a control plane with a description of how
this approach works.
Selected
Match
Question
Correct Match
Per-router
control plane.
C.
An individual routing algorithm components in
each and every router interact in the control plane
[None
Given]
Software-defined
networking
(SDN).
A.
A (typically) remote controller computes and
installs forwarding tables in routers.
[None
Given]
All Answer Choices
A.
A (typically) remote controller computes and installs forwarding tables in
routers.
B.
The network operator installs forwarding tables using the Simple Network
Management Protocols (SNMP).
C.
An individual routing algorithm components in each and every router interact in
the control plane
Response Feedback:
Question 3
Not quite. This answer is incorrect.
0 out of 10 points
5.2-1. What’s a “good” path? What is the definition of a “good” path for a routing
protocol? Chose the best single answer.
https://lms.ksu.edu.sa/webapps/assessment/review/review.jsp?attempt_id=_7911675_1&course_id=_252097_1&content_id=_3761981_1&return_co…
2/15
12/8/21, 5:21 PM
Review Test Submission: Chapter-5 – CSC_329
Selected
Answer:
Answers:
21992_1_431
[None Given]
Routing algorithms typically work with abstract link weights that could
represent any of, or combinations of, all of the other answers.
A low delay path.
A path that has little or no congestion.
A path that has a minimum number of hops.
A high bandwidth path.
Response Feedback:
Not quite. This answer is incorrect.
Question 4
0 out of 1 points
5.2-2. Dijkstra’s link-state routing algorithm. Consider Dijkstra’s link-state
routing algorithm that is computing a least-cost path from node a to other nodes
b, c, d, e, f. Which of the following statements is true. (Refer to Section 5.2 in the
text for notation.)
Selected
Answers:
Answers:
[None Given]
Suppose nodes b, c, and d are in the set N’. These nodes will remain in
N’ for the rest of the algorithm, since the least-cost paths from a to b, c,
and d are known.
The values computed in the vector D(v), the currently known least cost
of a path from a to any node v, will always decrease following an
iteration.
The values computed in the vector D(v), the currently known least cost
of a path from a to any node v, will never increase following an iteration.
Following the initialization step, if nodes b and c are directly connected
to a, then the least cost path to b and c will never change from this initial
cost.
In the initialization step, the initial cost from a to each of these
destinations is initialized to either the cost of a link directly connecting a
to a direct neighbor, or infinity otherwise.
Response Feedback:
Not quite. This answer is incorrect.
https://lms.ksu.edu.sa/webapps/assessment/review/review.jsp?attempt_id=_7911675_1&course_id=_252097_1&content_id=_3761981_1&return_co…
3/15
12/8/21, 5:21 PM
Review Test Submission: Chapter-5 – CSC_329
21992_1_431
Question 5
0 out of 1 points
5.2-3. What type of routing? Match the name of a general approach to routing
with characteristics of that approach.
Question
Correct Match
Centralized,
global
routing.
D.
All routers have complete topology, and link cost
information.
Selected
Match
[None
Given]
Decentralized
A.
routing.
An iterative process of computation, exchange of
informatoin with neighbors. Routers may initially only
know link costs to directly-attached neighbors.
[None
Given]
Static routing.
B. Routes change slowly over time.
[None
Given]
Dynamic
routing.
C. Routing changes quickly over time.
[None
Given]
All Answer Choices
A.
An iterative process of computation, exchange of informatoin with neighbors.
Routers may initially only know link costs to directly-attached neighbors.
B. Routes change slowly over time.
C. Routing changes quickly over time.
D. All routers have complete topology, and link cost information.
Response Feedback:
Question 6
Not quite. This answer is incorrect.
0 out of 0 points
5.2-4. Dijkstra’s link-state routing algorithm (Part 1). Consider the graph shown
below and the use of Dijkstra’s algorithm to compute a least cost path from a to all
destinations. Suppose that nodes b and d have already been added to N’. What is
the next node to be added to N' (refer to the text for an explanation of notation).
https://lms.ksu.edu.sa/webapps/assessment/review/review.jsp?attempt_id=_7911675_1&course_id=_252097_1&content_id=_3761981_1&return_co…
4/15
12/8/21, 5:21 PM
Review Test Submission: Chapter-5 – CSC_329
21992_1_431
[Note: You can find more examples of problems similar to this here.]
Selected Answer:
[None Given]
Answers:
e
f
c
Response Feedback:
Question 7
Not quite. This answer is incorrect.
0 out of 0 points
5.2-5. Dijkstra’s link-state routing algorithm (Part 2). Consider the graph shown
below and the use of Dijkstra’s algorithm to compute a least cost path from a to all
destinations. Suppose that nodes b and d have already been added to N’. What is
the path cost to the next node to be added to N' (refer to the text for an
explanation of notation).
https://lms.ksu.edu.sa/webapps/assessment/review/review.jsp?attempt_id=_7911675_1&course_id=_252097_1&content_id=_3761981_1&return_co…
5/15
12/8/21, 5:21 PM
Review Test Submission: Chapter-5 – CSC_329
21992_1_431
[Note: You can find more examples of problems similar to this here.]
Selected Answer:
[None Given]
Answers:
4
6
5
7
Response Feedback:
Not quite. This answer is incorrect.
Question 8
0 out of 1 points
5.3-1. Routing within or among networks. Match the terms "interdomain
routing" and intradomain routing" with their definitions. Recall that in Internet
parlance, an “AS” refers to “Autonomous System” – a network under the control of
a single organization.
Question
Correct Match
Selected
Match
Interdomain
routing.
C.
Routing among different ASes (“networks”).
[None
Given]
Intradomain
routing.
A.
Routing among routers within same AS
(“network”).
[None
Given]
All Answer Choices
A. Routing among routers within same AS (“network”).
B.
Forwarding packets between two interfaces in different but adjacent
subnetworks.
C. Routing among different ASes (“networks”).
D.
Forwarding packets between two physically connected interfaces in a common
subnetwork.
Response Feedback:
Question 9
Not quite. This answer is incorrect.
0 out of 1 points
https://lms.ksu.edu.sa/webapps/assessment/review/review.jsp?attempt_id=_7911675_1&course_id=_252097_1&content_id=_3761981_1&return_co…
6/15
12/8/21, 5:21 PM
Review Test Submission: Chapter-5 – CSC_329
21992_1_431
5.3-2. Open Shortest Path First (OSPF). Check the one or more of the following
statements about the OSPF protocol that are true.
Selected
Answers:
[None Given]
Answers:
OSPF is an interdomain routing protocol.
The Open Shortest Path First (OSPF) Internet routing protocol
implements a Bellman-Ford distance-vector routing algorithm.
OSFP uses a Dijkstra-like algorithm to implement least cost path
routing.
OSPF implements hierarchical routing
OSPF is an intra-domain routing protocol.
Response Feedback:
Not quite. This answer is incorrect.
Question 10
0 out of 1 points
5.3-3. Open Shortest Path First (OSPF). Consider the OSPF routing protocol.
Which of the following characteristics are associated with OSPF (as opposed to
BGP)?
Selected
Answers:
[None Given]
Answers:
Floods link state control information.
Is an inter-domain routing protocol.
Is an intra-domain routing protocol.
Finds a least cost path from source to destination.
Policy, rather than performance (e.g., least cost path), determines
paths that used.
Response Feedback:
Not quite. This answer is incorrect.
Question 11
0 out of 1 points
5.4-1. Routing within networks? Among the following protocols, terminology or
considerations, indicate those that are associated with "routing within a single
network (typically owned and operated by one organization)."
Selected
Answers:
[None Given]
Answers:
inter-AS routing
https://lms.ksu.edu.sa/webapps/assessment/review/review.jsp?attempt_id=_7911675_1&course_id=_252097_1&content_id=_3761981_1&return_co…
7/15
12/8/21, 5:21 PM
Review Test Submission: Chapter-5 – CSC_329
21992_1_431
intra-domain routing
intra-AS routing
OSPF
Driven more by performance than by routing policy
Driven more by routing policy than end-end routing
performance
BGP
inter-domain routing
Response Feedback:
Not quite. This answer is incorrect.
Question 12
0 out of 1 points
5.4-2. Path advertisement and policy (Part 1). Suppose a provider network only
wants to carry traffic to/from its customer networks (i.e., to provide no transit
service), and customer networks only want to carry traffic to/from itself. Consider
the figure below. To implement this policy, to which of the following networks
would network C advertise the path Cy?
Selected Answers:
[None Given]
Answers:
x
A
w
B
Response Feedback:
Question 13
Not quite. This answer is incorrect.
0 out of 1 points
https://lms.ksu.edu.sa/webapps/assessment/review/review.jsp?attempt_id=_7911675_1&course_id=_252097_1&content_id=_3761981_1&return_co…
8/15
12/8/21, 5:21 PM
Review Test Submission: Chapter-5 – CSC_329
21992_1_431
5.4-3. Path advertisement and policy (Part 2). Again, suppose a provider
network only wants to carry traffic to/from its customer networks (i.e., to provide
no transit service), and customer networks only want to carry traffic to/from itself.
Suppose C has advertised path Cy to A. To implement this policy, to which of the
following networks would network A advertise the path ACy?
Selected Answers:
[None Given]
Answers:
C
B
w
x
Response Feedback:
Question 14
Not quite. This answer is incorrect.
0 out of 1 points
5.4-4. Path advertisement and policy (Part 3). Again, suppose a provider
network only wants to carry traffic to/from its customer networks (i.e., to provide
no transit service), and customer networks only want to carry traffic to/from itself.
Suppose C has advertised path Cy to x. To implement this policy, to which of the
following networks would network x advertise the path xCy?
https://lms.ksu.edu.sa/webapps/assessment/review/review.jsp?attempt_id=_7911675_1&course_id=_252097_1&content_id=_3761981_1&return_co…
9/15
12/8/21, 5:21 PM
Review Test Submission: Chapter-5 – CSC_329
Selected Answers:
[None Given]
Answers:
None of these other networks
21992_1_431
w
A
B
C
Response Feedback:
Not quite. This answer is incorrect.
Question 15
0 out of 1 points
5.4-5. eBGP or iBGP? Consider routers 2c and 2d in Autonomous System AS2 in
the figure below. Indicate the flavor of BGP and the router from which each of 2c
and 2d learns about the path to destination x.
Selected
Question
Correct Match
How does router 2c learn of the path AS3, X to
destination network X?
B.
From 3a via
eBGP.
[None
Given]
How does router 2d learn of the path AS3, X to
destination network X?
A.
From 2c via
iBGP.
[None
Given]
Match
All Answer Choices
A. From 2c via iBGP.
B. From 3a via eBGP.
C. From 2c via eBGP.
D. From x via eBGP.
E. From 3a via iBGP.
Response Feedback:
Not quite. This answer is incorrect.
https://lms.ksu.edu.sa/webapps/assessment/review/review.jsp?attempt_id=_7911675_1&course_id=_252097_1&content_id=_3761981_1&return_c…
10/15
12/8/21, 5:21 PM
Review Test Submission: Chapter-5 – CSC_329
21992_1_431
Question 16
0 out of 1 points
5.5-1. SDN Layers. Consider the SDN layering shown below. Match each layer
name below with a layer label (a), (b) or (c) as shown in the diagram.
Question
Correct Match
Selected Match
SDN Controller (network operating system)
B. (b)
[None Given]
SDN-controlled switches
C. (c)
[None Given]
Network-control applications
A. (a)
[None Given]
All Answer Choices
A. (a)
B. (b)
C. (c)
Response Feedback:
Question 17
Not quite. This answer is incorrect.
0 out of 1 points
5.5-2. Internal structure of the SDN controller (1). Which of the functions below
belong in the controller layer labeled "Interface, abstractions for network control
apps"? Check all below that apply.
https://lms.ksu.edu.sa/webapps/assessment/review/review.jsp?attempt_id=_7911675_1&course_id=_252097_1&content_id=_3761981_1&return_c…
11/15
12/8/21, 5:21 PM
Review Test Submission: Chapter-5 – CSC_329
Selected Answers:
[None Given]
Answers:
Switch information
21992_1_431
Network graph
Host information
Flow tables
Link-state information
Intent
OpenFlow protocol
Statistics
Response Feedback:
Question 18
Not quite. This answer is incorrect.
0 out of 1 points
5.5-3. Internal structure of the SDN controller (2). Which of the functions below
belong in the controller layer labeled "Network-wide distributed, robust state
management"? Check all below that apply.
https://lms.ksu.edu.sa/webapps/assessment/review/review.jsp?attempt_id=_7911675_1&course_id=_252097_1&content_id=_3761981_1&return_c…
12/15
12/8/21, 5:21 PM
Review Test Submission: Chapter-5 – CSC_329
Selected Answers:
[None Given]
Answers:
Intent
21992_1_431
Switch information
Host information
Flow tables
Link-state information
Statistics
OpenFlow protocol
Network graph
Response Feedback:
Question 19
Not quite. This answer is incorrect.
0 out of 1 points
5.5-4. Internal structure of the SDN controller (3). Which of the functions below
belong in the controller layer labeled "Communication to/from controlled device"?
Check all below that apply.
https://lms.ksu.edu.sa/webapps/assessment/review/review.jsp?attempt_id=_7911675_1&course_id=_252097_1&content_id=_3761981_1&return_c…
13/15
12/8/21, 5:21 PM
Review Test Submission: Chapter-5 – CSC_329
Selected Answers:
[None Given]
Answers:
Host information
21992_1_431
Network graph
OpenFlow protocol
Link-state information
Intent
Flow tables
Switch information
Statistics
Response Feedback:
Not quite. This answer is incorrect.
Question 20
0 out of 1 points
5.6-1. ICMP: Internet control message protocol. Which of the statements below
about ICMP are true?
Selected
Answers:
Answers:
[None Given]
The TTL-expired message type in ICMP is used by the traceroute
program.
ICMP is used by hosts and routers to communicate network-level
information.
ICMP messages are carried in UDP segments using port number 86.
https://lms.ksu.edu.sa/webapps/assessment/review/review.jsp?attempt_id=_7911675_1&course_id=_252097_1&content_id=_3761981_1&return_c…
14/15
12/8/21, 5:21 PM
Review Test Submission: Chapter-5 – CSC_329
21992_1_431
ICMP communicates information between hosts and routers by
marking bits in the IP header.
ICMP messages are carried directly in IP datagrams rather than as
payload in UDP or TCP segments.
Response Feedback:
Not quite. This answer is incorrect.
Wednesday, December 8, 2021 5:21:15 PM AST
← OK
https://lms.ksu.edu.sa/webapps/assessment/review/review.jsp?attempt_id=_7911675_1&course_id=_252097_1&content_id=_3761981_1&return_c…
15/15