TeleComm Exam II Review ACTUAL UPDATED QUESTIONS AND CORRECT
ANSWERS
A.) 2, u Dijkstra's Algorithm (1, part 1). Consider the network shown below, and Dijkstra’s
B.) 8, u link-state algorithm to find the least cost path from source node U to all other
C) 3, u destinations. Using the algorithm statement and its visual representation used in
D) infinity the textbook, complete the first row in the table below showing the link state
algorithm’s execution by matching the table entries (a), (b), (c), and (d) with their
values.
A) uv Dijkstra's Algorithm (1, part 2). Consider the network shown below, and Dijkstra’s
B) 2, u link-state algorithm to find the least cost path from source node U to all other
C) 6, v destinations. Using the algorithm statement and its visual representation used in
D) 3, u the textbook, complete the second row in the table below showing the link state
E) infinity algorithm’s execution by matching the table entries (a), (b), (c), (d) and (e) with
their values.
,A) uvx Dijkstra's Algorithm (1, part 3). Consider the network shown below, and Dijkstra’s
B) 2, u link-state algorithm to find the least cost path from source node U to all other
C) 5, x destinations. Using the algorithm statement and its visual representation used in
D) 3, u the textbook,complete the third row in the table below showing the link state
E) 9, x algorithm’s execution by matching the table entries (a), (b), (c), (d) and (e) with
their values.
A) uvxw Dijkstra's Algorithm (1, part 4). Consider the network shown below, and Dijkstra’s
B) 5, x link-state algorithm to find the least cost path from source node U to all other
C) 8, w destinations. Using the algorithm statement and its visual representation used in
D) 6, w the textbook, complete the fourth row in the table below showing the link state
algorithm’s execution by matching the table entries (a), (b), (c), and (d) with their
values.
A) uvxwz Consider the network shown below, and Dijkstra’s link-state algorithm to find the
B) 5, x least cost path from source node U to all other destinations. Using the algorithm
C) 7, z statement and its visual representation used in the textbook, complete the fifth
D) 6, w row in the table below showing the link state algorithm’s execution by matching
the table entries (a), (b), (c),and (d) with their values.
A) infinity Consider the network shown below, and Dijkstra’s link-state algorithm. Here, we
B) 1, y are interested in computing the least cost path from node y (note: not node u!) to
C) 6, y all other nodes using Dijkstra's algorithm. Using the algorithm statement used in
D) 8, y the textbook and its visual representation, complete the first row in the table
below showing the link state algorithm’s execution by matching the table entries
(a), (b), (c), and (d) with their values.
, A) yw Dijkstra's Algorithm (2, part 2). Consider the network shown below, and Dijkstra’s
B) 9, w link-state algorithm. Here, we are interested in computing the least cost path from
C) 6, w node y (note: not node u!) to all other nodes using Dijkstra's algorithm. Using the
D) 3, w algorithm statement used in the textbook and its visual representation, complete
E) 5, w the first row in the table below showing the link state algorithm’s execution by
matching the table entries (a), (b), (c), (d) and (e) with their values.
A) ywx Dijkstra's Algorithm (2, part 3). Consider the network shown below, and Dijkstra’s
B) 6, x link-state algorithm. Here, we are interested in computing the least cost path from
C) 5, x node y (note: not node u!) to all other nodes using Dijkstra's algorithm. Using the
D) 3, w algorithm statement used in the textbook and its visual representation, complete
E) 4, x the first row in the table below showing the link state algorithm’s execution by
matching the table entries (a), (b), (c), (d), and (e) with their values.
A) ywxz Dijkstra's Algorithm (2, part 4). Consider the network shown below, and Dijkstra’s
B) 6, x link-state algorithm. Here, we are interested in computing the least cost path from
C) 5, x node y (note: not node u!) to all other nodes using Dijkstra's algorithm. Using the
D) 4, x algorithm statement used in the textbook and its visual representation, complete
the first row in the table below showing the link state algorithm’s execution by
matching the table entries (a), (b), (c), and (d) with their values.
De(b) Bellman Ford Algorithm (1, part 1). Consider the scenario shown below, where at
De(d) t=1, node e receives distance vectors from neighboring nodes d, b, h and f. The
De(f) (old) distance vector at e (the node at the center of the network) is also shown,
De(h) before receiving the new distance vector from its neighbors. Indicate which of the
components of new distance vector at e below have a value of 1 after e has
received the distance vectors from its neighbors and updated its own distance
vector.
ANSWERS
A.) 2, u Dijkstra's Algorithm (1, part 1). Consider the network shown below, and Dijkstra’s
B.) 8, u link-state algorithm to find the least cost path from source node U to all other
C) 3, u destinations. Using the algorithm statement and its visual representation used in
D) infinity the textbook, complete the first row in the table below showing the link state
algorithm’s execution by matching the table entries (a), (b), (c), and (d) with their
values.
A) uv Dijkstra's Algorithm (1, part 2). Consider the network shown below, and Dijkstra’s
B) 2, u link-state algorithm to find the least cost path from source node U to all other
C) 6, v destinations. Using the algorithm statement and its visual representation used in
D) 3, u the textbook, complete the second row in the table below showing the link state
E) infinity algorithm’s execution by matching the table entries (a), (b), (c), (d) and (e) with
their values.
,A) uvx Dijkstra's Algorithm (1, part 3). Consider the network shown below, and Dijkstra’s
B) 2, u link-state algorithm to find the least cost path from source node U to all other
C) 5, x destinations. Using the algorithm statement and its visual representation used in
D) 3, u the textbook,complete the third row in the table below showing the link state
E) 9, x algorithm’s execution by matching the table entries (a), (b), (c), (d) and (e) with
their values.
A) uvxw Dijkstra's Algorithm (1, part 4). Consider the network shown below, and Dijkstra’s
B) 5, x link-state algorithm to find the least cost path from source node U to all other
C) 8, w destinations. Using the algorithm statement and its visual representation used in
D) 6, w the textbook, complete the fourth row in the table below showing the link state
algorithm’s execution by matching the table entries (a), (b), (c), and (d) with their
values.
A) uvxwz Consider the network shown below, and Dijkstra’s link-state algorithm to find the
B) 5, x least cost path from source node U to all other destinations. Using the algorithm
C) 7, z statement and its visual representation used in the textbook, complete the fifth
D) 6, w row in the table below showing the link state algorithm’s execution by matching
the table entries (a), (b), (c),and (d) with their values.
A) infinity Consider the network shown below, and Dijkstra’s link-state algorithm. Here, we
B) 1, y are interested in computing the least cost path from node y (note: not node u!) to
C) 6, y all other nodes using Dijkstra's algorithm. Using the algorithm statement used in
D) 8, y the textbook and its visual representation, complete the first row in the table
below showing the link state algorithm’s execution by matching the table entries
(a), (b), (c), and (d) with their values.
, A) yw Dijkstra's Algorithm (2, part 2). Consider the network shown below, and Dijkstra’s
B) 9, w link-state algorithm. Here, we are interested in computing the least cost path from
C) 6, w node y (note: not node u!) to all other nodes using Dijkstra's algorithm. Using the
D) 3, w algorithm statement used in the textbook and its visual representation, complete
E) 5, w the first row in the table below showing the link state algorithm’s execution by
matching the table entries (a), (b), (c), (d) and (e) with their values.
A) ywx Dijkstra's Algorithm (2, part 3). Consider the network shown below, and Dijkstra’s
B) 6, x link-state algorithm. Here, we are interested in computing the least cost path from
C) 5, x node y (note: not node u!) to all other nodes using Dijkstra's algorithm. Using the
D) 3, w algorithm statement used in the textbook and its visual representation, complete
E) 4, x the first row in the table below showing the link state algorithm’s execution by
matching the table entries (a), (b), (c), (d), and (e) with their values.
A) ywxz Dijkstra's Algorithm (2, part 4). Consider the network shown below, and Dijkstra’s
B) 6, x link-state algorithm. Here, we are interested in computing the least cost path from
C) 5, x node y (note: not node u!) to all other nodes using Dijkstra's algorithm. Using the
D) 4, x algorithm statement used in the textbook and its visual representation, complete
the first row in the table below showing the link state algorithm’s execution by
matching the table entries (a), (b), (c), and (d) with their values.
De(b) Bellman Ford Algorithm (1, part 1). Consider the scenario shown below, where at
De(d) t=1, node e receives distance vectors from neighboring nodes d, b, h and f. The
De(f) (old) distance vector at e (the node at the center of the network) is also shown,
De(h) before receiving the new distance vector from its neighbors. Indicate which of the
components of new distance vector at e below have a value of 1 after e has
received the distance vectors from its neighbors and updated its own distance
vector.
