Kurose - Ross - Chapter - 6 - KC (18) - Attempt Review

08/02/2024, 11:12 Kurose_Ross_Chapter_6_KC (18): Attempt review
Dashboard / My courses / IT324_2023 / Kurose_Ross_Chapters_Quizzes / Kurose_Ross_Chapter_6_KC (18)
Started on Thursday, 8 February 2024, 11:12 AM

State Finished
Completed on Thursday, 8 February 2024, 11:12 AM
Time taken 27 secs
Grade 0.00 out of 18.00 (0%)
https://betamoodle.iiitvadodara.ac.in/mod/quiz/review.php?attempt=150952&cmid=4350 1/20
Question 1 6.4-4. Fields in an Ethernet frame. Use the pulldown menus below to match the name of the field with the
Not answered function/purpose of a field within an Ethernet frame.
Marked out of
1.00 Cyclic redundancy check Drag answer here
(CRC) field Used only to detect, but never
correct, bit-level errors in the
frame.
Sequence number field Drag answer here
Used for flow control.
Type field. Drag answer here
This field does not exist in the
Ethernet frame
Source address field Drag answer here
48-bit MAC address of the
Data (payload) field Drag answer here sending node.
Used to demultiplex the payload
up to a higher level protocol at the
receiver.
The contents of this field is
typically (bit not always) a
network-layer IP datagram.
Used to detect and possibly
correct bit-level errors in the
frame.

The correct answer is:

Cyclic redundancy check (CRC) field Used to detect and possibly correct bit-level errors in
the frame.
Sequence number field This field does not exist in the Ethernet frame
Type field. Used to demultiplex the payload up to a higher level
protocol at the receiver.
Source address field 48-bit MAC address of the sending node.
Data (payload) field The contents of this field is typically (bit not always) a
network-layer IP datagram.
Question 2 6.1-1. Link-layer services. Which of the following services may be implemented in a link-layer protocol? Select one or
Not answered more statements.
Marked out of
1.00 a. Reliable data transfer between directly connected nodes.
b. TLS security (including authentication) between directly connected nodes.
c. Flow control between directly connected nodes.
d. Bit-level error detection and correction.
e. Lookup and forwarding on the basis of an IP destination address.
f. Multiplexing down from / multiplexing up to a network-layer protocol.
g. End-end path determination through multiple IP routers.
h. Coordinated access to a shared physical medium.
The correct answers are: Reliable data transfer between directly connected nodes., Flow control between directly
connected nodes., Coordinated access to a shared physical medium., Bit-level error detection and correction.,
Multiplexing down from / multiplexing up to a network-layer protocol.
Question 3 6.2-1. Two dimensional parity. Which of the following statements is true about a two-dimensional parity check (2D-
Not answered parity) computed over a payload?
Marked out of
1.00
a. 2D-parity can detect and correct any case of a single bit flip in the payload.
b. 2D-parity can detect any case of two bit flips in the payload.
c. 2D-parity can detect any case of a single bit flip in the payload.
d. 2D-parity can detect and correct any case of two bit flips in the payload.
The correct answers are: 2D-parity can detect any case of a single bit flip in the payload., 2D-parity can detect and
correct any case of a single bit flip in the payload., 2D-parity can detect any case of two bit flips in the payload.
Question 4 6.3-1. Channel partitioning protocols. Which of the following statements is true about channel partitioning
Not answered protocols?
Marked out of
1.00
a. Channel partitioning protocol can achieve 100% utilization, in the case that there is only one node that always
has frames to send
b. There can be times when the channel is idle, when a node has a frame to send, but is prevented from doing so
by the medium access protocol.
c. Channel partitioning protocols can achieve 100% channel utilization, in the case that all nodes always have
frames to send.
d. There can be simultaneous transmissions resulting in collisions.
The correct answers are: There can be times when the channel is idle, when a node has a frame to send, but is
prevented from doing so by the medium access protocol., Channel partitioning protocols can achieve 100% channel
utilization, in the case that all nodes always have frames to send.
Question 5 6.3-2. Pure Aloha and CSMA. Which of the following statements is true about both Pure Aloha, and CSMA (both with
Not answered and without collision detection?
Marked out of
1.00
a. There can be times when the channel is idle, when a node has a frame to send, but is prevented from doing so
by the medium access protocol.
b. There can be simultaneous transmissions resulting in collisions.
c. Pure Aloha and CSMA can achieve 100% channel utilization, in the case that all nodes always have frames to
send.
d. Pure Aloha and CSMA can achieve 100% utilization, in the case that there is only one node that always has
frames to send
The correct answers are: There can be simultaneous transmissions resulting in collisions., Pure Aloha and CSMA can
achieve 100% utilization, in the case that there is only one node that always has frames to send
Question 6 6.3-3. Polling and token-passing protocols. Which of the following statements is true about polling and token-
Not answered passing protocols?
Marked out of
1.00 a. There can be simultaneous transmissions resulting in collisions.
b. These protocol can achieve close 100% utilization, in the case that there is only one node that always has
frames to send (the fact that the utilization is close to, but not exactly, 100% is due to a small amount of
medium access overhead but not due to collisions)
c. These protocol can achieve close to 100% channel utilization, in the case that all nodes always have frames to
send (the fact that the utilization is close to, but not exactly, 100% is due to a small amount of medium access
overhead but not due to collisions)
d. There can be times when the channel is idle for more than a short period of time, when a node has a frame to
send, but is prevented from doing so by the medium access protocol.
The correct answers are: These protocol can achieve close to 100% channel utilization, in the case that all nodes
always have frames to send (the fact that the utilization is close to, but not exactly, 100% is due to a small amount of
medium access overhead but not due to collisions), These protocol can achieve close 100% utilization, in the case
that there is only one node that always has frames to send (the fact that the utilization is close to, but not exactly,
100% is due to a small amount of medium access overhead but not due to collisions)
Question 7 6.3-4. Characteristics of Multiple Access Protocols (a).Consider the following multiple access protocols that we've
Not answered studied: (1) TDMA, and FDMA (2) CSMA (3) Aloha, and (4) polling. Which of these protocols are collision-free (e.g.,
Marked out of collisions will never happen)?
1.00
a. Aloha
b. CSMA and CSMA/CD
c. TDMA and FDMA
d. Polling
The correct answers are: TDMA and FDMA, Polling
Question 8 6.3-5. Characteristics of Multiple Access Protocols (b).Consider the following multiple access protocols that we've
Not answered studied: (1) TDMA, and FDMA (2) CSMA (3) Aloha, and (4) polling. Which of these protocols requires some form of
Marked out of centralized control to mediate channel access?
1.00
a. CSMA and CSMA/CD
b. TDMA and FDMA
c. Polling
d. Aloha
Question 9 6.3-6. Characteristics of Multiple Access Protocols (c).Consider the following multiple access protocols that we've
Not answered studied: (1) TDMA, and FDMA (2) CSMA (3) Aloha, and (4) polling. For which of these protocols is the maximum
Marked out of channel utilization 1 (or very close to 1)?
1.00
a. Polling
b. CSMA and CSMA/CD
c. TDMA and FDMA
d. Aloha
Question 10 6.3-7. Characteristics of Multiple Access Protocols (d).Consider the following multiple access protocols that we've
Not answered studied: (1) TDMA, and FDMA (2) CSMA (3) Aloha, and (4) polling. For which of these protocols is there a maximum
Marked out of amount of time that a node knows that it will have to wait until it can successfully gain access to the channel?
1.00
a. Polling
b. Aloha
c. CSMA and CSMA/CD
d. TDMA and FDMA
Question 11 6.4-1. Different types of addressing (a). We've now learned about both IPv4 addresses and MAC addresses.
Not answered Consider the address properties below, and use the pulldown menu to indicate which of these properties is only a
Marked out of property of MAC addresses (and therefore is not a property of IPv4 addresses - careful!).
1.00
a. This is a 128-bit address.
b. This is a 32-bit address.
c. This address remains the same as a host moves from one network to another.
d. This is a 48-bit address.
e. This address is allocated by DHCP.
f. This address must be unique among all hosts in a subnet.
g. This is a network-layer address.
h. This is a link-layer address.
The correct answers are: This is a 48-bit address., This is a link-layer address., This address remains the same as a
host moves from one network to another.
Question 12 6.4-2. Different types of addressing (b). We've now learned about both IPv4 addresses and MAC addresses.
Not answered Consider the address properties below, and use the pulldown menu to indicate which of these properties is only a
Marked out of property of IPv4 addresses (and therefore is not a property of MAC addresses - careful!).
1.00
a. This address is allocated by DHCP.
b. This is a 32-bit address.
c. This is a 128-bit address.
d. This is a link-layer address.
e. This is a 48-bit address.
f. This is a network-layer address.
g. This address must be unique among all hosts in a subnet.
h. This address remains the same as a host moves from one network to another.
The correct answers are: This is a 32-bit address., This is a network-layer address., This address is allocated by
DHCP.
Question 13 6.4-3. Different types of addressing (c). We've now learned about both IPv4 addresses and MAC addresses.
Not answered Consider the address properties below, and use the pulldown menu to indicate which of these properties is a property
Marked out of of both IPv4 addresses and MAC addresses.
1.00
a. This address must be unique among all hosts in a subnet.
b. This address is allocated by DHCP.
c. This is a 48-bit address.
d. This is a link-layer address.
e. This is a 32-bit address.
f. This address remains the same as a host moves from one network to another.
g. This is a network-layer address.
h. This is a 128-bit address.
The correct answer is: This address must be unique among all hosts in a subnet.
Question 14 6.4-5. Switch forwarding and filtering. Suppose an Ethernet frame arrives to an Ethernet switch, and the Ethernet
Not answered switch does not know which of its switch ports leads to the node with the given destination MAC address? In this
Marked out of case, what does the switch do?
1.00
a. Choose a port randomly and forward the frame there.
b. Use the address resolution protocol (ARP) to determine the appropriate outgoing port.
c. Flood the frame on all ports except the port on which the frame arrived.
d. Drop the frame without forwarding it.
The correct answer is: Flood the frame on all ports except the port on which the frame arrived.
Question 15 6.4-6. Self-learning switches. Which of the following statements are true about a self learning switch?
Not answered
Marked out of a. A self-learning switch will age-out (forget) a self-learned association of a MAC address x and switch port y if it
1.00 doesn’t see a frame with MAC address x incoming on switch port y after some amount of time.
b. A self learning switch associates the source MAC address on an incoming frame with the port on which it
arrived, and stores this matching in a table. The switch has now learned the port that leads to that MAC
address.
c. A self-learning switch frees a network manager from a least one configuration task that might be associated
with managing a switch
d. A self-learning switch never forgets a self-learned association of a MAC address x and switch port y.
The correct answers are: A self learning switch associates the source MAC address on an incoming frame with the
port on which it arrived, and stores this matching in a table. The switch has now learned the port that leads to that
MAC address., A self-learning switch will age-out (forget) a self-learned association of a MAC address x and switch
port y if it doesn’t see a frame with MAC address x incoming on switch port y after some amount of time., A self-
learning switch frees a network manager from a least one configuration task that might be associated with managing a
switch
Question 16 6.4-7. Learning switch scenario. Consider the simple star-connected Ethernet LAN shown below, and suppose the
Not answered Ethernet switch is a learning switch, and that the switch table is initially empty. Suppose C sends an Ethernet frame
Marked out of address to C' and C ' replies back to C. How many of these two frames are also received at B's interface?
1.00
a. 2
b. 1
c. 4
d. 0
The correct answer is: 1


Question 17 6.4-8. Learning switch state removal. Consider the simple star-connected Ethernet LAN shown below, and suppose
Not answered the switch table contains entries for each of the 6 hosts. How will those entries be removed from the switch table?
Marked out of
1.00
a. They'll remain in the switch forever (or until it is re-booted).

b. An entry for a hostwill be removed if that host doesn't transmit any frames for a certain amount of time (that is,
table entries will timeout).
c. The table entry can only be removed by the network manager, who would use the SNMP protocol to remove the
entry.
d. A table entry for a host will be removed by the STPP (Switch Table Purge Protocol) which will be used by a host
to signal the switch when it (the host) is shutting down or otherwise leaving the network.
The correct answer is: An entry for a hostwill be removed if that host doesn't transmit any frames for a certain amount 
of time (that is, table entries will timeout).
Question 18 6.4-9. MAC addresses (versus other types of addresses and identifiers). Which of the following statements are
Not answered true about MAC (link-layer) addresses? Select one or more statements below.
Marked out of
1.00 a. A portion of the address bits are associated with the network to which the device is attached, and so changes
as the device moves from one network to another.
b. Generally does not change, and is associated with a device when it is manufactured/created.
c. Generally stays unchanged as a device moves from one network to another.
d. Has 32 bits.
e. Has 48 bits.
f. Is contained in a SIM card and used when a device identifies itself and connects to an LTE network.
The correct answers are: Has 48 bits., Generally stays unchanged as a device moves from one network to another.,
Generally does not change, and is associated with a device when it is manufactured/created.
◀︎Kurose_Ross_Chapter_5_KC (20) Jump to... Kurose_Ross_Chapter_7_KC (14) ▶︎

Kurose - Ross - Chapter - 6 - KC (18) - Attempt Review

Uploaded by

Document Information

Original Description:

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

Kurose - Ross - Chapter - 6 - KC (18) - Attempt Review

Uploaded by

Copyright:

Available Formats

08/02/2024, 11:12 Kurose_Ross_Chapter_6_KC (18): Attempt review

Dashboard / My courses / IT324_2023 / Kurose_Ross_Chapters_Quizzes / Kurose_Ross_Chapter_6_KC (18)

Started on Thursday, 8 February 2024, 11:12 AM

The correct answer is:

The correct answers are: TDMA and FDMA, Polling

The correct answers are: TDMA and FDMA, Polling

The correct answers are: TDMA and FDMA, Polling

The correct answers are: TDMA and FDMA, Polling

The correct answer is: 1

a. They'll remain in the switch forever (or until it is re-booted).

◀︎Kurose_Ross_Chapter_5_KC (20) Jump to... Kurose_Ross_Chapter_7_KC (14) ▶︎

You might also like