ExamShortcut

Networking: Devices, Topologies & Protocols

๐Ÿ”’ Log in to track
high importanceโšก 12 shortcuts5 subtopics

Network types and topologies, devices (hub/switch/router), the OSI model, IP addressing and TCP/UDP with port numbers. Device-to-layer matching and IP-class identification are CKT regulars.

Track record in the exam

Test difficulty mix (83 questions)

25 easy44 medium14 hard

Question patterns exams keep repeating

Taken from previous-year papers. If a pattern is marked "very common", expect to see it in your exam.

Device identification by job

very common
Spot it:

'Which device sends data to all ports', 'which device connects two different networks', 'which device regenerates a weak signal' โ€” a behaviour is described and the device named.

How to solve: Climb the ladder: hub = broadcasts to every port (Layer 1); switch = learns MAC addresses, sends only to the right port (Layer 2); router = joins different networks and routes by IP (Layer 3); repeater = regenerates signals; modem = modulator-demodulator; gateway = protocol converter. Match the verb in the question to the one-line job.

Example: Which device forwards a data packet towards the correct network using IP addresses?

Router โ€” it works on Layer 3, reading IP addresses and choosing the best path between networks.

Learn this in โ€œNetwork devicesโ€ โ†’

OSI layer count, order and functions

very common
Spot it:

'How many layers in the OSI model', 'routing/encryption/framing is a ___ layer function', 'a router/switch works at which layer', correct-order statements.

How to solve: Fix the map: 7 layers โ€” Physical (bits), Data Link (frames, MAC), Network (IP, routing), Transport (TCP/UDP, ports), Session (dialogues), Presentation (translation, encryption, compression), Application (HTTP, FTP, SMTP). Devices: hub 1, switch 2, router 3. The planted traps: encryption at Application, routing at Transport.

Example: In the OSI model, routing of packets is the function of which layer?

Network (Layer 3) โ€” IP addressing and route selection; Transport (4) only delivers end to end.

Learn this in โ€œOSI and TCP/IP reference modelsโ€ โ†’

IP class identification

very common
Spot it:

An address is printed (10.0.0.5, 130.10.5.2, 196.1.2.3, 225.1.1.1) and its class asked; or the first-octet range of a class; or 'which is a private address'; 'what is 127.0.0.1'.

How to solve: Read the FIRST octet only against the ruler 1(A) - 128(B) - 192(C) - 224(D) - 240(E); 127 = loopback. Private ranges: 10.x.x.x, 172.16-31.x.x, 192.168.x.x. Multicast = Class D. One octet decides everything โ€” do not read the second number.

Example: The IP address 130.10.5.2 belongs to which class?

Class B โ€” the first octet 130 lies between 128 and 191.

Learn this in โ€œIP addressing: IPv4 classes and IPv6โ€ โ†’

Port-number matching

very common
Spot it:

'HTTPS works on which port', 'SMTP port', 'FTP uses which ports', or a matched pair where one number is shifted.

How to solve: Anchors: HTTP 80, HTTPS 443, FTP 21 (data 20), SSH 22, Telnet 23, SMTP 25, DNS 53, POP3 110, IMAP 143. The classic trap swaps 80 and 443, or pairs POP3 with 143 (that is IMAP). Climb 21-22-23 for FTP-SSH-Telnet.

Example: Data transfer of the World Wide Web over an encrypted connection uses which default port?

443 โ€” HTTPS; plain HTTP uses port 80.

Learn this in โ€œProtocols and port numbers; TCP vs UDPโ€ โ†’

TCP vs UDP selection

very common
Spot it:

'Which protocol for live streaming / file download', 'which is connection-oriented', statements about reliability and speed.

How to solve: TCP = connection-oriented, reliable, ordered โ€” web pages, e-mail, file transfer. UDP = connectionless, fast, no guarantee โ€” live streaming, gaming, VoIP, DNS queries. The recurring answer: live video = UDP; downloading a file = TCP.

Example: Which protocol would a live video streaming service prefer?

UDP โ€” speed matters more than perfect delivery; TCP's retransmissions would only pause the stream.

Learn this in โ€œProtocols and port numbers; TCP vs UDPโ€ โ†’

Topology identification

common
Spot it:

'Every computer connected to a central hub', 'every node connected to every other node', 'all computers share a single backbone' โ€” the layout described and the topology asked.

How to solve: Central device with all nodes = Star; every node to every other = Mesh; one shared backbone with terminators = Bus; circle of neighbours = Ring; stars joined on a backbone = Tree. Also know failure points: star dies with its hub, bus dies with its backbone, mesh is the most reliable.

Example: In which topology does every node have a direct link to every other node?

Mesh โ€” the most reliable topology, needing n(n-1)/2 links.

Learn this in โ€œNetwork types and topologiesโ€ โ†’

Mesh link count (numeric)

occasional
Spot it:

'How many links are required for a mesh of 5/6/8 computers' โ€” pure arithmetic.

How to solve: links = n x (n-1) / 2. For n = 4 give 6; n = 5 give 10; n = 6 give 15; n = 8 give 28. The trap option is n squared or the unhalved n(n-1).

Example: How many cable links are needed for a full mesh of 6 computers?

6 x 5 / 2 = 15 links.

Learn this in โ€œNetwork types and topologiesโ€ โ†’

Your next step

New here? Start with subtopic 1 in Learn. Revision mode? Jump straight to the test and let it tell you what to fix.