CN · Data Link & Errors interview questions

1. A.the number of differing bit positions between two codewords, determining error detection and correction power
2. B.a wireless access method that avoids collisions by waiting and signaling intent before transmitting, used by Wi-Fi
3. C.a wired access method where stations listen, transmit, detect collisions, and back off, used by classic Ethernet
4. D.grouping a stream of bits into discrete frames with clear start and end delimiters

Answer + AI explanation with a free account

1. A.piggybacking
2. B.CSMA/CA
3. C.CSMA/CD
4. D.framing

Answer + AI explanation with a free account

1. A.framing — attaching an acknowledgement onto an outgoing data frame to save a separate control frame
2. B.framing — a globally unique 48-bit hardware identifier burned into a network interface card
3. C.framing — grouping a stream of bits into discrete frames with clear start and end delimiters
4. D.framing — a wireless access method that avoids collisions by waiting and signaling intent before transmitting, used by Wi-Fi

Answer + AI explanation with a free account

1. A.the number of differing bit positions between two codewords, determining error detection and correction power
2. B.an error-detection code using polynomial division that catches burst errors better than a checksum
3. C.a globally unique 48-bit hardware identifier burned into a network interface card
4. D.a reliability scheme sending one frame and waiting for its acknowledgement before sending the next

Answer + AI explanation with a free account

1. A.Hamming code
2. B.checksum
3. C.stop-and-wait ARQ
4. D.MAC address

Answer + AI explanation with a free account

1. A.MAC address — a globally unique 48-bit hardware identifier burned into a network interface card
2. B.MAC address — a reliability scheme allowing several outstanding frames to improve throughput over stop-and-wait
3. C.MAC address — an error-correcting code that inserts parity bits at power-of-two positions to locate and fix a single-bit error
4. D.MAC address — an error-detection code using polynomial division that catches burst errors better than a checksum

Answer + AI explanation with a free account

1. A.a single appended bit making the count of ones even or odd to detect single-bit errors
2. B.an error-correcting code that inserts parity bits at power-of-two positions to locate and fix a single-bit error
3. C.the number of differing bit positions between two codewords, determining error detection and correction power
4. D.a globally unique 48-bit hardware identifier burned into a network interface card

Answer + AI explanation with a free account

1. A.stop-and-wait ARQ
2. B.CSMA/CD
3. C.MAC address
4. D.parity bit

Answer + AI explanation with a free account

1. A.parity bit — a reliability scheme allowing several outstanding frames to improve throughput over stop-and-wait
2. B.parity bit — a single appended bit making the count of ones even or odd to detect single-bit errors
3. C.parity bit — a wired access method where stations listen, transmit, detect collisions, and back off, used by classic Ethernet
4. D.parity bit — attaching an acknowledgement onto an outgoing data frame to save a separate control frame

Answer + AI explanation with a free account

1. A.attaching an acknowledgement onto an outgoing data frame to save a separate control frame
2. B.a reliability scheme sending one frame and waiting for its acknowledgement before sending the next
3. C.the number of differing bit positions between two codewords, determining error detection and correction power
4. D.a summed value of a data block sent alongside it so the receiver can detect corruption

Answer + AI explanation with a free account

1. A.CSMA/CA
2. B.cyclic redundancy check (CRC)
3. C.framing
4. D.checksum

Answer + AI explanation with a free account

1. A.checksum — a single appended bit making the count of ones even or odd to detect single-bit errors
2. B.checksum — a wired access method where stations listen, transmit, detect collisions, and back off, used by classic Ethernet
3. C.checksum — an error-detection code using polynomial division that catches burst errors better than a checksum
4. D.checksum — a summed value of a data block sent alongside it so the receiver can detect corruption

Answer + AI explanation with a free account

1. A.an error-detection code using polynomial division that catches burst errors better than a checksum
2. B.a single appended bit making the count of ones even or odd to detect single-bit errors
3. C.the number of differing bit positions between two codewords, determining error detection and correction power
4. D.a wired access method where stations listen, transmit, detect collisions, and back off, used by classic Ethernet

Answer + AI explanation with a free account

1. A.CSMA/CD
2. B.framing
3. C.piggybacking
4. D.Hamming code

Answer + AI explanation with a free account

1. A.CSMA/CD — a reliability scheme sending one frame and waiting for its acknowledgement before sending the next
2. B.CSMA/CD — grouping a stream of bits into discrete frames with clear start and end delimiters
3. C.CSMA/CD — a wired access method where stations listen, transmit, detect collisions, and back off, used by classic Ethernet
4. D.CSMA/CD — a reliability scheme allowing several outstanding frames to improve throughput over stop-and-wait

Answer + AI explanation with a free account

1. A.a reliability scheme sending one frame and waiting for its acknowledgement before sending the next
2. B.a wired access method where stations listen, transmit, detect collisions, and back off, used by classic Ethernet
3. C.a wireless access method that avoids collisions by waiting and signaling intent before transmitting, used by Wi-Fi
4. D.a single appended bit making the count of ones even or odd to detect single-bit errors

Answer + AI explanation with a free account

1. A.sliding window ARQ
2. B.CSMA/CD
3. C.CSMA/CA
4. D.Hamming distance

Answer + AI explanation with a free account

1. A.CSMA/CA — a globally unique 48-bit hardware identifier burned into a network interface card
2. B.CSMA/CA — an error-detection code using polynomial division that catches burst errors better than a checksum
3. C.CSMA/CA — a wireless access method that avoids collisions by waiting and signaling intent before transmitting, used by Wi-Fi
4. D.CSMA/CA — attaching an acknowledgement onto an outgoing data frame to save a separate control frame

Answer + AI explanation with a free account

1. A.a single appended bit making the count of ones even or odd to detect single-bit errors
2. B.an error-detection code using polynomial division that catches burst errors better than a checksum
3. C.a wired access method where stations listen, transmit, detect collisions, and back off, used by classic Ethernet
4. D.a globally unique 48-bit hardware identifier burned into a network interface card

Answer + AI explanation with a free account

1. A.stop-and-wait ARQ
2. B.CSMA/CA
3. C.sliding window ARQ
4. D.cyclic redundancy check (CRC)

Answer + AI explanation with a free account

1. A.cyclic redundancy check (CRC) — an error-detection code using polynomial division that catches burst errors better than a checksum
2. B.cyclic redundancy check (CRC) — the number of differing bit positions between two codewords, determining error detection and correction power
3. C.cyclic redundancy check (CRC) — an error-correcting code that inserts parity bits at power-of-two positions to locate and fix a single-bit error
4. D.cyclic redundancy check (CRC) — grouping a stream of bits into discrete frames with clear start and end delimiters

Answer + AI explanation with a free account

1. A.grouping a stream of bits into discrete frames with clear start and end delimiters
2. B.a wired access method where stations listen, transmit, detect collisions, and back off, used by classic Ethernet
3. C.the number of differing bit positions between two codewords, determining error detection and correction power
4. D.a reliability scheme sending one frame and waiting for its acknowledgement before sending the next

Answer + AI explanation with a free account

1. A.Hamming distance
2. B.sliding window ARQ
3. C.framing
4. D.stop-and-wait ARQ

Answer + AI explanation with a free account

1. A.stop-and-wait ARQ — a reliability scheme allowing several outstanding frames to improve throughput over stop-and-wait
2. B.stop-and-wait ARQ — a reliability scheme sending one frame and waiting for its acknowledgement before sending the next
3. C.stop-and-wait ARQ — an error-detection code using polynomial division that catches burst errors better than a checksum
4. D.stop-and-wait ARQ — a single appended bit making the count of ones even or odd to detect single-bit errors

Answer + AI explanation with a free account

1. A.an error-detection code using polynomial division that catches burst errors better than a checksum
2. B.a wired access method where stations listen, transmit, detect collisions, and back off, used by classic Ethernet
3. C.a reliability scheme allowing several outstanding frames to improve throughput over stop-and-wait
4. D.a reliability scheme sending one frame and waiting for its acknowledgement before sending the next

Answer + AI explanation with a free account

1. A.cyclic redundancy check (CRC)
2. B.MAC address
3. C.sliding window ARQ
4. D.checksum

Answer + AI explanation with a free account

1. A.sliding window ARQ — the number of differing bit positions between two codewords, determining error detection and correction power
2. B.sliding window ARQ — grouping a stream of bits into discrete frames with clear start and end delimiters
3. C.sliding window ARQ — a reliability scheme allowing several outstanding frames to improve throughput over stop-and-wait
4. D.sliding window ARQ — a wired access method where stations listen, transmit, detect collisions, and back off, used by classic Ethernet

Answer + AI explanation with a free account

1. A.the number of differing bit positions between two codewords, determining error detection and correction power
2. B.a wired access method where stations listen, transmit, detect collisions, and back off, used by classic Ethernet
3. C.a reliability scheme sending one frame and waiting for its acknowledgement before sending the next
4. D.a summed value of a data block sent alongside it so the receiver can detect corruption

Answer + AI explanation with a free account

1. A.checksum
2. B.Hamming distance
3. C.Hamming code
4. D.CSMA/CD

Answer + AI explanation with a free account

1. A.Hamming distance — a single appended bit making the count of ones even or odd to detect single-bit errors
2. B.Hamming distance — the number of differing bit positions between two codewords, determining error detection and correction power
3. C.Hamming distance — grouping a stream of bits into discrete frames with clear start and end delimiters
4. D.Hamming distance — a globally unique 48-bit hardware identifier burned into a network interface card

Answer + AI explanation with a free account