Computer Networks · TEE · papers-chapter

2023-01-27 · AI-only Sem V

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

  1. Q1(a) · Shared bottleneck throughput
  2. Q1(b) · Ideal broadcast channel and slotted ALOHA
  3. Q1(c) · Round-robin scheduling
  4. Q1(d) · TCP congestion control
  5. Q2(a) · Persistent HTTP delay
  6. Q2(b)(i) · Block-code received words
  7. Q2(b)(ii) · CRC and syndrome
  8. Q3(a) · Dijkstra from u
  9. Q3(b)(i) · Why rdt3.0 needs a timer
  10. Q3(b)(ii) · Internet checksum
  11. Q4(a) · Alternating-bit data and ACK sequence
  12. Q4(b) · HTTP/2 multiplexing versus HTTP/1.1
  13. Q5(a) · BGP export policy
  14. Q5(b)(i) · HFC access
  15. Q5(b)(ii) · Wireless access technologies
  16. Q6(a) · Slotted ALOHA arrival timeline
  17. Q6(b) · ISP VLSM allocation
  18. Q7(a) · TDM versus FDM
  19. Q7(b) · HTTP state
  20. Q7(c) · TCP server sockets
  21. Q7(d) · NAT translated flow