Data Communication & Networking – Complete Q&A

Data Communication & Networking

Comprehensive Question & Answer Guide

Covering all 30 Topics in Data Communication and Networking

Q1. Role of Checksum in Error Detection

A checksum is a value computed from a block of data and appended to it before transmission. The
receiver recomputes the checksum from the received data and compares it with the transmitted
checksum. If they match, data is assumed error-free; otherwise, an error is detected.

How it Works:
• Sender divides data into fixed-size segments (e.g., 8-bit or 16-bit words).
• All segments are added using binary addition (ones complement for Internet checksum).
• The ones complement of the sum is appended as the checksum.
• Receiver adds all segments including the checksum. A result of all 1s indicates no error.

Key Properties:
• Detects all single-bit errors and most burst errors.
• Cannot detect errors that cancel each other out (same position, complementary bits).
• Used in TCP, UDP, and IP protocols.

Q2. Simplex, Half-Duplex, and Full-Duplex Communication

Mode Data Flow Example Efficiency
Simplex One direction only TV broadcast, keyboard Low – no feedback
to CPU possible

Page
Data Communication & Networking – Complete Q&A

Half-Duplex Both directions, but one Walkie-Talkie, CB Radio Moderate – turn-based

at a time communication
Full-Duplex Both directions Telephone, modern High – no waiting
simultaneously Ethernet required

Full-duplex provides the highest efficiency as both parties communicate simultaneously, eliminating the
overhead of turn management. Half-duplex has overhead due to switching direction. Simplex is efficient
in one direction only.

Q3. Error Detection vs. Error Correction

Aspect Error Detection Error Correction
Definition Identifies that an error has occurred Identifies and fixes the error
Technique Parity bits, CRC, Checksum Hamming Code, Reed-Solomon
Overhead Low redundancy bits needed High redundancy bits needed
Action on Error Requests retransmission (ARQ) Corrects bit(s) autonomously (FEC)
Use Case Wired networks (reliable) Wireless, satellite (high noise)

Q4. Stop-and-Wait ARQ vs. Sliding Window Protocol

Stop-and-Wait ARQ:
The sender transmits one frame and waits for an acknowledgment (ACK) before sending the next. If no
ACK is received within a timeout, the frame is retransmitted.
• Simple and easy to implement.
• Very inefficient — channel is idle while waiting for ACK.
• Efficiency = T_transmission / (T_transmission + 2 × T_propagation)

Sliding Window Protocol:

Multiple frames can be in transit simultaneously without waiting for individual ACKs. A 'window' defines
the maximum number of unacknowledged frames allowed.
• Sender window (Ws) = number of frames sent before ACK needed.
• Two variants: Go-Back-N (retransmit from error) and Selective Repeat (retransmit only error
frame).
• Significantly higher throughput than Stop-and-Wait.
• Efficiency = W / (1 + 2a) where a = T_propagation / T_transmission, W = window size.

Q5. The Seven Layers of the OSI Reference Model

Layer Name Function
7 Application Interface for user applications (HTTP, FTP, SMTP, DNS)

Page
Data Communication & Networking – Complete Q&A

6 Presentation Data translation, encryption, compression (JPEG, ASCII, SSL)

5 Session Session management, synchronization, dialog control
4 Transport End-to-end delivery, flow control, error control (TCP, UDP)
3 Network Logical addressing, routing, path determination (IP, ICMP)
2 Data Link Framing, MAC addressing, error detection (Ethernet, PPP)
1 Physical Bit transmission over physical media (cables, signals, voltage)

Q6. 2-D Parity Check Transmission

Original Data:
Row 1: 1 0 1 1 0 0 1 1
Row 2: 1 0 0 1 0 0 1 0
Row 3: 1 0 1 1 0 1 1 0

Step 1: Row Parity (Even Parity – count of 1s must be even):

Row 1: 1 0 1 1 0 0 1 1 → 1s count = 5 (odd) → Row parity = 1
Row 2: 1 0 0 1 0 0 1 0 → 1s count = 3 (odd) → Row parity = 1
Row 3: 1 0 1 1 0 1 1 0 → 1s count = 5 (odd) → Row parity = 1

Step 2: Column Parity (Even Parity):

Col: 1 0 1 1 0 0 1 1 1 1
1 0 0 1 0 0 1 0 1
1 0 1 1 0 1 1 0 1
Sum: 3 0 2 3 0 1 3 1
Parity: 1 0 0 1 0 1 1 1 ← Column parity row

Final Transmitted Block:

1 0 1 1 0 0 1 1 | 1
1 0 0 1 0 0 1 0 | 1
1 0 1 1 0 1 1 0 | 1
─────────────────────
1 0 0 1 0 1 1 1 | 0 ← Column parity row (last bit = overall parity)

Q7. Concept of Data Communication and Its Characteristics

Data communication refers to the exchange of data between two devices via a transmission medium.
The effectiveness of a data communication system depends on four fundamental characteristics:

Scenario: Two computers exchanging data over a network

• Delivery: Data must be delivered to the correct destination. In our scenario, the file must reach
Computer B, not any other device.
• Accuracy: The received data must be identical to the sent data — no bit errors. Error
detection/correction mechanisms ensure this.
• Timeliness: Data must arrive within a required time frame. Real-time applications like video calls
demand low latency delivery.

Page
Data Communication & Networking – Complete Q&A

• Jitter: Variation in packet arrival time. In audio/video streaming, inconsistent delivery intervals
cause quality degradation.

Components of Data Communication:

• Message – the data/information being transmitted
• Sender – the device that sends the data
• Receiver – the device that receives the data
• Transmission Medium – the physical path (wire, fiber, wireless)
• Protocol – the set of rules governing the communication

Q8. Role of TCP/IP Model in the Internet and Comparison with OSI
TCP/IP Model Layers and Functions:
TCP/IP Layer Equivalent OSI Layers Function
Application Application + Presentation + HTTP, FTP, DNS, SMTP, Telnet
Session
Transport Transport TCP (reliable), UDP (fast, unreliable)
Internet Network IP addressing, routing (IPv4/IPv6, ICMP,
ARP)
Network Access Data Link + Physical Ethernet, Wi-Fi, frame formatting, MAC

Key Points:
• TCP/IP is the practical protocol suite that powers the Internet; OSI is a theoretical reference
model.
• TCP ensures reliable, ordered delivery with handshaking, flow control, and congestion control.
• IP provides logical addressing and best-effort packet delivery across heterogeneous networks.
• OSI has 7 layers; TCP/IP has 4 layers — Application, Presentation, and Session are merged
into one Application layer.

Q9. Comparison of Bus, Star, Ring, and Mesh Topologies

Topology Fault Tolerance Scalability Transmission Cost
Delay
Bus Low – cable failure Poor – limited Low at low load, Low
breaks all nodes high with
contention
Star High – only one node Excellent – easy Low – direct hub Moderate
affected to add nodes connection
Ring Moderate – one Moderate – Predictable with Moderate
failure can break ring disrupts ring to token passing
add
Mesh Very High – Good but Low – multiple High

Page
Data Communication & Networking – Complete Q&A

redundant paths complex paths available

• Bus: Simple and cheap but poor fault tolerance. Suitable for small, temporary networks.
• Star: Most widely used today. Easy management and good fault isolation.
• Ring: Used in older token ring and SONET networks. Deterministic delay.
• Mesh: Used in WANs and critical infrastructure. Maximum reliability but expensive.

Q10. Error Detection and Its Techniques

Error detection is the process of identifying errors in transmitted data without correcting them. Common
techniques:

1. Parity Check
• Single-bit parity: Adds 1 bit to make count of 1s even (even parity) or odd (odd parity).
• Detects odd number of bit errors only.

2. Cyclic Redundancy Check (CRC)

• Based on polynomial division. Sender appends CRC remainder to data.
• Receiver divides received data by same polynomial; non-zero remainder = error.
• Very powerful — detects burst errors up to the degree of the generator polynomial.

3. Checksum
• Segments are summed (ones complement). Sum's complement is the checksum.
• Receiver sums all including checksum; result should be all 1s.
• Used in IP, TCP, UDP headers.

4. Two-Dimensional (2D) Parity

• Applies parity to both rows and columns of a data block.
• Can detect and locate single-bit errors (pinpoints row and column).

Q11. Analog-to-Digital and Digital-to-Analog Conversion

Analog-to-Digital Conversion (ADC):
Converts continuous analog signals into discrete digital data. Steps:
1. Sampling: Measure analog signal at regular intervals (Nyquist rate = 2 × max frequency).
2. Quantization: Assign each sample to the nearest discrete level.
3. Encoding: Represent each quantized value as binary bits.
Example: Voice (analog) converted to PCM digital signal for VoIP.

Digital-to-Analog Conversion (DAC):

Converts digital data into an analog signal for transmission over analog media. Techniques:
• ASK (Amplitude Shift Keying) – varies amplitude for 0 and 1
• FSK (Frequency Shift Keying) – varies frequency for 0 and 1
• PSK (Phase Shift Keying) – varies phase for 0 and 1
• QAM (Quadrature Amplitude Modulation) – varies both amplitude and phase
Page
Data Communication & Networking – Complete Q&A

Q12. Digital Data Transmission System Design for Campus Network

Design Requirements:
A campus network must support high-speed reliable communication across multiple buildings, labs, and
administrative offices with scalability and fault tolerance.

1. Transmission Media:
• Backbone (inter-building): Single-mode optical fiber — highest bandwidth (up to 100 Gbps), low
attenuation, immune to EMI. Justified for long distances and high reliability.
• Horizontal (within floors): Cat6A UTP cables — supports 10 Gbps up to 100m. Cost-effective for
LAN environments.
• Wireless (mobility areas): 802.11ax (Wi-Fi 6) for lecture halls and open spaces.

2. Line Coding:
• Non-Return-to-Zero Inverted (NRZ-I): Self-clocking, handles long sequences of 1s well.
• 4B/5B encoding: Used with NRZ-I to eliminate long runs of zeros, improving synchronization.

3. Digital Modulation:
• QAM-64 on optical links: 6 bits per symbol, maximizing throughput over fiber.
• OFDM (Orthogonal Frequency Division Multiplexing) for Wi-Fi 6: Resistant to multipath fading,
high spectral efficiency.

Justification:
Fiber backbone ensures high reliability and minimal signal loss. NRZ-I with 4B/5B ensures clock
synchronization. QAM and OFDM maximize data rates. Redundant links on star topology ensure fault
tolerance. This design achieves optimal data rates (10–100 Gbps backbone) with high reliability.

Q13. Two-Dimensional Parity Check in Error Detection

2D parity extends simple parity to a matrix of bits. Data is arranged in rows and columns. Parity bits are
added for each row and each column.

Procedure:
4. Arrange data bits in a 2D grid (matrix).
5. Calculate row parity for each row (even or odd parity).
6. Calculate column parity for each column.
7. Append row parity bits to end of each row and column parity bits as a final row.

Error Detection Capability:

• Detects all single-bit errors and can LOCATE them (identified row + column intersection).
• Detects all burst errors of length ≤ n (where n = number of columns).
• Can detect most 2-bit errors but cannot detect all 4-bit error patterns.
• The bottom-right parity bit (corner bit) provides overall block parity.

Q14. Meaning of Line Coding

Page
Data Communication & Networking – Complete Q&A

Line coding is the process of converting digital data (binary bits) into digital signals for transmission
over a communication channel.

Purpose:
• Enables digital data to be transmitted over physical media.
• Provides self-clocking to synchronize sender and receiver.
• Eliminates DC components that are problematic for some media.
• Provides error detection capability in some schemes.

Requirements of a Good Line Code:

• No DC component (zero average voltage).
• Self-synchronization (clock information embedded in signal).
• Error detection capability.
• Narrow bandwidth for efficient use of spectrum.
• Resistance to noise and signal degradation.

Types:
• Unipolar: Only positive voltages (NRZ)
• Polar: Both positive and negative voltages (NRZ-L, NRZ-I, RZ, Manchester)
• Bipolar: Three voltage levels (+, 0, –) (AMI, Pseudoternary)

Q15. Piggybacking and Go-Back-N ARQ

Piggybacking:
Piggybacking is a technique where the acknowledgment (ACK) for received data is included in the
outgoing data frame rather than being sent as a separate frame. This improves efficiency by reducing
protocol overhead.
• Example: Node A sends data to B. When B has its own data to send to A, it attaches the ACK
for A's data within its own data frame.
• Reduces the number of frames transmitted, saving bandwidth.
• Used in full-duplex protocols like TCP.

Go-Back-N ARQ:
Go-Back-N is a sliding window protocol where the sender can transmit up to N frames before requiring
an ACK. On detecting an error:
• The receiver discards the erroneous frame AND all subsequent frames.
• The sender retransmits from the erroneous frame onward (goes back N).
• Window size W ≤ 2^n – 1 where n = number of bits in sequence number.
• Simple receiver but potentially wasteful if error rate is high.

Q16. ALOHA and Its Types

ALOHA is a random access protocol that allows multiple stations to share a communication channel
without centralized coordination.

Pure ALOHA:

Page
Data Communication & Networking – Complete Q&A

• Any station can transmit at any time.

• If collision occurs, stations wait a random time and retransmit.
• Maximum efficiency: 18.4% (throughput S = G × e^(-2G), maximum at G = 0.5).
• Very simple but highly inefficient with heavy traffic.

Slotted ALOHA:
• Time is divided into equal slots. Stations can only transmit at the beginning of a slot.
• Reduces probability of partial collisions.
• Maximum efficiency: 36.8% (S = G × e^(-G), maximum at G = 1).
• Doubles the efficiency of Pure ALOHA but requires time synchronization.
Feature Pure ALOHA Slotted ALOHA
Transmission Time Any time Start of time slot only
Max Throughput 18.4% 36.8%
Optimal Load (G) 0.5 1.0
Synchronization Not required Required
Collision Type Partial + full Full overlaps only

Q17. Comparative Analysis of ASK, FSK, and PSK

Feature ASK FSK PSK
Principle Varies amplitude Varies frequency Varies phase
Bandwidth Narrow but sensitive Wide (2 frequencies) Narrower (same freq)
Noise Immunity Poor (amplitude Better (freq stable) Best (phase detection)
affected)
Error Performance High BER in noisy env. Moderate BER Lowest BER
Complexity Simple Moderate Complex
Applications Optical fiber, RFID FM radio, modems Wi-Fi, 4G/5G, Bluetooth

Recommendation for Modern Wireless Systems:

• Use PSK (specifically QPSK or 8-PSK) as the baseline for most wireless systems due to
superior noise immunity.
• Use QAM (which combines ASK + PSK) for high-throughput applications like LTE, Wi-Fi 6, and
5G NR.
• Use FSK for lower-data-rate IoT applications (Bluetooth LE, LoRa) where simplicity and
robustness matter over bandwidth.

Q18. Shannon's Capacity Theorem Analysis

Given:
• Bandwidth (B) = 4 kHz
Page
Data Communication & Networking – Complete Q&A

• SNR = 24 dB

Step 1: Convert SNR from dB to linear:

SNR (dB) = 10 × log₁₀(SNR)
24 = 10 × log₁₀(SNR)
log₁₀(SNR) = 2.4
SNR = 10^2.4 ≈ 251.19

Step 2: Apply Shannon's Capacity Formula:

C = B × log₂(1 + SNR)
C = 4000 × log₂(1 + 251.19)
C = 4000 × log₂(252.19)
C = 4000 × 7.978
C ≈ 31,912 bps ≈ 31.9 kbps

Assessment with Nyquist Theorem:

Nyquist rate: C = 2B × log₂(M) where M = number of signal levels.
31,912 = 2 × 4000 × log₂(M)
log₂(M) = 3.989 → M ≈ 16 levels
This requires 16-QAM or 16-PSK, which is achievable in practice with modern modems. However, this
is the theoretical maximum — practical systems achieve 60–80% of Shannon's limit due to
implementation overhead, inter-symbol interference, and real-world noise conditions.

Q19. Digital Modulation

Digital modulation is the process of converting digital data (0s and 1s) into an analog signal suitable for
transmission over analog communication channels by varying properties of a carrier wave.

Core Techniques:
• ASK (Amplitude Shift Keying): Carrier amplitude changes for 0 and 1.
• FSK (Frequency Shift Keying): Carrier frequency changes for 0 and 1.
• PSK (Phase Shift Keying): Carrier phase changes for 0 and 1.
• QAM (Quadrature Amplitude Modulation): Both amplitude and phase vary simultaneously.

Key Concepts:
• Bit rate: Number of bits transmitted per second (bps).
• Baud rate: Number of signal changes per second (symbols/sec).
• Bit rate = Baud rate × log₂(M), where M = number of signal states.
• Higher-order modulation (64-QAM, 256-QAM) transmits more bits per symbol but requires
better SNR.

Q20. Periodic Analog Signals

A periodic analog signal is one that completes a pattern (cycle) within a measurable time frame and
repeats that pattern over time. The most fundamental form is the sine wave.

Characteristics of a Sine Wave:

• Amplitude (A): Peak value of the signal. Measured in volts. Represents signal strength/energy.

Page
Data Communication & Networking – Complete Q&A

• Frequency (f): Number of cycles per second. Measured in Hertz (Hz). f = 1/T.
• Period (T): Time to complete one full cycle. T = 1/f.
• Phase (φ): Position of the waveform relative to time zero. Measured in degrees or radians.
• Wavelength (λ): Distance a signal travels in one period. λ = v/f, where v = propagation speed.

Mathematical Expression:
s(t) = A × sin(2πft + φ)
Composite signals (non-sinusoidal periodic signals) can be decomposed into multiple sine waves of
different frequencies using Fourier analysis. This is the basis for understanding bandwidth requirements
of signals.

Q21. Standardized Polynomial Code

A standardized polynomial code (also known as a generator polynomial) is a predefined divisor
polynomial used in CRC (Cyclic Redundancy Check) error detection. These are standardized by
IEEE/ISO for interoperability.

Common Standardized CRC Polynomials:

Standard Polynomial Application
CRC-8 x⁸ + x² + x + 1 ATM header, DVB
CRC-12 x¹² + x¹¹ + x³ + x + 1 Telecom
CRC-16 x¹⁶ + x¹⁵ + x² + 1 HDLC, USB
CRC-32 x³² + x²⁶ + x²³ + ... + 1 Ethernet, ZIP, PNG
CRC-CCITT x¹⁶ + x¹² + x⁵ + 1 X.25, Bluetooth

The CRC process involves treating data as a polynomial, dividing by the generator polynomial, and
appending the remainder. The receiver performs the same division; a zero remainder confirms error-
free transmission.

Q22. CSMA/CD and CSMA/CA

CSMA/CD (Carrier Sense Multiple Access with Collision Detection):
• Used in: Wired Ethernet (IEEE 802.3).
• Process: Station senses channel before transmitting. If free, it transmits. If collision detected
during transmission, all stations stop, send jam signal, wait random backoff time, then retry.
• Collision detection: Requires the transmitting station to monitor the channel during transmission.
• Limitation: Cannot be used in wireless (collision cannot be detected while transmitting).

CSMA/CA (Carrier Sense Multiple Access with Collision Avoidance):

• Used in: Wireless LAN (IEEE 802.11 Wi-Fi).
• Process: Station senses channel. If idle, waits an IFS (Inter-Frame Space), then sends RTS
(Request to Send). Receives CTS (Clear to Send) before transmitting.
• Uses ACK-based confirmation since collisions cannot be detected wirelessly.
• Avoids collisions proactively (before they happen) vs CD which detects after.
Page
Data Communication & Networking – Complete Q&A

Feature CSMA/CD CSMA/CA

Medium Wired (Ethernet) Wireless (Wi-Fi)
Strategy Detect collisions Avoid collisions
Efficiency High in low traffic Lower due to overhead
Standard IEEE 802.3 IEEE 802.11

Q23. Key Differences Between Analog and Digital Signals

Aspect Analog Signal Digital Signal
Nature Continuous, infinite values Discrete, finite values (0 and 1)
Representation Sine waves, smooth curves Square waves, pulses
Noise Immunity Poor – noise degrades quality High – regenerated to clean 0/1
Transmission Distance Degrades with distance Can be regenerated perfectly
Bandwidth Less bandwidth for voice More bandwidth for same data
Processing Harder to process/store Easy digital processing
Examples AM/FM radio, telephone lines Ethernet, USB, Wi-Fi

Q24. Network Classification Based on Geographical Area

1. PAN (Personal Area Network):
• Range: ~1–10 meters. Technologies: Bluetooth, Zigbee, IrDA.
• Example: Smartphone connected to wireless earbuds or smartwatch.

2. LAN (Local Area Network):

• Range: Building or campus (~1 km). Technologies: Ethernet (802.3), Wi-Fi (802.11).
• Example: Office network connecting computers, printers, and servers.

3. MAN (Metropolitan Area Network):

• Range: City or metropolitan area (~10–50 km). Technologies: WiMAX, fiber rings.
• Example: Cable TV networks, city-wide fiber broadband infrastructure.

4. WAN (Wide Area Network):

• Range: Country or global scale. Technologies: MPLS, SD-WAN, leased lines, satellite.
• Example: The Internet, corporate networks spanning multiple countries.

5. GAN (Global Area Network):

• Range: Worldwide including satellite networks.
• Example: GPS systems, international airline booking systems.

Page
Data Communication & Networking – Complete Q&A

Q25. Error Correction Methods

Error correction detects and fixes errors in received data without requiring retransmission. Two main
approaches:

1. Forward Error Correction (FEC):

Sender adds redundant bits. Receiver uses them to detect and correct errors autonomously.
• Hamming Code: Adds parity bits at positions 1, 2, 4, 8, ... Can correct 1-bit errors and detect 2-
bit errors. Formula: 2^r ≥ m + r + 1 (r = parity bits, m = data bits).
• Reed-Solomon Code: Corrects burst errors. Used in CDs, DVDs, QR codes, deep-space
communication.
• Turbo Codes & LDPC: Near Shannon-limit performance. Used in 3G/4G/5G and satellite.

2. Backward Error Correction (ARQ – Automatic Repeat Request):

• Stop-and-Wait ARQ: Sender waits for ACK after each frame.
• Go-Back-N ARQ: Retransmits from erroneous frame onward.
• Selective Repeat ARQ: Retransmits only the erroneous frame — most efficient.

Q26. Line Coding – Need and Wave Diagrams

Need for Line Coding:
• To represent digital data as a digital signal for physical transmission.
• To ensure synchronization between transmitter and receiver.
• To eliminate DC components that cause transformer coupling problems.
• To provide error detection and self-clocking properties.

Binary Sequence: 0 1 1 1 0 1 1 0

Wave Diagram Descriptions:

The following descriptions represent each line encoding for the binary sequence 0 1 1 1 0 1 1 0:

(1) NRZ-L (Non-Return-to-Zero Level):

• Logic 0 → High voltage (+V)
• Logic 1 → Low voltage (–V)
Bits: 0 1 1 1 0 1 1 0
Signal: +V -V -V -V +V -V -V +V

(2) NRZ-I (Non-Return-to-Zero Inverted):

• Transition at start of bit period for 1; no transition for 0.
• Start assumed: initial level = +V
Bits: 0 1 1 1 0 1 1 0
Signal: +V -V +V -V -V +V -V -V
(no trans)(trans)(trans)(trans)(no)(trans)(trans)(no trans)

(3) Polar RZ (Return-to-Zero):

• 1 → +V for first half, 0 for second half
• 0 → –V for first half, 0 for second half

Page
Data Communication & Networking – Complete Q&A

Bits: 0 1 1 1 0 1 1 0
Signal: -V,0 +V,0 +V,0 +V,0 -V,0 +V,0 +V,0 -V,0

(4) Manchester (IEEE 802.3):

• 0 → High-to-Low transition at mid-bit
• 1 → Low-to-High transition at mid-bit
Bits: 0 1 1 1 0 1 1 0
Signal: H→L L→H L→H L→H H→L L→H L→H H→L

(5) Differential Manchester (IEEE 802.5):

• Always a transition at the middle of each bit period (for clocking).
• 0 → Transition at the START of the bit period (in addition to mid)
• 1 → No transition at START of the bit period
Bits: 0 1 1 1 0 1 1 0
Trans: Yes No No No Yes No No Yes
(Start) Trans (mid always transitions for all bits)

Q27. Checksum Explanation and Calculation

Checksum Explained:
The checksum is an error-detection mechanism that adds all data segments (in ones complement
arithmetic) and appends the ones complement of the sum. The receiver adds all received segments
including the checksum; a result of all 1s confirms no error.

Problem: Message = 1001110010100011 using 4-bit words

Step 1: Divide into 4-bit words:
Word 1: 1001
Word 2: 1100
Word 3: 1010
Word 4: 0011

Step 2: Add in ones complement:

1001
+ 1100
──────
= 10101 → Carry wraps: 0101 + 1 = 0110

0110
+ 1010
──────
= 10000 → Carry wraps: 0000 + 1 = 0001

0001
+ 0011
──────
= 0100 (no carry)

Step 3: Checksum = Ones complement of sum:

Page
Data Communication & Networking – Complete Q&A

Sum = 0100
Checksum = 1011 ← This is appended and transmitted

Verification at Receiver:
1001 + 1100 + 1010 + 0011 + 1011 = 1111 (all ones → No error)

Q28. Delay Comparison: Pure ALOHA vs Slotted ALOHA at Low Load

At low load, Pure ALOHA has LESS delay than Slotted ALOHA.

Explanation:
• In Pure ALOHA, a station can transmit immediately whenever it has data. There is no waiting for
a time slot boundary.
• In Slotted ALOHA, a station must wait until the beginning of the next time slot even if the
channel is free right now. This introduces an average waiting time of T/2 (half a slot) before
transmission.
• At low load, collisions are rare in both protocols. Pure ALOHA's immediate transmission wins on
delay.
• The delay advantage of Pure ALOHA disappears at high load because its higher collision rate
(lower efficiency at 18.4% vs 36.8%) leads to more retransmissions and thus higher overall
delays.

Summary:
Condition Lower Delay Reason
Low Load Pure ALOHA No need to wait for slot boundary
High Load Slotted ALOHA Fewer collisions due to
synchronization

Q29. Definitions of Key Terms

i) Jitter:
Variation in the delay (latency) of received packets. In real-time applications like VoIP and video
streaming, jitter causes irregular playback. Measured in milliseconds. Managed using jitter buffers.

ii) Switch:
A Layer 2 (Data Link) device that forwards frames based on MAC addresses. Operates in full-duplex,
creates separate collision domains for each port, and uses a MAC address table to intelligently forward
traffic only to the destination port.

iii) Modem:
Modulator-Demodulator. A device that converts digital data to analog signals for transmission over
analog lines (modulation) and converts incoming analog signals back to digital (demodulation). Used for
DSL, cable internet, and dial-up connections.

iv) POP3 (Post Office Protocol version 3):

Page
Data Communication & Networking – Complete Q&A

An application layer email retrieval protocol. POP3 downloads emails from the server to the client and
typically deletes them from the server. Works on port 110 (or 995 for SSL). Simpler but less feature-rich
than IMAP.

v) TCP Header:
The TCP header is 20–60 bytes and contains: Source Port (16 bits), Destination Port (16 bits),
Sequence Number (32 bits), Acknowledgment Number (32 bits), Header Length (4 bits), Flags (URG,
ACK, PSH, RST, SYN, FIN), Window Size (16 bits), Checksum (16 bits), Urgent Pointer, and Options.

vi) Single-bit Error and Burst Error:

• Single-bit Error: Only one bit in a data unit is changed from 1 to 0 or 0 to 1. Rare in serial
transmission.
• Burst Error: Two or more bits in the data unit are corrupted. The length of a burst is measured
from first to last corrupted bit. More common in real communication due to noise occurring in
bursts.

vii) Framing:
Framing is a Data Link Layer function that divides the bitstream received from the Network layer into
manageable data units called frames. It adds header and trailer bits (flags) to mark the beginning and
end of each frame. Common methods: Character count, Flag bytes with stuffing, Bit stuffing.

viii) UDP (User Datagram Protocol):

A Transport Layer protocol that provides connectionless, unreliable communication. No handshaking,
no guarantee of delivery, order, or error correction. Very low overhead. Used for DNS, DHCP, VoIP,
video streaming, and online gaming where speed is more critical than reliability.

Q30. Network Topology – Types and Diagrams

Network topology refers to the arrangement of nodes and connections in a computer network. It can be
physical (actual layout) or logical (data flow pattern).

1. Bus Topology:
All nodes connect to a single shared backbone cable. Data travels in both directions and is received by
all nodes.
Node1 --- Node2 --- Node3 --- Node4 --- Node5
(All connected to one backbone)
• Pros: Simple, inexpensive, easy to install.
• Cons: Single point of failure (backbone), performance degrades with more nodes, difficult to
troubleshoot.

2. Star Topology:
All nodes connect to a central hub or switch. All communication passes through the central device.
Node1
|
Node4 --- HUB --- Node2
|
Node3
• Pros: Easy fault isolation, easy to add/remove nodes, failure of one node doesn't affect others.
• Cons: Central hub is a single point of failure, requires more cabling than bus.

Page
Data Communication & Networking – Complete Q&A

3. Ring Topology:
Nodes are connected in a closed loop. Data travels in one direction (or both in dual ring).
Node1 → Node2 → Node3 → Node4 → (back to Node1)
• Pros: Equal access, predictable performance, token passing prevents collisions.
• Cons: One node failure can break the ring (unless dual ring), adding nodes disrupts network.

4. Mesh Topology:
Every node has a dedicated point-to-point link to every other node (full mesh) or some nodes (partial
mesh).
Node1 ──── Node2
| ╲ ╱ |
| ╳ |
| ╱ ╲ |
Node4 ──── Node3
• Pros: Maximum fault tolerance, multiple paths, high reliability.
• Cons: Very expensive (n(n–1)/2 links for n nodes), complex installation.

5. Hybrid Topology:
Combination of two or more topology types. For example, Star-Bus (star networks connected by a bus
backbone) commonly used in enterprise networks.
Topology Nodes Links needed Fault Tolerance Common Use
Bus n 1 Low Old Ethernet
Star n n High Modern LAN
Ring n n Moderate Token Ring, SONET
Mesh (Full) n n(n–1)/2 Very High WAN, Internet core
Hybrid n Varies High Enterprise networks

— End of Document —

Page