In a scenario answer
Name the choice, define it, then pick the advantages that match the scenario’s words and give at least one honest disadvantage.
Every advantage and disadvantage the slides give, one tab per chapter and one card per topic. Cards carry a note when the topic was already discussed in an earlier chapter, and when it comes back later.
Each row is a topic that builds on something an earlier chapter already discussed. The chapter tabs mark these with an Already discussed note, and mark the first appearance with Comes back.
| Where | Topic | Already discussed in |
|---|---|---|
| Ch 02 | Amplifier vs repeater (fixing attenuation) | Ch 1 Part 2: the repeater is listed as a physical-layer device. |
| Ch 03 | Controlled access (reservation, polling, token) | Ch 1: token passing circulates around a ring topology. |
| Ch 04 | Traditional (half-duplex) Ethernet | Ch 3: CSMA/CD — its pros and cons are there. Ch 1: bus and star topologies. |
| Ch 04 | Full-duplex (switched) Ethernet | Ch 1: full duplex as a transmission mode (telephone). |
| Ch 04 | Faster Ethernet standards | Ch 2: fibre's advantages and costs. |
| Ch 06 | Hub (physical layer) | Ch 1: the hub is the centre of a star. Ch 2: a hub works like a multi-port repeater. |
| Ch 06 | Link-layer switch | Ch 4: full-duplex switched Ethernet doubles throughput. |
| Ch 08 | Network-specific and default routing | Ch 7: the default gateway on every host. |
| Ch 09 | TCP | Ch 7: virtual-circuit (connection-oriented) switching. Ch 3: retransmission-based error control. |
| Ch 09 | UDP | Ch 7: datagram (connectionless) switching. Ch 3: why retransmission is bad for real-time traffic. |
| Ch 09 | Connectionless vs connection-oriented service | Ch 7: the same split at the network layer (virtual circuit vs datagram). |
| Ch 10 | DNS over UDP | Ch 9: UDP's advantages and disadvantages. |
Name the choice, define it, then pick the advantages that match the scenario’s words and give at least one honest disadvantage.
Pairs that are designed as opposites — UTP vs fibre, hub vs switch, store-and-forward vs cut-through, distance vector vs link state, TCP vs UDP — mirror each other: one side’s advantage is the other’s disadvantage.
Chapter 1 · Parts 1 and 2: networks, topologies, network types, standards, layering. 9 topics.
Every device has a dedicated point-to-point link to every other device; N(N − 1)/2 links.
Source: Ch 1 Part 1 slides
Each device has a dedicated link to one central controller (hub or switch); N links.
Source: Ch 1 Part 1 slides
One main backbone cable; each device taps in with a drop line; 1 + N links.
Source: Ch 1 Part 1 slides
Each device links to the two devices on either side of it; N links.
Source: Ch 1 Part 1 slides
A combination, e.g. a star backbone joining bus networks (star–bus, star–ring).
Source: Ch 1 Part 1 slides (figure); pros/cons follow from the parts
Performance is measured by throughput and delay.
Source: Ch 1 Part 1 slides
Agreed rules so equipment from different vendors can talk.
Source: Ch 1 Part 1 slides
Network functions grouped into layers; layer n − 1 serves layer n through an interface.
Source: Ch 1 Part 2 slides
From Tutorial 1: who provides the services.
Source: Tutorial 1 (not on the slides)
Chapter 2 · Parts 1 and 2: signals, transmission, guided and unguided media. 8 topics.
Sending data as voltage pulses rather than a continuous wave.
Source: Ch 2 Part 1 slides
Both fight attenuation; an amplifier for analog, a repeater for digital.
Source: Ch 2 Part 1 slides (figure); tutorial
Two insulated copper wires twisted together, no shield.
Source: Ch 2 Part 2 slides
Twisted pair with a metal braid or foil covering.
Source: Ch 2 Part 2 slides
Glass or plastic core and cladding carrying light pulses.
Source: Ch 2 Part 2 slides
Omnidirectional wireless.
Source: Ch 2 Part 2 slides
Unidirectional, line-of-sight wireless.
Source: Ch 2 Part 2 slides
Short-range, line-of-sight wireless.
Source: Ch 2 Part 2 slides
Chapter 3 · Part 1 (framing, error control) and Part 2 (media access control). 15 topics.
One extra bit makes the number of 1s even (or odd).
Source: Ch 3 Part 1 slides
Parity for every row and every column of a block.
Source: Ch 3 Part 1 slides
Modulo-2 division by a generator polynomial.
Source: Ch 3 Part 1 slides
One's-complement sum of the words, complemented.
Source: Ch 3 Part 1 slides; Tutorial 4
Detect the error, then ask the sender to resend.
Source: Ch 3 Part 1 slides
Correct a limited number of errors at the receiver (2-D parity, XOR, interleaving).
Source: Ch 3 Part 1 slides
No station is superior; each decides when to send.
Source: Ch 3 Part 2 slides
Listen to the medium before transmitting.
Source: Ch 3 Part 2 slides
Busy → wait a random time, then sense again.
Source: Ch 3 Part 2 slides
Busy → keep listening; transmit with probability 1 as soon as it's idle.
Source: Ch 3 Part 2 slides
Idle → send with probability p, or wait one slot.
Source: Ch 3 Part 2 slides
Keep listening while sending; stop and jam on a collision.
Source: Ch 3 Part 2 slides
Stations take turns in an organized order.
Source: Ch 3 Part 2 slides
Split the channel by frequency band or by time slot.
Source: Ch 3 Part 2 slides
One channel carries everyone at once; codes separate the stations.
Source: Ch 3 Part 2 slides
Chapter 4: Ethernet frames, addresses, standards and full duplex. 3 topics.
Bus or star with a hub, using CSMA/CD.
Source: Ch 4 slides
Each station on its own point-to-point link to a switch.
Source: Ch 4 slides
Fast (100 Mbps), Gigabit (1000 Mbps), 10 Gigabit (10,000 Mbps).
Source: Ch 4 slides
Chapter 6: hubs, switches, routers and virtual LANs. 6 topics.
Copies received bits to every other port; no filtering.
Source: Ch 6 slides
Forwards frames by destination MAC address, learning its table.
Source: Ch 6 slides
Two ways a switch forwards frames.
Source: Ch 6 slides
Multiple paths between switches for reliability.
Source: Ch 6 slides
Forwards packets by destination IP address using a routing table.
Source: Ch 6 slides
Broadcast domains (subnets) created in software, not by wiring.
Source: Ch 6 slides
Chapter 7: packet switching, IPv4 addressing, DHCP, NAT. 7 topics.
A connection is set up first; all packets follow the same path.
Source: Ch 7 slides
Each packet is routed independently — the Internet's choice.
Source: Ch 7 slides
The mask, not the class, defines the network part.
Source: Ch 7 slides
Dividing a network into smaller subnets with their own subnet addresses.
Source: Ch 7 slides
Hands out IP address, mask, gateway and DNS server dynamically.
Source: Ch 7 slides
Maps private (local) addresses to the router's public address.
Source: Ch 7 slides
All host bits set to 1, sent to a specific remote network.
Source: Ch 7 slides
Chapter 8: routing tables, distance vector and link state, autonomous systems. 6 topics.
Shortest paths computed offline and entered by the administrator.
Source: Ch 8 slides
Routers learn the network by talking to their neighbours.
Source: Ch 8 slides
Ways to keep routing tables small.
Source: Ch 8 slides
Each router sends estimated costs to its neighbours.
Source: Ch 8 slides
Each router floods its exact link costs; every router builds the full map and runs Dijkstra.
Source: Ch 8 slides
Routing in steps: interior inside an AS, exterior (BGP) between ASs.
Source: Ch 8 slides
Chapter 9: process-to-process delivery, TCP and UDP. 3 topics.
Connection-oriented, reliable byte stream.
Source: Ch 9 slides
Connectionless, unreliable datagrams.
Source: Ch 9 slides
Independence vs dependency between segments.
Source: Ch 9 slides
Chapter 10: names, the DNS hierarchy and name resolution. 5 topics.
People use names; DNS maps them to IP addresses.
Source: Ch 10 slides
Where the name database is stored.
Source: Ch 10 slides
Servers remember recent answers.
Source: Ch 10 slides (advantage); the disadvantage is general knowledge
The primary loads the zone from disk; the secondary copies it (zone transfer).
Source: Ch 10 slides (roles); pros/cons follow from them
DNS uses port 53, normally over UDP.
Source: Ch 9 and Ch 10 slides