Computer Networks · TEE · papers-chapter
2024-12-06 · AI-only Sem V variant
Exact historical variant. Current-syllabus questions solved; excluded topics and source limitations stated.
- Q1(a) · Mission-critical switching choice
- Q1(b) · Store-and-forward delay
- Q1(c) · Classful versus classless addressing
- Q1(d) · BGP AS-PATH
- Q2(a) · Webmail and POP3 protocol journey
- Q2(b) · CDN Bring Home
- Q2(c) · ARP response destination
- Q3(a) · Store-and-forward caravan
- Q3(b) · Count to infinity
- Q3(c) · Reliable application over UDP
- Q4(a) · CRC codeword
- Q4(b) · Internet checksum
- Q4(c) · Hamming generation and correction
- Q5(a) · Persistent HTTP cache delay
- Q5(b) · Iterative DNS resolution
- Q5(c) · Longest-prefix matching
- Q6(a) · Classful network and host portions
- Q6(b) · CSMA without collision detection
- Q6(c) · Recovering unknown routing weights
- Q6(d) · ALOHA comparison
- Q7(a) · Learning-switch tables, mislabeled ARP
- Q7(b) · NAT four packet stages