Computer Networks · TEE · revision

Unit 4: numerical method checklist

TEE last-day revision

TEE · Use after the full lessons and solved papers · current syllabus 702AI0C023

1. IPv4 block: p → 32−p → total size → mask → aligned network/broadcast → distinguish total from ordinary usable hosts.
2. VLSM: translate host requirements to total size; largest first; align every network; check no overlap and containment in parent.
3. IPv6: count visible groups; :: occurs at most once; restore exactly eight groups; pad each to four hex digits.
4. Dijkstra: use nonnegative edges; set source zero and others infinity; select smallest unsettled; update outgoing edges; reconstruct predecessors.
5. Bellman–Ford: state directed edge order; relax all edges for up to V−1 passes; preserve your update convention; one extra improving pass signals a reachable negative cycle.
6. Forwarding/mapping: longest matching prefix selects next hop; ARP resolves that local next hop, not a remote server’s Ethernet address.

For the actual final graph the path is A→C→D→F→G, cost 12. For the actual re-exam graph it is A→D→C→B→E→G, cost 4. Memorizing those numbers is not enough for a changed graph: show the table.