Computer Networks for GATE CS – Complete Notes and Topic-wise Study Guide
Why Study Computer Networks for GATE CS?
- Computer Networks carries 6–8 marks in GATE CS every year
- IP addressing and subnetting appear in almost every paper
- TCP congestion control and sliding window protocols are highly predictable topics
- Routing algorithms (Dijkstra, Bellman-Ford) have direct calculation questions
- MAC protocols (ALOHA, CSMA) have formula-based questions with guaranteed marks
Computer Networks Topics Covered
GATE Computer Networks Syllabus
- Concept of layering: OSI and TCP/IP Protocol Stacks
- Basics of packet, circuit and virtual circuit-switching
- Data link layer: framing, error detection, Medium Access Control (MAC), Ethernet bridging
- Routing protocols: Shortest Path, Flooding, Distance Vector, Link State routing
- Fragmentation and IP addressing, IPv4, CIDR notation, ARP, RARP, DHCP
- ICMP, NAT; IPv6 basics
- Transport layer: flow control, congestion control, TCP, UDP, sockets
- Application layer protocols: DNS, SMTP, POP, FTP, HTTP
- Basics of Wi-Fi; network security: firewalls, IDS, cryptography basics
GATE Weightage by Topic
| Topic | Avg Marks (GATE) | Question Type |
|---|---|---|
| IP Addressing & Subnetting | 1–2 | Calculation (subnet mask, hosts, network ID) |
| TCP – flow/congestion control | 1–2 | Calculation (window size, throughput) |
| Routing Algorithms | 1 | Trace Dijkstra/Bellman-Ford on a graph |
| Data Link – sliding window | 1 | Efficiency, sender/receiver window size |
| MAC Protocols | 1 | ALOHA throughput, CSMA/CD efficiency |
| Application Layer | 0–1 | Conceptual (protocol functions) |
| OSI/TCP-IP Models | 0–1 | Layer identification, PDU names |