HIGH-YIELD REVISION GUIDE & CHEAT SHEET
Computer Networks & Internet Proto-
cols Complete Semester Guide
High-Yield Comprehensive Guide, Protocol Encapsulation, CIDR Subnetting
Traces, TCP Congestion Control & Quick-Cram Appendix
Computer Science & Telecommunications | Course Code: University Of California - Berkeley
- CS 168 | 2024-2025 Comprehensive Edition
📘 WHAT’S INSIDE THIS GUIDE:
✔ Protocol Stack Mechanics: Layered abstractions, PDU headers, encapsulation pipeline, and
MTU fragmentation
✔ Transport Layer Invariants: 3-Way Handshake, 4-Way Teardown, TIME_WAIT state proofs, and
Sliding Window (GBN vs. SR)
✔ TCP Congestion Control Dynamics: AIMD, Slow Start threshold transitions, Fast Retransmit,
and Mathis throughput formula
✔ WORKED STEP-BY-STEP PROBLEM: Variable Length Subnet Masking (VLSM) hand calcula-
tion for a 4-department network
✔ Routing Protocols: Link-State Dijkstra calculations vs. Distance-Vector Bellman-Ford step-by-
step convergence tables
✔ Application & Security: DNS hierarchical recursive lookups, HTTP/1.1 vs. HTTP/2 vs. HTTP/3
(QUIC), and TLS 1.3 handshake flows
✔ 10 Deadly Networking Exam Traps (CIDR host subtraction, TCP byte sequence numbers, ARP
broadcast boundaries)
✔ APPENDIX: 1-Hour Emergency Pre-Exam Quick-Cram Cheat Sheet with master protocol stack
table and 25 active recall flashcards
, Computer Science & Telecommunications · University OfComputer Networks & Internet Protocols Complete Semes-
California - Berkeley - CS 168 ter Guide
Disclaimer: This is an independently created academic study aid. It is not affiliated with, endorsed by, or sponsored by any specific
university, textbook author, or publisher.
Independent Study Aid. Not affiliated with or endorsed by any specific university or Page 2 of 7
publisher.
Computer Networks & Internet Proto-
cols Complete Semester Guide
High-Yield Comprehensive Guide, Protocol Encapsulation, CIDR Subnetting
Traces, TCP Congestion Control & Quick-Cram Appendix
Computer Science & Telecommunications | Course Code: University Of California - Berkeley
- CS 168 | 2024-2025 Comprehensive Edition
📘 WHAT’S INSIDE THIS GUIDE:
✔ Protocol Stack Mechanics: Layered abstractions, PDU headers, encapsulation pipeline, and
MTU fragmentation
✔ Transport Layer Invariants: 3-Way Handshake, 4-Way Teardown, TIME_WAIT state proofs, and
Sliding Window (GBN vs. SR)
✔ TCP Congestion Control Dynamics: AIMD, Slow Start threshold transitions, Fast Retransmit,
and Mathis throughput formula
✔ WORKED STEP-BY-STEP PROBLEM: Variable Length Subnet Masking (VLSM) hand calcula-
tion for a 4-department network
✔ Routing Protocols: Link-State Dijkstra calculations vs. Distance-Vector Bellman-Ford step-by-
step convergence tables
✔ Application & Security: DNS hierarchical recursive lookups, HTTP/1.1 vs. HTTP/2 vs. HTTP/3
(QUIC), and TLS 1.3 handshake flows
✔ 10 Deadly Networking Exam Traps (CIDR host subtraction, TCP byte sequence numbers, ARP
broadcast boundaries)
✔ APPENDIX: 1-Hour Emergency Pre-Exam Quick-Cram Cheat Sheet with master protocol stack
table and 25 active recall flashcards
, Computer Science & Telecommunications · University OfComputer Networks & Internet Protocols Complete Semes-
California - Berkeley - CS 168 ter Guide
Disclaimer: This is an independently created academic study aid. It is not affiliated with, endorsed by, or sponsored by any specific
university, textbook author, or publisher.
Independent Study Aid. Not affiliated with or endorsed by any specific university or Page 2 of 7
publisher.
