
Already know some of this? A 2-minute test skips the lessons you know.
Take the placement testA free 41-lesson course built from KnowledgeGATE by Sanchit Sir's 11h 55m of YouTube video. 8 days at 90 minutes a day, with study notes and a quiz in every lesson. A 2-minute placement test skips what you already know.
Taught by KnowledgeGATE by Sanchit Sir on YouTube. Videos play in YouTube's own player, so the creator keeps every view.
Learn the five criteria for a good network (delivery, accuracy, timeliness, jitter, security), compare network topologies (Mesh, Star, Bus, Ring), and distinguish between Circuit Switching and Packet Switching (Datagram vs Virtual Circuit approaches).
Understand the 7-layer OSI model, the concept of protocols vs standards, encapsulation/decapsulation process, and how peer-to-peer communication works logically across layers.
Learn Data Link Layer responsibilities (framing, flow/error control, access control), the difference between Connection-oriented and Connectionless protocols, and the fundamentals of Media Access Control (Random Access).
Analyze Pure ALOHA (vulnerable time = 2*Tp, efficiency ~18%), Slotted ALOHA (improved efficiency via time slots), and solve numerical problems on throughput and collision probability.
Understand Carrier Sense Multiple Access (1-persistent, non-persistent, p-persistent), CSMA/CD (Collision Detection, vulnerable time = Tp, Ethernet usage), and CSMA/CA (Collision Avoidance, RTS/CTS, Contention Window, used in WiFi).
Master Stop-and-Wait ARQ mechanism, efficiency formula (1/(1+2a)), sequence numbering (1-bit), and solve numericals involving transmission/propagation delays and throughput calculation.
Learn Go-Back-N sliding window protocol, cumulative acknowledgments, aggressive retransmission penalty, efficiency formula (W/(1+2a)), and solve numericals for window size and sequence number bits.
Understand Selective Repeat ARQ (receiver buffers out-of-order frames), sender/receiver window equality, efficiency calculation, and solve numerical for minimum sequence number bits.
Learn error types (single-bit, burst), detection vs correction, Vertical/Longitudinal Redundancy Check (LRC), Hamming distance concept, and parity/checksum mechanisms.
Master CRC polynomial division (modulo-2 arithmetic), generator polynomial, remainder calculation, error detection capability, and solve previous year GATE numericals on CRC.
Compare Fixed-length vs Variable-length framing, Byte Stuffing (flag/escape chars), Bit Stuffing (0-bit insertion after 5 ones), and solve GATE questions on bit stuffing output.
Understand Ethernet as a LAN/MAN technology, CSMA/CD usage, frame structure (Preamble, SFD, Addresses, Length, CRC), max payload 1500B, min frame size 64B, and Manchester/Differential Manchester encoding.
Deep dive into IPv4 header fields (Version, HLEN, TOS, Total Length, Identification, Flags, Fragment Offset, TTL, Protocol, Header Checksum, Addresses, Options), fragmentation logic (MTU, offset scaling by 8), and Longest Prefix Match routing.
Learn Classful addressing ranges, Network/Host ID bit splits, reserved addresses (Network ID, Broadcast), usable hosts per network, and identify address classes from binary/decimal notation.
Understand why subnetting is needed, Fixed Length (FLSM) vs Variable Length (VLSM) Subnet Masking, calculate subnet ranges, first/last allocatable addresses, and solve GATE numericals.
Master CIDR notation (/n), finding Network ID via AND operation, Longest Prefix Match rule for routing, block size comparison, and solve GATE questions on feasible subnet pairs.
Understand routing table structure, flooding vs routing tables, Static vs Dynamic routing, Autonomous Systems, Intra-domain (RIP, OSPF) vs Inter-domain (BGP) routing protocols.
Learn DV routing logic (neighbor exchange, hop count metric), Count-to-Infinity problem, Split Horizon fix, and solve GATE numericals on routing table stabilization and unused links.
Understand Link State flooding (global knowledge), Dijkstra's algorithm per node, faster convergence vs DV, computational overhead, and evaluate GATE statements on convergence and Split Horizon.
Understand Transport Layer responsibilities (Process-to-Process delivery, Port addressing), TCP reliability (3-way handshake, byte sequencing, flow/congestion control), UDP simplicity (connectionless, DNS/RIP usage), and pseudo-header checksum.
Decode TCP header fields (Ports, Sequence/Ack numbers, Window Size, Checksum, Flags), 3-way handshake (SYN, SYN+ACK, ACK), connection termination (FIN), Persistence/Keep-alive timers, and Zero Window deadlock resolution.
Master TCP Congestion Control phases: Slow Start (Exponential increase, ssthresh), Congestion Avoidance (Additive Increase), Congestion Detection (Timeout -> ssthresh=Window/2, Window=1 MSS; 3 Dup ACKs -> Fast Retransmit, Window=Window/2). Solve GATE numericals on window size after timeout.
Understand Client-Server vs P2P architecture, DNS (UDP port 53, iterative/recursive query), FTP (Control port 21, Data port 20), HTTP (Persistent connections, Proxy caching), Email (SMTP push, POP3/IMAP pull, MIME encoding).