Computer Networks · TEE · about
Every named syllabus topic has a teaching location
TEE coverage and source notes
TEE · Evidence and scope limits · current syllabus 702AI0C023
| Unit | Current syllabus topic | Read |
|---|---|---|
| 1 | Computer network | Open lesson |
| 1 | Peer-to-peer and client-server communication | Open lesson |
| 1 | Classifications of computer networks | Open lesson |
| 1 | Network topologies | Open lesson |
| 2 | OSI model | Open lesson |
| 2 | TCP/IP model | Open lesson |
| 2 | Transmission media | Open lesson |
| 3 | Fundamentals of error detection and correction | Open lesson |
| 3 | Block coding | Open lesson |
| 3 | Hamming distance | Open lesson |
| 3 | Flow control and error control | Open lesson |
| 3 | CRC | Open lesson |
| 3 | Stop and Wait ARQ | Open lesson |
| 3 | Go-Back-N ARQ | Open lesson |
| 3 | Selective Repeat ARQ | Open lesson |
| 3 | Pure ALOHA | Open lesson |
| 3 | Slotted ALOHA | Open lesson |
| 3 | CSMA/CD | Open lesson |
| 3 | Printed CDMA/CA, interpreted CSMA/CA | Open lesson |
| 4 | Switching techniques | Open lesson |
| 4 | IPv4 addressing | Open lesson |
| 4 | Subnet mask | Open lesson |
| 4 | CIDR | Open lesson |
| 4 | IPv6 | Open lesson |
| 4 | ARP | Open lesson |
| 4 | RARP | Open lesson |
| 4 | DHCP | Open lesson |
| 4 | Shortest-path routing | Open lesson |
| 4 | RIP | Open lesson |
| 4 | Bellman–Ford | Open lesson |
| 4 | Link-state routing | Open lesson |
| 4 | Dijkstra | Open lesson |
| 4 | OSPF | Open lesson |
| 5 | Process-to-process communication | Open lesson |
| 5 | UDP services and operation | Open lesson |
| 5 | TCP features | Open lesson |
| 5 | TCP three-way handshaking | Open lesson |
| 5 | UDP/TCP comparison | Open lesson |
| 5 | SCTP | Open lesson |
| 5 | Open-loop and closed-loop congestion control | Open lesson |
| 5 | Quality of Service | Open lesson |
| 5 | QoS improving techniques | Open lesson |
| 5 | Leaky bucket | Open lesson |
| 5 | Token bucket | Open lesson |
| 6 | HTTP | Open lesson |
| 6 | DNS | Open lesson |
| 6 | FTP | Open lesson |
| 6 | SMTP | Open lesson |
This matrix checks explicit named-topic coverage, not guaranteed examination outcomes. Supporting material includes Hamming-code construction, mesh counting, ideal ARQ utilization, TCP sequence arithmetic, bucket calculations, HTTP timing and IPv4 fragmentation. They develop the core concepts and are labelled where assumptions or scope go beyond the named syllabus.
Each actual paper contains 18 solved parts, all retained here. Each authored TEE mock presents the historical seven-question choice structure: 140 marks of offered questions, of which 100 are attempted by following Q1 plus four choices.