Computer Networks · TEE · papers-chapter

2024-02-06 · AI-only Sem V variant

Exact historical variant. Current-syllabus questions solved; excluded topics and source limitations stated.

  1. Q1(a) · Subnet mask
  2. Q1(b) · Additional shared bottleneck
  3. Q1(c) · HTTP/1.1 delay
  4. Q1(d) · Confidentiality versus integrity
  5. Q2(a) · Dijkstra from w
  6. Q2(b) · Telnet connection ports
  7. Q2(c) · SDN routing application
  8. Q3(a) · rdt3.0 error recovery
  9. Q3(b) · DNS cache popularity
  10. Q3(c) · TLS impersonation
  11. Q3(d) · TLS nonces
  12. Q4(a) · Distance vector at z
  13. Q4(b) · Cryptographic attack models
  14. Q4(c) · CDN design
  15. Q5(a) · Hamming error detection
  16. Q5(b) · CRC and damaged message
  17. Q5(c) · 8-bit checksum
  18. Q6(a) · Pure ALOHA timeline
  19. Q6(b) · Distance-vector link change
  20. Q6(c) · Polling and token passing
  21. Q6(d) · Classful and IPv6 addresses
  22. Q7(a) · Network delay components
  23. Q7(b) · Webmail to IMAP recipient
  24. Q7(c) · Selective Repeat implementation