Unit 2: Physical and Data Link Layers - Subjective Questions

CSE306 — Computer Networks • Practice Questions with Detailed Answers

20 questions

1

Define data communication. Explain its basic components and the characteristics of an effective data communication system.

2

Explain simplex, half-duplex, and full-duplex modes of data communication with suitable examples.

3

State and explain the Nyquist and Shannon capacity formulas. A channel has a bandwidth of and an SNR of . Determine its maximum capacity according to Shannon's theorem and the maximum binary data rate according to Nyquist's formula.

4

Compare twisted-pair cable, coaxial cable, and optical fiber as guided transmission media.

5

Describe the construction and working of optical fiber. Distinguish between single-mode and multimode fiber.

6

Explain the construction, categories, advantages, and limitations of twisted-pair cable.

7

Classify unguided transmission media and compare radio waves, terrestrial microwaves, satellite microwaves, and infrared communication.

8

Explain ground-wave, sky-wave, and line-of-sight propagation in wireless communication.

9

What are transmission impairments? Explain attenuation, distortion, and noise.

10

Explain bandwidth, throughput, latency, transmission delay, and propagation delay. Calculate the minimum delay for transmitting a -byte frame over a link of length if the propagation speed is .

11

Describe the major functions of the data link layer, including framing, flow control, error control, and access control.

12

Explain the elementary data link protocols for an ideal noiseless channel. Compare the unrestricted simplex protocol with the simplex stop-and-wait protocol.

13

Describe the Stop-and-Wait ARQ protocol for a noisy channel. Explain the roles of sequence numbers, acknowledgments, and timers.

14

Distinguish between single-bit errors and burst errors. Explain the concepts of redundancy and minimum Hamming distance.

15

Explain even parity, odd parity, and two-dimensional parity. Discuss their error-detection capabilities and limitations.

16

Explain the one's-complement checksum method. Calculate the 8-bit checksum for the data words and .

17

Explain the Cyclic Redundancy Check algorithm. Using data and generator , determine the CRC remainder and transmitted codeword.

18

Derive the condition for the number of parity bits required in a Hamming code. Explain how Hamming code locates a single-bit error.

19

Construct a Hamming code for data using even parity. If bit position is inverted during transmission, show how the receiver detects and corrects the error.

20

Compare parity, checksum, CRC, and Hamming code as techniques for error detection and correction.