Unit 1: Introduction & Physical Structure

The Basics. If you blank out, write about "Rules of Communication."

 The "Golden" Question: OSI vs. TCP/IP Models

o OSI (7 Layers): All People Seem To Need Data Processing.

 (Application, Presentation, Session, Transport, Network, Data Link,
Physical).
o TCP/IP (4 Layers): Application, Transport, Internet, Network Access.
o Key Difference: OSI is a theoretical reference; TCP/IP is the practical model
used today.

 Switching Techniques (Very Important this year)

o Circuit Switching: Dedicated path (Telephone). No delay, but wastes

bandwidth.

o Packet Switching: No dedicated path (Internet). Data chopped into packets.

Efficient, but delays can occur.
  Topologies
o Ring: Token passing. If one cable breaks, the whole network fails. (AEIE 2025
Question).
o Star: Central Hub. If one cable breaks, only that PC is affected.


Data Flow:
1. Simplex (One way, e.g., Keyboard)
2. Half-Duplex (Walkie-Talkie)
3. Full-Duplex (Telephone)

Unit 2: Physical Level

Focus: How data moves physically.

 Transmission Media:

o Guided: Twisted Pair (LAN cables), Coaxial (TV), Fiber Optic (Light, fastest).

o Unguided: Radio waves, Microwaves (Wireless).

 Switching:

o Circuit Switching: Reserved path (e.g., Old Telephone Network). Guaranteed delivery
but wastes bandwidth.

o Packet Switching: No reserved path (e.g., Internet). Data chopped into packets;
efficient but delays can occur.

Unit 3: Data Link Layer (DLL)

Error Control & Flow Control.

 Error Detection & Correction

o CRC (Cyclic Redundancy Check): Uses binary division (XOR). Reliable
detection.
o Hamming Code (Correction): Can fix single-bit errors.
Access Control Protocols
 ALOHA:

o Pure: Send whenever. High collision.

o Slotted: Send only at start of time slot. Better.
CSMA/CD (Ethernet): Listen before talking.
If busy  Wait.
If collision  Stop & Backoff.

Unit 4: Network & Transport Layer (Crucial Unit)

Focus: IP Addresses and Traffic Control.

 IPv4 vs. IPv6:

o IPv4: 32-bit (e.g., [Link]). Checksum present.
o IPv6: 128-bit (Hexadecimal). No Checksum. Built-in security (IPSec).

Routing Algorithms
 Distance Vector (RIP): "Gossip." Shares info only with neighbours. Uses Hop Count.
Slow.
 Link State (OSPF): "Google Maps." Every router has full map. Uses Dijkstra's
algorithm. Fast.

 Congestion Control
o Leaky Bucket: Imagine a bucket with a hole. Water (packets) enters at varying
speeds but leaves at a constant rate. This smooths out "bursty" traffic.
o Token Bucket: Allows bursts if "tokens" are available.

 NAT (Network Address Translation): Maps many Private IPs to one Public IP to save
addresses and improve security.
Unit 5: Application Layer & Modern Topics

Focus: Short notes often come from here.

 Protocols (One-liners):
o DNS: Translates names ([Link] to IPs (142.250.x.x).
o SMTP: Sending email.
o FTP: Transferring files.

 Security:
o Firewall: A barrier that filters traffic between your computer and the internet.
o Digital Signature: Proves a message is authentic and hasn't been changed.
 Modern Topics:
o ISDN: Integrated Services Digital Network (Voice + Data over one line).

o ATM: Asynchronous Transfer Mode (Uses fixed-size "cells").

Q1: Explain Digital Signature. How does it provide authentication?

(Repeated: 2007, 2009, 2011, 2013)

Answer:

Definition: A Digital Signature is a mathematical technique used to validate the authenticity and
integrity of a digital message. It is the digital equivalent of a handwritten signature but is much more
secure.

How it Works (The Authentication Process): Unlike normal encryption (where we hide data), Digital
Signatures use Asymmetric Cryptography in reverse:

1. Hashing: The sender takes the original message and passes it through a Hash Function to
create a fixed-size "Message Digest" (a digital fingerprint).

2. Signing: The sender encrypts this Digest using their own Private Key. This encrypted digest is
the "Digital Signature."

3. Sending: The sender transmits both the Original Message and the Digital Signature to the
receiver.

4. Verification:

o The receiver takes the Original Message and runs the same Hash Function to get
Digest A.

o The receiver decrypts the Digital Signature using the sender's Public Key to get
Digest B.

5. Authentication Proof: If Digest A == Digest B, it proves two things:

o Authentication: The message must have come from the sender (because only their
Private Key could encrypt it).

o Integrity: The message has not been altered in transit (otherwise the hashes
wouldn't match).

Key Features:

 Non-Repudiation: The sender cannot later deny sending the message.

 Integrity: Ensures data hasn't been tampered with.

Q2: Write a Short Note on Cryptography. (Repeated: 2016, 2018, 2019)

Answer: Definition: Cryptography is the art and science of securing communication by transforming
messages into an unreadable format to prevent unauthorized access.

Types of Cryptography:

1. Symmetric Key Cryptography (Secret Key):

o Uses a single key for both encryption and decryption.

o Pros: Fast and efficient.

o Cons: Key exchange is risky (how do you share the secret key safely?).

o Examples: DES (Data Encryption Standard), AES (Advanced Encryption Standard).

2. Asymmetric Key Cryptography (Public Key):

o Uses two keys: A Public Key (shared with everyone) for encryption and a Private Key
(kept secret) for decryption.

o Pros: More secure, solves the key exchange problem.

o Cons: Slower computationally.

o Examples: RSA Algorithm.

Goals of Cryptography (The CIA Triad):

 Confidentiality: Only authorized users can read the data.

 Integrity: Data is not altered during transmission.

 Authentication: Verifying the identity of the sender.

Q4: Write a Short Note on IEEE 802.11 (Wireless LAN).

(Repeated: 2006, 2010, 2011, 2019)

Answer:

Definition: IEEE 802.11 is the set of standards that define communication for Wireless Local Area
Networks (WLANs), commonly known as Wi-Fi.

Architecture Components:

1. Station (STA): Any device with a wireless card (Laptop, Phone).

2. Access Point (AP): The base station that connects wireless devices to the wired network.

3. BSS (Basic Service Set): A group of stations communicating with one AP.

4. ESS (Extended Service Set): Multiple BSSs connected together (like roaming in a large
campus).
Medium Access Control (MAC) Technique:

 It uses CSMA/CA (Carrier Sense Multiple Access with Collision AVOIDANCE).

 Note: Unlike Ethernet which uses Collision Detection (CSMA/CD), wireless cannot listen while
sending. So, it sends a "Request to Send" (RTS) packet and waits for a "Clear to Send" (CTS)
packet before transmitting data to avoid collisions.

( PREVIOUS YEAR QUESTION )

Q4: How is CSMA/CD a clear advantage over ALOHA? (With Flowchart Logic)

(Source: Group C, Q9)

Answer: The Problem with ALOHA: In Pure ALOHA, anyone can transmit data at any time. If two
people talk at once, data crashes (Collision) and is destroyed. Throughput is very low (18%).
The CSMA/CD Advantage: CSMA/CD (Carrier Sense Multiple Access with Collision Detection) is
smarter because it follows the "Listen Before You Talk" rule.

1. Carrier Sense: The station listens to the wire. Is anyone else talking?

2. Multiple Access: If the wire is silent, it starts sending.

3. Collision Detection: If another station speaks at the exact same time, they detect the
"crash."

4. Backoff: Both stations stop, send a "Jam Signal" (to warn others), wait for a random amount
of time, and try again.