Technical tests
Subnet addresses, compute CRCs and Hamming codes, trace sliding windows, TCP congestion windows and routing tables – every answer computed.
Computer networks is tested in almost every campus placement technical round, in networking and backend interviews, and carries several numerical questions in GATE CSE. Here you calculate subnets and broadcast addresses, CRC remainders and Hamming codes, sliding-window efficiency, TCP congestion windows and routing tables, and read message-sequence charts of handshakes and retransmissions. Subnetting answers come from Python's own ipaddress module and every other number was computed by running the textbook procedure.
Full mocks
Placement-style mocks · −0.25 per wrong answer
30 questions across all ten CN topics – delays, CRC and Hamming, sliding windows, subnetting, routing, TCP congestion, DNS/HTTP timing and RSA – with negative marking.
30 questions across all ten CN topics – delays, CRC and Hamming, sliding windows, subnetting, routing, TCP congestion, DNS/HTTP timing and RSA – with negative marking.
GATE CSE pattern · MCQ −⅓ / −⅔, no negative on MSQ and NAT
20 questions, 30 marks in the GATE CSE pattern – MCQ, MSQ and NAT, 1- and 2-mark questions, negative marks on MCQs only.
20 questions, 30 marks in the GATE CSE pattern – MCQ, MSQ and NAT, 1- and 2-mark questions, negative marks on MCQs only.
Topic-wise practice
OSI and TCP/IP layers, encapsulation and PDUs, hubs, switches and routers, switching methods, and transmission, propagation, queueing and end-to-end delay numericals with bandwidth-delay product, Nyquist and Shannon.
Parity and 2-D parity, Internet checksum, CRC by modulo-2 division, Hamming codes and syndromes, Hamming distance and what a code can detect or correct, framing with bit and byte stuffing.
Stop-and-wait, Go-Back-N and Selective Repeat ARQ, link utilisation and the a parameter, window sizes, sequence-number bits, retransmission counts, cumulative ACKs and piggybacking, drawn as message-sequence charts.
ALOHA, CSMA/CD and CSMA/CA, binary exponential backoff, minimum frame size, MAC addresses and Ethernet frames, switch learning and flooding, VLANs, spanning tree, TDM and CDMA.
IPv4 address structure, classes and private ranges, masks and CIDR, network, broadcast and host ranges, subnetting and VLSM, supernetting and route summarisation, and longest-prefix matching.
Routing vs forwarding, link-state routing with Dijkstra and distance-vector routing with Bellman–Ford on drawn networks, count-to-infinity and its fixes, RIP, OSPF, BGP, autonomous systems and modern routing (ECMP, SDN, MPLS).
The IPv4 header, TTL and fragmentation (offsets, MF and DF), ICMP, ping and traceroute, ARP, DHCP, NAT and port translation, and IPv6 addressing, notation, headers and neighbour discovery.
Ports and sockets, UDP vs TCP, the three-way handshake and connection teardown, sequence and acknowledgement numbers, flow control, RTT estimation and timeouts, slow start, congestion avoidance, Tahoe and Reno, and socket programming.
Client-server and P2P, DNS resolution and records, HTTP methods, status codes, persistent connections, cookies and caching, HTTP/2 and HTTP/3, SMTP, POP3 and IMAP, FTP, DHCP and page-load time numericals.
Confidentiality, integrity and authentication, symmetric vs public-key cryptography, RSA and Diffie-Hellman numericals, hashes, MACs and digital signatures, certificates and TLS, firewalls, VPNs, common attacks and socket programming.
No sets match this filter.