Computer Networks · TEE · papers
Every paper: question, unit, marks and solved answer
Past papers: questions, marks and full solutions
TEE · Latest papers first; older variants mapped to current syllabus
Use this map with the solved papers
Each row links directly to the full question and its answer. Offered marks count all printed choices; attempted marks are the marks you are allowed to answer. Unit totals below describe what appeared on that paper, not a prediction or a compulsory unit-wise distribution.
Types: Numerical = calculations; Theory = explain/compare; Mixed = calculations with explanation; Case = apply or design a system. A case can contain substantial calculation.
2026-02-04 · Re-examination · current 2025–26 paper
100 marks to attempt; 140 marks offered. Q1 compulsory; choose any four complete questions from Q2–Q7. Each whole question carries 20 marks.
Offered marks by current unit: Unit 1: 10, Unit 2: 10, Unit 3: 30, Unit 4: 40, Unit 5: 30, Unit 6: 20. Unspecified internal task marks are not split or guessed.
| Question | Marks | Current unit and topic | Type | Answer |
|---|---|---|---|---|
| Q1(a) | 5 | Unit 1 · Client-server and peer-to-peer models | Theory | Full solution |
| Q1(b) | 5 | Unit 2 · TCP/IP reference model | Theory | Full solution |
| Q1(c) | 5 | Unit 3 · Pure ALOHA throughput | Mixed | Full solution |
| Q1(d) | 5 | Unit 4 · IPv4 CIDR address block | Numerical | Full solution |
| Q2(a) | 10 | Unit 3 · CRC polynomial division | Numerical | Full solution |
| Q2(b) | 10 | Unit 4 · VLSM subnet allocation | Numerical | Full solution |
| Q3(a) | 5 | Unit 1 · Network definition and topology | Theory | Full solution |
| Q3(b) | 5 | Unit 4 · OSPF shortest-path calculation | Theory | Full solution |
| Q3(c) | 10 | Unit 6 · DNS namespace and resolution | Theory | Full solution |
| Q4(a) | 10 | Unit 4 · IPv6 packet header | Theory | Full solution |
| Q4(b) | 10 | Unit 5 · TCP connection lifecycle | Theory | Full solution |
| Q5(a) | 10 | Unit 3 · Go-Back-N normal, loss and ACK cases | Mixed | Full solution |
| Q5(b) | 10 | Unit 6 · FTP control/data connections | Theory | Full solution |
| Q6(a) | 5 | Unit 2 · Guided/unguided media and optical fibre | Theory | Full solution |
| Q6(b) | 5 | Unit 3 · Pure ALOHA at three offered loads | Numerical | Full solution |
| Q6(c) | 10 | Unit 5 · UDP, TCP and SCTP comparison | Theory | Full solution |
| Q7(a) | 10 | Unit 4 · Bellman-Ford shortest path | Numerical | Full solution |
| Q7(b) | 10 | Unit 5 · Leaky bucket versus token bucket | Theory | Full solution |
2025-12-05 · Final examination · current 2025–26 paper
100 marks to attempt; 140 marks offered. Q1 compulsory; choose any four complete questions from Q2–Q7. Each whole question carries 20 marks.
Offered marks by current unit: Unit 1: 5, Unit 2: 15, Unit 3: 30, Unit 4: 40, Unit 5: 30, Unit 6: 20. Unspecified internal task marks are not split or guessed.
| Question | Marks | Current unit and topic | Type | Answer |
|---|---|---|---|---|
| Q1(a) | 5 | Unit 2 · Wired and wireless media | Case | Full solution |
| Q1(b) | 5 | Unit 2 · OSI and TCP/IP models | Theory | Full solution |
| Q1(c) | 5 | Unit 3 · Slotted ALOHA throughput | Mixed | Full solution |
| Q1(d) | 5 | Unit 4 · IPv4 CIDR address block | Numerical | Full solution |
| Q2(a) | 10 i: 2; ii: 2; iii: 2; iv: 4 | Unit 3 · Block coding and Hamming distance | Mixed | Full solution |
| Q2(b) | 10 | Unit 4 · Circuit, message and packet switching | Case | Full solution |
| Q3(a) | 5 | Unit 1 · Network classifications and ARPANET | Theory | Full solution |
| Q3(b) | 5 | Unit 4 · OSPF packet types | Theory | Full solution |
| Q3(c) | 10 | Unit 6 · WWW and HTTP | Theory | Full solution |
| Q4(a) | 10 | Unit 4 · IPv6 expansion and header | Mixed | Full solution |
| Q4(b) | 10 | Unit 5 · UDP and TCP | Theory | Full solution |
| Q5(a) | 10 | Unit 3 · Selective Repeat sequence space and windows | Mixed | Full solution |
| Q5(b) | 10 | Unit 6 · SMTP phases | Theory | Full solution |
| Q6(a) | 5 | Unit 2 · Unguided transmission media | Theory | Full solution |
| Q6(b) | 5 | Unit 3 · CSMA persistence | Theory | Full solution |
| Q6(c) | 10 | Unit 5 · Open-loop and closed-loop congestion control | Theory | Full solution |
| Q7(a) | 10 | Unit 4 · Dijkstra shortest path | Numerical | Full solution |
| Q7(b) | 10 | Unit 5 · Token bucket | Theory | Full solution |
2025-12-05 · Re-examination · 2022-23
100 marks to attempt; 140 marks offered. Q1 compulsory; attempt any four of Q2–Q7. All whole questions carry 20 marks. 2022-23
Offered marks by current unit: Unit 1: 20, Unit 3: 30, Unit 4: 40, Unit 5: 25, Unit 6: 10. Unspecified internal task marks are not split or guessed.
| Question | Marks | Current unit and topic | Type | Answer |
|---|---|---|---|---|
| Q1(a) | 5 | Unit 1 · Network definition | Theory | Full solution |
| Q1(b) | 5 | Unit 3 · Error control | Theory | Full solution |
| Q1(c) | 5 | Unit 4 · Classful IPv4 | Theory | Full solution |
| Q1(d) | 5 | Unit 5 · UDP features | Theory | Full solution |
| Q2(a) | 10 | Unit 1 · Network topologies | Theory | Full solution |
| Q2(b) | 10 | Unit 3 · Stop-and-Wait versus Go-Back-N | Theory | Full solution |
| Q3(a) | 10 | FDMA and TDMA outside current syllabus | Theory | excluded: outside current syllabus |
| Q3(b) | 10 i: 5; ii: 5 | Unit 4 · Classful net/host IDs and /26 host | Numerical | Full solution |
| Q4(a) | 10 | Unit 3 · CSMA persistence and CSMA/CD | Theory | Full solution |
| Q4(b) | 10 | Unit 4 · OSPF and link types | Theory | Full solution |
| Q5(a) | 10 | Unit 4 · Dijkstra algorithm | Mixed | Full solution |
| Q5(b) | 10 | Unit 5 · Congestion control | Theory | Full solution |
| Q6(a) | 10 | Unit 5 · TCP phases | Theory | Full solution |
| Q6(b) | 10 | Unit 6 · DNS hierarchy and resolution | Theory | Full solution |
| Q7(a) | 5 | Unit 1 · Network classifications | Theory | Full solution |
| Q7(b) | 5 | Unit 3 · Block coding | Mixed | Full solution |
| Q7(c) | 5 | Unit 4 · ARP | Theory | Full solution |
| Q7(d) | 5 | Unit 6 · SMTP and SNMP partly current syllabus | Theory | Full solution |
2025-02-19 · Re-examination · 2023-24 / 2024-25
100 marks to attempt; 140 marks offered. Q1 compulsory; attempt any four of Q2–Q7. All whole questions carry 20 marks. 2023-24 / 2024-25
Offered marks by current unit: Unit 1: 10, Unit 2: 10, Unit 3: 35, Unit 4: 40, Unit 5: 25, Unit 6: 20. Unspecified internal task marks are not split or guessed.
| Question | Marks | Current unit and topic | Type | Answer |
|---|---|---|---|---|
| Q1(a) | 5 | Unit 2 · TCP/IP network and transport layers | Theory | Full solution |
| Q1(b) | 5 | Unit 3 · Stop-and-Wait losses | Theory | Full solution |
| Q1(c) | 5 | Unit 5 · SCTP services | Theory | Full solution |
| Q1(d) | 5 | Unit 4 · Message versus packet switching | Theory | Full solution |
| Q2(a) | 10 | Unit 1 · Star and mesh | Theory | Full solution |
| Q2(b) | 10 | Unit 3 · CSMA/CA and RTS/CTS | Theory | Full solution |
| Q3(a) | 10 | Unit 5 · TCP connection lifecycle | Theory | Full solution |
| Q3(b) | 10 | Unit 4 · VLSM customer allocation | Numerical | Full solution |
| Q4(a) | 10 | Unit 6 · DNS resolution | Theory | Full solution |
| Q4(b) | 10 | Unit 4 · RIP route updates | Mixed | Full solution |
| Q5(a) | 10 | Unit 3 · Pure versus slotted ALOHA | Theory | Full solution |
| Q5(b) | 10 | Unit 5 · Congestion policies | Theory | Full solution |
| Q6(a) | 10 | Unit 4 · Dijkstra six-node graph | Numerical | Full solution |
| Q6(b) | 10 | Unit 3 · CRC | Numerical | Full solution |
| Q7(a) | 5 | Unit 2 · Guided versus unguided media | Theory | Full solution |
| Q7(b) | 5 | Unit 4 · IPv4 /26 block | Numerical | Full solution |
| Q7(c) | 10 | Unit 6 · FTP connections | Theory | Full solution |
Source qualification: The PDF has four pages; the fourth is blank. The handwritten date ends in 2025 over a printed 2024 template.
2024-12-06 · Final / re-examination · Final 2024-25 / Re-exam 2023-24
100 marks to attempt; 140 marks offered. Q1 compulsory; attempt any four of Q2–Q7. All whole questions carry 20 marks. Final 2024-25 / Re-exam 2023-24
Offered marks by current unit: Unit 1: 10, Unit 2: 10, Unit 3: 35, Unit 4: 40, Unit 5: 25, Unit 6: 20. Unspecified internal task marks are not split or guessed.
| Question | Marks | Current unit and topic | Type | Answer |
|---|---|---|---|---|
| Q1(a) | 5 | Unit 1 · LAN MAN WAN | Theory | Full solution |
| Q1(b) | 5 | Unit 3 · Selective Repeat versus Go-Back-N | Theory | Full solution |
| Q1(c) | 5 | Unit 5 · TCP versus UDP | Theory | Full solution |
| Q1(d) | 5 | Unit 4 · DHCP | Theory | Full solution |
| Q2(a) | 10 | Unit 2 · OSI model | Theory | Full solution |
| Q2(b) | 10 | Unit 3 · CSMA/CD | Theory | Full solution |
| Q3(a) | 10 | Unit 6 · SMTP phases | Theory | Full solution |
| Q3(b) | 10 | Unit 4 · OSPF and link types | Theory | Full solution |
| Q4(a) | 10 | Unit 3 · CRC and corrupted frame | Numerical | Full solution |
| Q4(b) | 10 | Unit 5 · UDP and applications | Theory | Full solution |
| Q5(a) | 5 | Unit 1 · Network models | Theory | Full solution |
| Q5(b) | 5 | Unit 6 · DNS hierarchy | Theory | Full solution |
| Q5(c) | 10 | Unit 4 · Bellman-Ford example | Mixed | Full solution |
| Q6(a) | 10 | Unit 3 · Pure ALOHA rates | Numerical | Full solution |
| Q6(b) | 10 | Unit 4 · VLSM groups | Numerical | Full solution |
| Q7(a) | 10 | Unit 5 · Leaky versus token bucket | Theory | Full solution |
| Q7(b) | 5 | Unit 6 · HTTP | Theory | Full solution |
| Q7(c) | 5 | Unit 4 · Distance vector versus link state | Theory | Full solution |
2024-12-06 · Final / re-examination · AI-only Sem V variant
100 marks to attempt; 140 marks offered. Q1 compulsory; attempt any four remaining complete questions. AI-only Sem V variant
Offered marks by current unit: Unit 3: 25, Unit 4: 50, Unit 5: 10, Unit 6: 25. Unspecified internal task marks are not split or guessed.
| Question | Marks | Current unit and topic | Type | Answer |
|---|---|---|---|---|
| Q1(a) | 5 | Unit 4 · Mission-critical switching choice | Case | Full solution |
| Q1(b) | 5 | Unit 4 · Store-and-forward delay | Numerical | Full solution |
| Q1(c) | 5 | Unit 4 · Classful versus classless addressing | Theory | Full solution |
| Q1(d) | 5 | BGP AS-PATH outside current syllabus | Theory | excluded: outside current syllabus |
| Q2(a) | 10 | Unit 6 · Webmail and POP3 protocol journey | Theory | Full solution |
| Q2(b) | 5 | CDN Bring Home outside current syllabus | Theory | excluded: outside current syllabus |
| Q2(c) | 5 | Unit 4 · ARP response destination | Theory | Full solution |
| Q3(a) | 10 | Unit 4 · Store-and-forward caravan | Numerical | Full solution |
| Q3(b) | 5 | Unit 4 · Count to infinity | Theory | Full solution |
| Q3(c) | 5 | Unit 5 · Reliable application over UDP | Theory | Full solution |
| Q4(a) | 5 | Unit 3 · CRC codeword | Numerical | Full solution |
| Q4(b) | 5 | Unit 5 · Internet checksum | Numerical | Full solution |
| Q4(c) | 10 | Unit 3 · Hamming generation and correction | Numerical | Full solution |
| Q5(a) | 10 | Unit 6 · Persistent HTTP cache delay | Numerical | Full solution |
| Q5(b) | 5 | Unit 6 · Iterative DNS resolution | Theory | Full solution |
| Q5(c) | 5 | Unit 4 · Longest-prefix matching | Numerical | Full solution |
| Q6(a) | 5 | Unit 4 · Classful network and host portions | Numerical | Full solution |
| Q6(b) | 5 | Unit 3 · CSMA without collision detection | Numerical | Full solution |
| Q6(c) | 5 | Unit 4 · Recovering unknown routing weights | Numerical | Full solution |
| Q6(d) | 5 | Unit 3 · ALOHA comparison | Theory | Full solution |
| Q7(a) | 10 | Learning-switch tables, mislabeled ARP outside current syllabus | Theory | excluded: outside current syllabus |
| Q7(b) | 10 | NAT four packet stages outside current syllabus | Theory | excluded: outside current syllabus |
2024-02-06 · Re-examination · 2022-23
100 marks to attempt; 140 marks offered. Q1 compulsory; attempt any four of Q2–Q7. All whole questions carry 20 marks. 2022-23
Offered marks by current unit: Unit 1: 10, Unit 2: 10, Unit 3: 35, Unit 4: 40, Unit 5: 25, Unit 6: 20. Unspecified internal task marks are not split or guessed.
| Question | Marks | Current unit and topic | Type | Answer |
|---|---|---|---|---|
| Q1(a) | 5 | Unit 5 · TCP versus UDP | Theory | Full solution |
| Q1(b) | 5 | Unit 2 · Guided media | Theory | Full solution |
| Q1(c) | 5 | Unit 3 · CSMA persistence | Theory | Full solution |
| Q1(d) | 5 | Unit 4 · Circuit versus packet switching | Theory | Full solution |
| Q2(a) | 10 | Unit 5 · QoS and scheduling | Theory | Full solution |
| Q2(b) | 10 | Unit 3 · Slotted ALOHA rates | Numerical | Full solution |
| Q3(a) | 10 | Unit 3 · CSMA/CA | Theory | Full solution |
| Q3(b) | 10 | Unit 4 · RIP and timers | Theory | Full solution |
| Q4(a) | 10 | Unit 5 · TCP lifecycle | Theory | Full solution |
| Q4(b) | 10 | Unit 6 · DNS resolution | Theory | Full solution |
| Q5(a) | 10 | Unit 3 · Go-Back-N scenarios | Theory | Full solution |
| Q5(b) | 5 | Unit 6 · FTP connections | Theory | Full solution |
| Q5(c) | 5 | Unit 4 · DHCP dynamic allocation | Theory | Full solution |
| Q6(a) | 10 | Unit 4 · VLSM and noncanonical block address | Numerical | Full solution |
| Q6(b) | 5 | Unit 6 · SMTP | Theory | Full solution |
| Q6(c) | 5 | Unit 2 · TCP/IP layers | Theory | Full solution |
| Q7(a) | 10 | Unit 4 · Dijkstra graph | Numerical | Full solution |
| Q7(b) | 10 | Unit 1 · Four network topologies | Theory | Full solution |
2024-02-06 · Re-examination · AI-only Sem V variant
100 marks to attempt; 140 marks offered. Q1 compulsory; attempt any four remaining complete questions. AI-only Sem V variant
Offered marks by current unit: Unit 3: 35, Unit 4: 40, Unit 5: 15, Unit 6: 15. Unspecified internal task marks are not split or guessed.
| Question | Marks | Current unit and topic | Type | Answer |
|---|---|---|---|---|
| Q1(a) | 5 | Unit 4 · Subnet mask | Theory | Full solution |
| Q1(b) | 5 | Unit 5 · Additional shared bottleneck | Numerical | Full solution |
| Q1(c) | 5 | Unit 6 · HTTP/1.1 delay | Numerical | Full solution |
| Q1(d) | 5 | Confidentiality versus integrity outside current syllabus | Theory | excluded: outside current syllabus |
| Q2(a) | 10 | Unit 4 · Dijkstra from w | Numerical | Full solution |
| Q2(b) | 5 | Unit 5 · Telnet connection ports | Theory | Full solution |
| Q2(c) | 5 | SDN routing application outside current syllabus | Theory | excluded: outside current syllabus |
| Q3(a) | 5 | Unit 3 · rdt3.0 error recovery | Theory | Full solution |
| Q3(b) | 5 | Unit 6 · DNS cache popularity | Theory | Full solution |
| Q3(c) | 5 | TLS impersonation outside current syllabus | Theory | excluded: outside current syllabus |
| Q3(d) | 5 | TLS nonces outside current syllabus | Theory | excluded: outside current syllabus |
| Q4(a) | 10 | Unit 4 · Distance vector at z | Numerical | Full solution |
| Q4(b) | 5 | Cryptographic attack models outside current syllabus | Theory | excluded: outside current syllabus |
| Q4(c) | 5 | CDN design outside current syllabus | Theory | excluded: outside current syllabus |
| Q5(a) | 10 | Unit 3 · Hamming error detection | Numerical | Full solution |
| Q5(b) | 5 | Unit 3 · CRC and damaged message | Numerical | Full solution |
| Q5(c) | 5 | Unit 5 · 8-bit checksum | Numerical | Full solution |
| Q6(a) | 5 | Unit 3 · Pure ALOHA timeline | Numerical | Full solution |
| Q6(b) | 5 | Unit 4 · Distance-vector link change | Numerical | Full solution |
| Q6(c) | 5 | Polling and token passing outside current syllabus | Theory | excluded: outside current syllabus |
| Q6(d) | 5 | Unit 4 · Classful and IPv6 addresses | Mixed | Full solution |
| Q7(a) | 5 | Unit 4 · Network delay components | Theory | Full solution |
| Q7(b) | 5 | Unit 6 · Webmail to IMAP recipient | Theory | Full solution |
| Q7(c) | 10 | Unit 3 · Selective Repeat implementation | Theory | Full solution |
2023-11-22 · Final / re-examination · Final 2023-24 / Re-exam 2022-23
100 marks to attempt; 140 marks offered. Q1 compulsory; attempt any four of Q2–Q7. All whole questions carry 20 marks. Final 2023-24 / Re-exam 2022-23
Offered marks by current unit: Unit 1: 10, Unit 2: 10, Unit 3: 35, Unit 4: 40, Unit 5: 25, Unit 6: 20. Unspecified internal task marks are not split or guessed.
| Question | Marks | Current unit and topic | Type | Answer |
|---|---|---|---|---|
| Q1(a) | 5 | Unit 1 · Network classification | Theory | Full solution |
| Q1(b) | 5 | Unit 3 · ALOHA and vulnerable periods | Theory | Full solution |
| Q1(c) | 5 | Unit 4 · Classful addressing | Theory | Full solution |
| Q1(d) | 5 | Unit 5 · UDP applications | Theory | Full solution |
| Q2(a) | 10 | Unit 6 · SMTP phases | Theory | Full solution |
| Q2(b) | 10 | Unit 2 · OSI layers | Theory | Full solution |
| Q3(a) | 5 | Unit 1 · Network models | Theory | Full solution |
| Q3(b) | 10 | Unit 3 · CSMA/CD | Theory | Full solution |
| Q3(c) | 5 | Unit 4 · OSPF routing | Theory | Full solution |
| Q4(a) | 10 | Unit 5 · Traffic shaping buckets | Theory | Full solution |
| Q4(b) | 10 | Unit 3 · Selective Repeat scenarios | Theory | Full solution |
| Q5(a) | 10 | Unit 4 · VLSM two groups | Numerical | Full solution |
| Q5(b) | 5 | Unit 6 · FTP | Theory | Full solution |
| Q5(c) | 5 | Unit 4 · ARP | Theory | Full solution |
| Q6(a) | 10 | Unit 3 · CRC | Numerical | Full solution |
| Q6(b) | 5 | Unit 4 · IPv4 /26 block | Numerical | Full solution |
| Q6(c) | 5 | Unit 6 · DNS hierarchy | Theory | Full solution |
| Q7(a) | 10 | Unit 4 · Bellman-Ford directed graph | Numerical | Full solution |
| Q7(b) | 10 | Unit 5 · Congestion control | Theory | Full solution |
Source qualification: Header says 02 pages, but the paper continues through printed Page 3 of 3; all three are included.
2023-11-22 · Final / re-examination · AI-only Sem V variant; incomplete recovered scan
100 marks to attempt; 105 printed marks recovered; complete offered total unknown. Q1 compulsory; attempt any four remaining complete questions. AI-only Sem V variant; incomplete recovered scan
Offered marks by current unit: Unit 3: 25, Unit 4: 20, Unit 5: 10, Unit 6: 10. Unspecified internal task marks are not split or guessed.
| Question | Marks | Current unit and topic | Type | Answer |
|---|---|---|---|---|
| Q1(a) | 5 | Unit 4 · Subnetting and masks | Theory | Full solution |
| Q1(b) | 5 | Unit 5 · Shared bottleneck throughput | Numerical | Full solution |
| Q1(c) | 5 | Unit 6 · HTTP/1.0 delay | Numerical | Full solution |
| Q1(d) | 5 | Cryptographic hash versus checksum outside current syllabus | Theory | excluded: outside current syllabus |
| Q2(a) | 10 | Unit 3 · Hamming error correction | Numerical | Full solution |
| Q2(b) | 5 | Unit 3 · CRC encoding | Numerical | Full solution |
| Q2(c) | 5 | Unit 3 · Framing | Theory | Full solution |
| Q3(a) | 5 | Unit 3 · Alternating-bit state transitions | Numerical | Full solution |
| Q3(b) | 5 | Stateful packet filtering outside current syllabus | Theory | excluded: outside current syllabus |
| Q3(c) | 5 | Unit 6 · DNS cache inference | Theory | Full solution |
| Q3(d) | 5 | Unit 4 · IPv4 address classes | Theory | Full solution |
| Q4(a) | 10 | Unit 4 · Dijkstra from u | Numerical | Full solution |
| Q4(b) | 5 | Unit 5 · TCP socket port numbers | Theory | Full solution |
| Q4(c) | 5 | SDN control-plane layers outside current syllabus | Theory | excluded: outside current syllabus |
| Q5(a) | 10 | BGP topology views outside current syllabus | Theory | excluded: outside current syllabus |
| Q5(b) | 5 | Symmetric and public-key cryptography outside current syllabus | Theory | excluded: outside current syllabus |
| Q5(c) | 5 | CDN placement and server selection outside current syllabus | Theory | excluded: outside current syllabus |
| Q6(a) | 5 | Unit 3 · Incomplete multiple-access question source incomplete | Numerical | unavailable: missing source continuation |
Source qualification: Header states six pages, but the recovered PDF has only pages 1–5. Q6(a) stops before the requested protocol/tasks; page 6 and any subsequent questions are unavailable. No missing text or marks have been invented.
2023-01-27 · Re-examination · AI-only Sem V
100 marks to attempt; 140 marks offered. Q1 compulsory; attempt any four remaining complete questions. AI-only Sem V
Offered marks by current unit: Unit 3: 39, Unit 4: 20, Unit 5: 26, Unit 6: 25. Unspecified internal task marks are not split or guessed.
| Question | Marks | Current unit and topic | Type | Answer |
|---|---|---|---|---|
| Q1(a) | 5 | Unit 5 · Shared bottleneck throughput | Numerical | Full solution |
| Q1(b) | 5 | Unit 3 · Ideal broadcast channel and slotted ALOHA | Theory | Full solution |
| Q1(c) | 5 | Unit 5 · Round-robin scheduling | Numerical | Full solution |
| Q1(d) | 5 | Unit 5 · TCP congestion control | Theory | Full solution |
| Q2(a) | 10 | Unit 6 · Persistent HTTP delay | Numerical | Full solution |
| Q2(b)(i) | 5 | Unit 3 · Block-code received words | Numerical | Full solution |
| Q2(b)(ii) | 5 | Unit 3 · CRC and syndrome | Numerical | Full solution |
| Q3(a) | 10 | Unit 4 · Dijkstra from u | Numerical | Full solution |
| Q3(b)(i) | 4 | Unit 3 · Why rdt3.0 needs a timer | Theory | Full solution |
| Q3(b)(ii) | 6 | Unit 5 · Internet checksum | Numerical | Full solution |
| Q4(a) | 10 | Unit 3 · Alternating-bit data and ACK sequence | Numerical | Full solution |
| Q4(b) | 10 | Unit 6 · HTTP/2 multiplexing versus HTTP/1.1 | Numerical | Full solution |
| Q5(a) | 10 | BGP export policy outside current syllabus | Theory | excluded: outside current syllabus |
| Q5(b)(i) | 5 | HFC access outside current syllabus | Theory | excluded: outside current syllabus |
| Q5(b)(ii) | 5 | Wireless access technologies outside current syllabus | Theory | excluded: outside current syllabus |
| Q6(a) | 10 | Unit 3 · Slotted ALOHA arrival timeline | Numerical | Full solution |
| Q6(b) | 10 | Unit 4 · ISP VLSM allocation | Numerical | Full solution |
| Q7(a) | 5 | TDM versus FDM outside current syllabus | Theory | excluded: outside current syllabus |
| Q7(b) | 5 | Unit 6 · HTTP state | Theory | Full solution |
| Q7(c) | 5 | Unit 5 · TCP server sockets | Theory | Full solution |
| Q7(d) | 5 | NAT translated flow outside current syllabus | Theory | excluded: outside current syllabus |
2022-11-16 · Final examination · AI-only Sem V
100 marks to attempt; 140 marks offered. Q1 compulsory; attempt any four remaining complete questions. AI-only Sem V
Offered marks by current unit: Unit 2: 5, Unit 3: 35, Unit 4: 35, Unit 5: 20, Unit 6: 15. Unspecified internal task marks are not split or guessed.
| Question | Marks | Current unit and topic | Type | Answer |
|---|---|---|---|---|
| Q1(a) | 5 | Unit 4 · Store-and-forward delay | Numerical | Full solution |
| Q1(b) | 5 | Token passing and ideal broadcast access outside current syllabus | Theory | excluded: outside current syllabus |
| Q1(c) | 5 | Unit 5 · Priority scheduling | Numerical | Full solution |
| Q1(d) | 5 | Unit 5 · TCP flow control | Theory | Full solution |
| Q2(a) | 10 | Unit 6 · HTTP delay comparison | Numerical | Full solution |
| Q2(b)(i) | 4 | Unit 3 · Block coding capacity | Numerical | Full solution |
| Q2(b)(ii) | 6 | Unit 3 · CRC encoder and decoder | Theory | Full solution |
| Q3(a) | 10 | Unit 4 · Dijkstra from t | Numerical | Full solution |
| Q3(b)(i) | 5 | Unit 5 · UDP checksum limitations | Theory | Full solution |
| Q3(b)(ii) | 5 | Unit 5 · TCP demultiplexing | Theory | Full solution |
| Q4(a) | 10 | Unit 3 · rdt3.0 global transition sequence | Numerical | Full solution |
| Q4(b)(i) | 5 | CDN placement outside current syllabus | Theory | excluded: outside current syllabus |
| Q4(b)(ii) | 5 | CDN server selection outside current syllabus | Theory | excluded: outside current syllabus |
| Q5(a) | 10 | BGP path views outside current syllabus | Theory | excluded: outside current syllabus |
| Q5(b)(i) | 5 | Access technologies outside current syllabus | Theory | excluded: outside current syllabus |
| Q5(b)(ii) | 5 | Unit 2 · Ethernet physical media | Theory | Full solution |
| Q6(a) | 10 | Unit 3 · CSMA/CD arrival timeline | Numerical | Full solution |
| Q6(b)(i) | 5 | Unit 4 · Classful addresses and masks | Theory | Full solution |
| Q6(b)(ii) | 5 | Unit 4 · CIDR block | Numerical | Full solution |
| Q7(a) | 5 | Unit 4 · Circuit switching advantage | Theory | Full solution |
| Q7(b) | 5 | Unit 6 · HTTP cookies | Theory | Full solution |
| Q7(c) | 5 | Unit 3 · Selective Repeat | Theory | Full solution |
| Q7(d) | 5 | Unit 4 · Destination-based forwarding | Theory | Full solution |
What this evidence does and does not establish
Prepare each complete question: choices apply to whole questions, so a strong numerical alone may not cover its paired theory. Repeated topics deserve practice, but the next paper can change the combination. Historical course codes and syllabus changes are kept visible; out-of-syllabus questions are not counted as missing current topics.
Same-date papers can be different programme or batch variants. They are listed separately, so their marks must not be added as if one examination offered all those questions. Duplicate scans are reconciled to one represented paper.