Revision approach
- Signals → frames → packets → applications
- Address plans with explicit masks
- Four blueprint outcomes
👁 Full explanation
Learn how signals become frames, packets and application data, then practise address plans with explicit masks. This chapter develops all four blueprint outcomes through networking concepts and practical procedures. - Message descent and ascent
- MAC versus IP versus ports
👁 Full explanation
Trace one message down and up the layers; distinguish MAC, IP and port addresses. - Address-plan calculation order
- Masks; network and broadcast bounds
- Capacity before choices
- Largest LAN allocation first
- Validate entire plan
👁 Full explanation
Calculate masks, network/broadcast bounds and capacity before looking at choices. Allocate largest LANs first and validate the full plan. - Retrieval through comparisons and microexamples
- Explain competing-answer failures
- Flagged flawed question-index items
👁 Full explanation
Use comparison tables and microexamples for retrieval practice, then explain why competing answers fail. Check the protocol, addressing and scope assumptions before selecting an answer.
NET01
Communication components and quality
[Exam Focus]- Communication components
- Data: raw representations
- Information: interpreted data
- Message; sender; receiver; medium; protocol
- Source creates data
- Transmitter: data → signal
- Receiver reconstructs data
- Distance: engineering factor, not sixth component
👁 Full explanation
Data are raw representations; information is data interpreted for a purpose. Communication requires a message, sender, receiver, medium and agreed protocol. A source creates data; a transmitter converts it to a signal; a receiver reconstructs data. Distance affects engineering but is not a sixth component. - Communication quality
- Delivery: intended recipient
- Accuracy: preserved content
- Timeliness: deadline
- Jitter: arrival-delay variation
- Average delay can conceal disruptive jitter
- Throughput: achieved transfer rate
- Reliability: dependable operation
- Security: unauthorized actions
- Scalability: growth without unacceptable degradation
👁 Full explanation
Delivery means reaching the intended recipient; accuracy means preserving content; timeliness means meeting a deadline; jitter means variation in arrival delay. A call can have acceptable average delay yet sound broken because of jitter. Throughput measures achieved transfer rate, reliability measures dependable operation, and security concerns unauthorized actions. Scalability means accommodating growth without unacceptable service degradation.
5 related practice questions
Blueprint: LO1 · Note references: NET-M, NET-N
- Communication components
NET02
Network size, access and architecture
- Network geographic scope
- PAN: personal Bluetooth devices
- LAN: building or campus
- MAN: metropolitan region
- WAN: distant regions
- Device count alone insufficient
- Internet: global network of networks
- Internet as largest WAN example
👁 Full explanation
PAN connects personal devices, such as Bluetooth accessories. LAN covers a local building or campus; MAN spans a metropolitan region; WAN connects distant regions. Device count alone does not determine the category. The Internet is a global network of networks, commonly the largest example of a WAN. - Access scope and service roles
- Intranet: organizational internal services
- Extranet: approved outsiders
- Access scope ≠ geographic size
- Client requests; server supplies
- Peers perform both roles
- Dedicated servers can also be clients
- DNS; backup; update dependencies
- Ten-user cutoff: guideline only
- Centralization: simpler administration, concentrated dependencies
- Peer networks still require security
👁 Full explanation
An intranet serves an organization internally; an extranet exposes selected services to approved outsiders. Neither term alone specifies geographic size. A client requests a service; a server supplies it. Peer systems may perform both roles. Dedicated servers concentrate on service workloads but can still be clients of DNS, backup or update services. A ten-user cutoff is a teaching guideline, not a technical law. Centralization simplifies administration but creates dependencies; peer networks still need security.
11 related practice questions
Note references: NET-M, NET-N
- Network geographic scope
NET03
Protocols, standards and layers
[Exam Focus]- Protocols and standards
- Syntax: message structure
- Semantics: field meanings
- Timing: exchange schedule and rate
- Standards enable interoperability
- De facto: established use
- De jure: formal approval
- ISO: international standards
- IEEE: 802.3 Ethernet; 802.11 Wi-Fi
- ITU-T: telecommunications
- ANSI: US standards coordination
- EIA: interface standards
- FCC: regulator
👁 Full explanation
Protocol syntax defines message structure, semantics defines field meanings, and timing defines when/how fast exchanges occur. A standard supports interoperability. De facto means established through use; de jure means formally approved. ISO develops international standards; IEEE develops LAN standards such as 802.3 and 802.11; ITU-T develops telecommunications standards. ANSI coordinates US standards, EIA is associated with interface standards, and FCC is a regulator. - Layer models
- Reference model: responsibilities and interfaces
- Model ≠ executable software
- OSI: seven reference layers
- TCP/IP: implemented suite, usually four layers
- Five-layer model separates physical and link
- State model before counting
👁 Full explanation
A reference model divides responsibilities and interfaces; it is not itself executable networking software. OSI is a seven-layer reference model; TCP/IP describes an implemented protocol suite, usually taught with four layers. A five-layer teaching model separates physical and link functions. State the model before counting layers.
3 related practice questions
Blueprint: LO2, LO3 · Note references: NET-M, NET-N
- Protocols and standards
NET04
Signals, periods and bandwidth
[Exam Focus]- Signal characteristics
- Analog: continuous; digital: discrete symbols
- Data type ≠ signal type
- Digital bits modulate analog carriers
- Sine wave: amplitude, frequency, phase
- f: cycles/second
- T=1/f
- λ=v/f; propagation speed v
- Phase: within-cycle displacement
- Composite signals combine frequencies
👁 Full explanation
Analog signals vary continuously; digital signals use discrete symbol states. Data and signal types are separate: digital bits can modulate an analog carrier. A sine wave has amplitude, frequency and phase. Frequency f counts cycles/second, period T=1/f, and wavelength λ=v/f depends on propagation speed v. Phase specifies displacement within a cycle. Composite signals combine frequencies. - Bandwidth and carrier placement
- Frequency bandwidth=highest−lowest; hertz
- Low-pass includes zero frequency
- Band-pass: nonzero frequency range
- Baseband: no carrier shift
- Passband: modulated carrier
- Hz ≠ bit/s
- 2 kHz → T=0.5 ms
👁 Full explanation
Frequency bandwidth is highest minus lowest frequency, measured in hertz. A low-pass channel includes zero frequency; a band-pass channel occupies a nonzero frequency range. Baseband sends the signal without shifting it to a carrier; passband transmission modulates a carrier. Do not confuse hertz with bit/s, even though both are informally called bandwidth. At 2 kHz, one period is 0.5 ms.
1 related practice question
Blueprint: LO1 · Note references: NET-M, NET-N
- Signal characteristics
NET05
Bit rate, baud and channel capacity
[Exam Focus]- Bit rate versus baud
- R: bits/second; bit interval=1/R
- Baud: symbols/second, not voltage transitions
- M states → log2(M) bits/symbol
- R=baud×log2(M), before coding overhead
- Manchester: extra transitions
- Binary ≠ universally baud=bit rate
👁 Full explanation
Bit rate R is bits/second; a bit interval is 1/R. Baud is symbols/second, not necessarily the number of voltage transitions. With M equally encoded symbol states, each symbol can carry log2(M) bits; R=baud×log2(M), before coding overhead. Binary Manchester uses extra transitions, so binary does not universally mean baud equals bit rate. - Channel capacity bounds
- Nyquist: ideal noiseless channel
- R≤2B log2(M)
- Shannon: Gaussian noise
- C=B log2(1+S/N)
- S/N: linear power ratio
- SNR(dB)=10 log10(S/N)
- Bandwidth; signal levels; noise
- Distance affects attenuation, delay, achievable rate
- Distance absent from simplified formulas
👁 Full explanation
For an ideal noiseless channel, Nyquist gives R≤2B log2(M). For Gaussian noise, Shannon gives C=B log2(1+S/N), with a linear power ratio; SNR(dB)=10 log10(S/N). Bandwidth, signal levels and noise appear explicitly. Distance affects attenuation, delay and often achievable rate, but is not a separate variable in these simplified capacity formulas. - Worked example Nyquist and Shannon example
- B=3000 Hz; M=4
- 2×3000×log2(4)=12,000 bit/s
- S/N=15 → log2(16)=4
- Shannon limit=12,000 bit/s
- 15 dB ≠ linear ratio 15
👁 Full explanation
Worked exampleB=3000 Hz and M=4 give a 12,000 bit/s noiseless limit. If S/N=15, Shannon also gives 3000×log2(16)=12,000 bit/s. Do not insert 15 dB as a linear ratio.
2 related practice questions
Blueprint: LO1 · Note references: NET-M, NET-N, NET-UF
- Bit rate versus baud
NET06
Delay, impairments and transmission modes
[Exam Focus]- Delay components
- Transmission delay=packet bits/link bit rate
- Propagation delay=distance/signal speed
- Processing delay; queueing delay
- 1000 bytes at 10 Mbit/s
- Serialization=0.8 ms
- Higher rate leaves propagation unchanged
👁 Full explanation
Transmission delay is packet bits divided by link bit rate; propagation delay is distance divided by signal speed. Processing and queueing add delay. A 1000-byte packet takes 0.8 ms to serialize at 10 Mbit/s; increasing line rate does not reduce propagation time. - Signal impairments
- Attenuation: reduced strength
- Distortion: changed shape, unequal frequency delays
- Noise: unwanted energy
- Thermal noise: random thermal motion
- Crosstalk: nearby-channel leakage
- Impulse noise: short disturbance
- Amplifiers amplify noise too
- Digital repeaters regenerate decisions
- Corrupted bits not always recoverable
👁 Full explanation
Attenuation reduces signal strength. Distortion changes shape, often because frequencies have different delays. Noise adds unwanted energy: thermal noise comes from random thermal motion, crosstalk leaks from nearby channels, and impulse noise is a short disturbance. Amplifiers amplify noise too; digital repeaters regenerate decisions but cannot reconstruct every corrupted bit. - Transmission modes
- Simplex: one direction
- Half duplex: alternating directions, walkie-talkie
- Full duplex: simultaneous directions, telephone
- Serial: sequential bits
- Parallel: multiple conductors, skew risk
- Asynchronous serial: character start/stop bits
- Synchronous framing: ongoing clock recovery
- Serial timing ≠ browser asynchronous requests
👁 Full explanation
Simplex is one way, half duplex alternates directions, and full duplex permits simultaneous sending/receiving. A walkie-talkie is half duplex; a telephone conversation uses full duplex. Serial sends sequential bits; parallel uses multiple conductors and may suffer skew. Character-oriented asynchronous serial adds start/stop bits; synchronous framing uses ongoing clock recovery. Neither is synonymous with browser asynchronous requests.
9 related practice questions
Blueprint: LO1 · Note references: NET-M, NET-N
- Delay components
NET07
Cables, wireless and connectors
[Exam Focus]- Guided media
- Twisted pairs reduce coupled interference
- UTP: unshielded; STP: shielded
- Coax: axial conductor and outer shield
- Fiber: guided light; EMI resistance
- Fiber: high capacity and long reach
- Suitable optics and installation required
- Specification determines speed, cost, reach
- Fiber remains tappable
👁 Full explanation
Twisted pairs reduce coupled interference; UTP has no added shield and STP adds shielding. Coax has an inner conductor and outer shield sharing an axis. Fiber guides light and resists electromagnetic interference; it supports high capacity and long reach, but requires suitable optics and installation. Exact speed, cost and reach depend on the specification, not the material alone. Fiber can still be tapped. - Unguided media and Ethernet cables
- Radio; microwave; infrared
- Ground waves follow Earth
- Sky waves: ionized-layer reflection
- Line-of-sight requires visibility
- Microwaves belong to radio spectrum
- Infrared generally blocked by walls
- Antenna determines directionality
- Omnidirectional: broad azimuth, not uniform 3-D
- Straight-through: unlike MDI/MDI-X roles
- Crossover: like roles, PC–PC, switch–switch
- Auto-MDI-X removes legacy cable constraint
👁 Full explanation
Radio, microwave and infrared are unguided media. Ground waves follow Earth, sky waves can reflect from ionized layers, and line-of-sight paths require suitable visibility. Microwaves are radio waves in the broader physical classification. Infrared generally does not penetrate walls. Directionality depends on antennas: omnidirectional means broad azimuth coverage, not equal radiation in every 3-D direction. Legacy Ethernet straight-through cables join unlike MDI/MDI-X roles; crossover joins like roles, such as PC–PC or switch–switch. Auto-MDI-X can remove that requirement.
10 related practice questions
Blueprint: LO1, LO2 · Note references: NET-M, NET-N
- Guided media
NET08
Topology and failure reasoning
[Exam Focus]- Topology and link scope
- Physical: link layout
- Logical: communication/access relationships
- Point-to-point: two endpoints
- Multipoint: shared medium
- Full mesh uses point-to-point links
- Contradictory module mesh statement
👁 Full explanation
Physical topology describes link layout; logical topology describes communication/access relationships. Point-to-point links join two endpoints; multipoint links share a medium. A full mesh consists of point-to-point links. - Topology failure reasoning
- Bus: shared backbone; unterminated-break disruption
- Star: central device
- Star edge failure: one endpoint
- Star central failure: whole star
- Ring: loop; single-break vulnerability
- Protected dual rings differ
- Token Ring uses token passing
- Token access not inherent to rings
- Tree: hierarchy; hybrid: combined arrangements
👁 Full explanation
Bus uses a shared backbone; an unterminated break can disrupt the segment. Star connects endpoints through a central device: one edge failure isolates that endpoint, whereas central failure affects the star. Ring forms a loop; basic single rings are vulnerable to a break, while protected dual rings differ. Token passing is associated with Token Ring but is an access method, not a necessary property of every ring. Tree is hierarchical; hybrid combines arrangements. - Full undirected mesh calculations
- Links=n(n−1)/2
- Interfaces/node=n−1
- 50 nodes → 1225 links
- Redundancy improves fault tolerance
- Higher cable and interface cost
👁 Full explanation
A full undirected mesh of n nodes needs n(n-1)/2 links and n-1 interfaces per node. For 50 nodes: 50×49/2=1225 links. Redundant paths improve fault tolerance at greater cable and interface cost.
17 related practice questions
Blueprint: LO1 · Note references: NET-M, NET-N
- Topology and link scope
NET09
NICs, repeaters and hubs
[Exam Focus]- NIC and physical functions
- NIC: computer network interface
- NIC commonly implements physical and link
- Physical interface ≠ exclusively layer 1
- Connectors; signaling; voltage; timing
- Physical coding and modulation
- PHY–MAC interface: hardware signaling
👁 Full explanation
A NIC supplies a computer’s network interface and commonly implements both physical and link functions. Calling a NIC a physical interface does not mean all its functions are layer 1. Physical specifications include connectors, signaling, voltage, timing and physical coding/modulation; the PHY interface to MAC handles hardware signaling. - Repeaters, hubs and device roles
- Repeater: layer-1 signal regeneration
- No destination-address inspection
- Active hub: multiport repeater
- Signals repeated onto other ports
- Half-duplex hub: shared collision domain
- Passive hub: connector
- No MAC learning or collision elimination
- Network printer: endpoint consuming services
- Routers; hubs; access points: intermediaries
👁 Full explanation
A repeater regenerates layer-1 signals without inspecting destination addresses. An active hub is a multiport repeater: it repeats incoming signals onto other ports, placing half-duplex endpoints in one collision domain. A passive hub is a connector. A hub neither learns MAC addresses nor eliminates collisions. An endpoint such as a network printer consumes services; routers, hubs and access points are intermediary devices. - Legacy IEEE 802.3 PHY architecture
- AUI: attachment unit interface
- MAU: medium attachment unit
- MAC interfaces to PLS
- PLS: Physical Signaling sublayer
- Physical-layer signaling: PLS
- Architecture-specific, not universal OSI terminology
- Other PHY designs: RS; PCS; PMA
- Reconciliation; coding; medium attachment
👁 Full explanation
In the legacy IEEE 802.3 architecture with an attachment unit interface (AUI) and medium attachment unit (MAU), the MAC interfaces to the Physical Signaling (PLS) sublayer. For this legacy MAC interface, the relevant sublayer is PLS. This name is architecture-specific: other PHY designs use reconciliation (RS), physical coding (PCS), physical medium attachment (PMA) and related sublayers. Do not present PLS as a universal OSI sublayer name.
14 related practice questions
Blueprint: LO2 · Note references: NET-M, NET-N, NET-IEEEPLS
- NIC and physical functions
NET10
Bridges, switches and access points
[Exam Focus]- Layer-2 bridges and switches
- Learn source-MAC-to-port mappings
- Look up destination MAC
- Known unicast: destination port
- Same incoming segment: filter
- Unknown unicast or broadcast: VLAN flood
- Switch need not select one port
- Wireless AP: wireless–wired link bridge
👁 Full explanation
A bridge or ordinary Ethernet switch operates at layer 2. It learns source-MAC-to-port mappings, looks up the destination, forwards a known unicast to its port, filters it if the destination is on the incoming segment, and floods an unknown unicast or broadcast within its VLAN. A switch does not always send only to one destination port. Wireless access points normally bridge wireless and wired link-layer traffic. - Switch collision and broadcast boundaries
- Separate collision domain per port
- Full-duplex point-to-point Ethernet: no collisions
- Full duplex: no CSMA/CD
- Independent simultaneous conversations
- Broadcasts remain within VLAN
- Additional controls may filter broadcasts
- Layer-3 switch also routes
- Function overrides marketing name
👁 Full explanation
Each switch port separates collision domains; full-duplex point-to-point Ethernet has no collisions and does not use CSMA/CD. Switching permits independent conversations simultaneously. Broadcasts still reach the VLAN unless another control filters them. A layer-3 switch also routes, so device marketing names do not override the function being examined.
10 related practice questions
Blueprint: LO2 · Note references: NET-M, NET-N
- Layer-2 bridges and switches
NET11
Routers, gateways and traffic controls
[Exam Focus]- Routers and gateways
- IP forwarding: destination prefixes, next hops
- Routers separate broadcast domains
- Local link broadcasts normally stopped
- Default gateway: usually router
- Protocol gateway: application-format translation
- Gateway ≠ inherently every OSI layer
👁 Full explanation
Routers forward IP packets between networks using destination prefixes and next hops. They separate broadcast domains and normally do not forward local link broadcasts. A default gateway is usually a router, while a protocol gateway can translate application formats; therefore a gateway is not inherently a device that implements every OSI layer. - Firewall, VPN and modem
- Firewall: policy-based allow/reject/inspect
- Firewall need not encrypt
- VPN: Virtual Private Network
- Logical private connection over another network
- Secure VPN: tunnel authentication and encryption
- Modem: outgoing modulation, incoming demodulation
- Home router may combine distinct functions
👁 Full explanation
A firewall allows, rejects or inspects traffic under a security policy; it does not necessarily encrypt. A VPN, Virtual Private Network, provides a logical private connection over another network; a secure VPN authenticates/encrypts its tunnel. A modem modulates outgoing and demodulates incoming carrier signals. These functions may coexist in one home router but remain conceptually distinct.
10 related practice questions
Blueprint: LO2 · Note references: NET-M, NET-N
- Routers and gateways
NET12
OSI layers and encapsulation
[Exam Focus]- Encapsulation and routed hops
- Application data → segment/datagram → packet
- Packet → frame → bits/symbols
- Receiving reverses encapsulation
- Each layer serves layer above
- Router removes incoming link frame
- Router inspects IP; creates next-hop frame
- MAC addresses usually change per hop
- End-to-end IP ordinarily persists until translation
👁 Full explanation
Sending proceeds from application data to transport segment/datagram, network packet, link frame and physical bits/symbols; receiving reverses the order. Each layer serves the layer above. A router removes a received link frame, inspects IP, and creates a new link frame for the next hop. MAC addresses usually change across routed hops; end-to-end IP addresses ordinarily remain until translation. - 7 Application
- Network services for applications
- Message/data
👁 Full explanation
Layer Main duty Typical unit/address 7 Application Network services for applications Message/data - 6 Presentation
- Representation; compression; encryption
- Data
👁 Full explanation
Layer Main duty Typical unit/address 6 Presentation Representation, compression, encryption roles Data - 5 Session
- Dialog setup; checkpoints; recovery
- Data
👁 Full explanation
Layer Main duty Typical unit/address 5 Session Dialog setup, checkpoints, recovery Data - 4 Transport
- Process delivery; segmentation
- Protocol-dependent reliability
- TCP segment; UDP datagram; port
👁 Full explanation
Layer Main duty Typical unit/address 4 Transport Process delivery, segmentation; protocol-dependent reliability TCP segment or UDP datagram; port - 3 Network
- Logical addressing; routing
- Packet; IP
👁 Full explanation
Layer Main duty Typical unit/address 3 Network Logical addressing and routing Packet; IP - 2 Data link
- Hop delivery; framing; MAC access
- Error detection
- Frame; MAC
👁 Full explanation
Layer Main duty Typical unit/address 2 Data link Hop delivery, framing, MAC access and error detection Frame; MAC - 1 Physical
- Signaling; bit/symbol transport
- Bits/symbols
👁 Full explanation
Layer Main duty Typical unit/address 1 Physical Signaling and bit/symbol transport Bits/symbols
17 related practice questions
Blueprint: LO3 · Note references: NET-M, NET-N
- Encapsulation and routed hops
NET13
Link control, framing and error detection
[Exam Focus]- Link control and framing
- LLC: upper-protocol identification/multiplexing
- LLC may provide link control
- MAC: medium-dependent addressing/access, frame delivery
- Network addressing: layer 3
- Ethernet; PPP; HDLC: link protocols
- Headers: addresses, control/type fields
- Synchronization and framing depend on protocol
👁 Full explanation
Link-layer LLC identifies or multiplexes upper-layer protocols and may supply link control; MAC handles medium-dependent addressing/access and frame delivery. Network addressing belongs to layer 3. Ethernet, PPP and HDLC are link protocols. Frame headers may carry addresses and control/type fields; synchronization and exact framing depend on the protocol. - Error detection versus recovery
- Redundancy detects, not necessarily corrects
- Even parity: even total ones
- 1011 → parity bit 1
- Odd flips detected; even counts missed
- CRC: polynomial bits, XOR-division remainder
- Receiver repeats CRC division
- Internet checksum: end-around carry, complemented sum
- Burst: first–last corruption, unchanged interiors included
- Recovery: retransmission or sufficient FEC redundancy
👁 Full explanation
Detection adds redundancy but does not guarantee correction. Even parity adds a bit so the total number of ones is even: 1011 needs parity 1. It detects every odd number of bit flips but misses even counts. CRC treats bits as a polynomial and appends the XOR-division remainder; the receiver repeats the division. Internet checksums add words with end-around carry and complement the sum. A burst spans from the first corrupted bit through the last, including unchanged interior bits. Retransmission or sufficient forward-error-correcting redundancy is needed for recovery.
9 related practice questions
Blueprint: LO1, LO2 · Note references: NET-M, NET-N
- Link control and framing
NET14
Access control and reliable-link procedures
[Exam Focus]- Random access
- ALOHA: opportunistic sending
- CSMA: carrier sensing
- Legacy half-duplex Ethernet: CSMA/CD
- Collision→jam→stop→random backoff
- Jam indicates collision, not clearance
- Wi-Fi 802.11: CSMA/CA
- Waiting/backoff and acknowledgments
- Hidden terminals remain despite sensing
👁 Full explanation
Random access allows contention: ALOHA sends opportunistically; CSMA senses before sending. In legacy half-duplex Ethernet, CSMA/CD detects collision, sends a jam indication, stops, and retries after random backoff. The jam signals a collision, not its clearance. Wi-Fi 802.11 uses CSMA/CA with waiting/backoff and acknowledgments; sensing does not eliminate hidden-terminal collisions. - Controlled access and reliable links
- Polling; reservation; token turns
- Correct coordination avoids contention collisions
- Channelization: frequency, time, code
- Stop-and-wait: one frame, await ACK
- Timeout retransmission; sequence-bit duplicate detection
- Sliding window: multiple unacknowledged frames
- Link reliability/flow control: hop-local
- Transport reliability/flow control: end-to-end
- Ethernet detects corruption without delivery guarantee
👁 Full explanation
Controlled access uses polling, reservations or a token to grant turns; correctly coordinated access avoids contention collisions. Channelization divides frequency, time or code resources. Stop-and-wait sends one frame and waits for ACK, retransmitting on timeout; sequence bits distinguish duplicates. Sliding windows permit multiple unacknowledged frames. Link reliability/flow control is hop-local; transport reliability/flow control is end-to-end. Ethernet detects corruption but does not itself guarantee reliable delivery.
7 related practice questions
Blueprint: LO1, LO2 · Note references: NET-M, NET-N
- Random access
NET15
Line coding, modulation and sampling
- Line coding
- Digital bits → digital signal patterns
- NRZ: no forced mid-bit return
- Manchester: clocking mid-bit transition
- Manchester bit convention must be specified
- Differential Manchester: relative-state transitions
- AMI: alternating successive-one polarities
- Pseudoternary: alternating zero pulses
- Block coding adds redundancy
- Scrambling replaces problematic patterns
- Scrambling need not increase bit count
- Multilevel: 2B1Q; 8B6T
- MLT-3: voltage-transition sequence
👁 Full explanation
Line coding maps digital bits to digital signal patterns. NRZ uses levels without a forced mid-bit return; Manchester supplies a mid-bit transition for clocking, with bit convention specified. Differential Manchester encodes using transitions relative to previous state. AMI alternates the polarity of successive ones; pseudoternary alternates zero pulses. Block coding adds code redundancy; scrambling replaces problematic patterns without necessarily increasing bit count. Multilevel schemes include 2B1Q and 8B6T; MLT-3 uses a sequence of voltage transitions. - Modulation and digitization
- ASK: amplitude; FSK: frequency; PSK: phase
- QAM: amplitude plus phase
- AM/FM/PM carry analog data
- PCM: sampling→quantization→encoding
- Practical sampling: fs>2fmax
- b bits → 2^b levels
- Uncompressed rate=fs×b
- PAM: pulse amplitude; PWM: pulse width
- PAM/PWM alone ≠ binary PCM code
👁 Full explanation
ASK varies carrier amplitude, FSK frequency, PSK phase; QAM combines amplitude and phase. AM/FM/PM can carry analog data. PCM digitizes analog input by sampling, quantizing and encoding. Sampling must exceed twice the highest retained baseband frequency in practical designs; b-bit samples have 2^b quantization levels and uncompressed rate fs×b. PAM/PWM are pulse modulation methods; pulse amplitude or width alone is not a binary PCM code.
2 related practice questions
Note references: NET-M, NET-N
- Line coding
NET16
Network delivery and IPv4 header
[Exam Focus]- IPv4 service and header
- IP: connectionless best-effort delivery
- No end-to-end ordering or retransmission
- IPv4 address: 32 bits
- Header: 20–60 bytes, not 32 bits
- IHL: 32-bit words
- Total length: header plus payload
- TTL limits router lifetime
- Protocol field: TCP, UDP, upper protocol
👁 Full explanation
IP supplies connectionless best-effort packet delivery, not end-to-end ordering or retransmission. IPv4 addresses are 32 bits. Its minimum header is 20 bytes and can grow to 60 bytes; it is not a 32-bit header. IHL counts 32-bit words; total length includes header and payload. TTL limits lifetime across routers; the protocol field identifies TCP, UDP or another upper-layer protocol. - IPv4 checksum and fragmentation
- Header checksum exists
- Module no-error-checking claim incorrect
- Identification; flags; fragment offset
- Sources and routers fragment when allowed
- Destination reassembles
- DF plus insufficient MTU: forwarding fails
- Possible ICMP diagnostic
👁 Full explanation
The IPv4 checksum protects its header; IP does not lack error checking altogether. Identification, flags and offset support fragmentation. IPv4 sources and routers may fragment when allowed; reassembly occurs at the destination. If DF is set and the next MTU is too small, forwarding fails and an ICMP diagnostic may be returned.
6 related practice questions
Blueprint: LO3 · Note references: NET-M, NET-N, NET-R791
- IPv4 service and header
NET17
Transport choice, ports and connections
[Exam Focus]- TCP versus UDP
- TCP: reliable ordered byte stream
- Sequence numbers; ACKs; retransmission; windows
- Flow control protects receiver
- Congestion control protects network
- UDP: independent datagrams, ports, checksum
- No built-in setup, reliability, retransmission, ordering
- Interactive traffic: late versus lost data
- Application reliability possible over UDP
👁 Full explanation
TCP offers a reliable ordered byte stream using sequence numbers, acknowledgments, retransmission and windows. Flow control protects the receiver; congestion control protects network capacity. UDP sends independent datagrams with ports and a checksum but no built-in setup, delivery guarantee, retransmission or ordering. Live interactive traffic may choose UDP when late data is less useful than lost data. Application protocols can add reliability over UDP. - Transport endpoints
- Ports identify transport endpoints
- Application chooses transport
- Socket buffer requests subject to OS limits
- TCP connection: source/destination IP and ports
- TCP protocol understood in four-tuple
- IPv4 protocol number ≠ port
- 80: usual HTTP port
- Clients often use ephemeral ports
- SCTP: reliable messages, multiple streams
👁 Full explanation
Ports identify transport endpoints; the application can choose a transport and request socket buffer sizes, subject to OS limits. A TCP connection is identified by source/destination IP and source/destination port, with TCP understood. IPv4 protocol numbers identify upper protocols; 80 is a usual HTTP port, not an IP protocol number. Clients often use ephemeral ports. SCTP is a reliable message-oriented transport with multiple streams.
21 related practice questions
Blueprint: LO3 · Note references: NET-M, NET-N, NET-R9293
- TCP versus UDP
NET18
Trace the TCP handshake
[Exam Focus]- TCP three-way handshake
- SYN → SYN+ACK → ACK
- SYN consumes one sequence position
- ACK: next expected sequence
- Client ISN=395; server ISN=260
- Client SYN: seq395
- Server SYN+ACK: seq260 ack396
- Client ACK: seq396 ack261
- Application byte counts advance sequence numbers
- FIN consumes one sequence position
👁 Full explanation
TCP establishes state with SYN, SYN+ACK, then ACK. SYN consumes one sequence position even with no application bytes. An acknowledgment states the next expected sequence number. For client ISN=395 and server ISN=260: client sends SYN seq395; server sends SYN+ACK seq260 ack396; client sends ACK seq396 ack261. Later byte counts advance sequence numbers. FIN also consumes one sequence position. - TCP connection interpretation
- Logical transport state, no reserved circuit
- Ports multiplex separate applications
- Separate applications ≠ one TCP stream
- Layer-4 reliability depends on protocol
👁 Full explanation
TCP setup creates a logical transport connection, not a reserved physical circuit. Ports allow multiplexing separate applications over IP; they do not combine all applications into one TCP byte stream. Do not assign TCP reliability to all layer-4 protocols merely because the reference layer lists reliability as a possible service.
1 related practice question
Blueprint: LO3 · Note references: NET-M, NET-R9293
- TCP three-way handshake
NET19
Upper layers and the TCP/IP correspondence
[Exam Focus]- OSI upper-layer roles
- Session: dialog establishment and management
- Checkpoints enable interrupted-transfer recovery
- Presentation: encoding translation, compression, encryption
- Compression reduces representation size
- Encryption hides content, need not shrink
- Application protocols serve applications directly
- Practical functions distributed differently
- TLS ≠ separate physical presentation device
👁 Full explanation
OSI session roles establish/manage dialogs and can coordinate checkpoints so transfer resumes after interruption. Presentation roles translate encodings and handle compression/encryption. Compression reduces representation size; encryption hides content and need not shrink it. Application protocols provide services directly to applications. Practical implementations distribute these functions differently; TLS is not proof of a separate physical presentation-layer device. - TCP/IP correspondence
- OSI 5–7 → application
- Transport retained
- OSI network → Internet
- Link plus physical → network access
- Model does not guarantee reliability
- Application service builds on process transport
- Vague service labels may overlap
👁 Full explanation
The four-layer TCP/IP model folds OSI layers 5–7 into application, retains transport, calls layer 3 Internet, and combines link/physical as network access. A model is a guide to functions, not a guarantee that every application gets a reliable network. Distinguish end-to-end application service from its underlying process-to-process transport.
15 related practice questions
Blueprint: LO3 · Note references: NET-M, NET-N
- OSI upper-layer roles
NET20
DNS, DHCP and address resolution
[Exam Focus]- DNS and DHCP
- DNS: names → records
- A: IPv4; AAAA: IPv6
- DNS: UDP or TCP port 53
- DHCP: dynamic IPv4 leases
- Address; mask; gateway; DNS server
- Discover → offer → request → acknowledge
- IP itself does not assign addresses
👁 Full explanation
DNS resolves names to records, including IPv4 A and IPv6 AAAA addresses; it can use UDP or TCP port 53. DHCP dynamically leases IPv4 settings, commonly address, mask, gateway and DNS server. Its basic exchange is discover, offer, request, acknowledge. IP itself does not assign addresses. - Address resolution and companion protocols
- ARP: on-link IPv4 next-hop → MAC
- Broadcast request; normally unicast reply
- Off-subnet ARP resolves gateway MAC
- Remote target MAC not resolved
- Network/link boundary; often link-layer classification
- Network-protocol label: loose textbook convention
- RARP: hardware → IP
- BOOTP/DHCP: boot configuration
- ICMP: errors and diagnostics
- IGMP: IPv4 multicast membership
- Companions ≠ constituent pieces of IP
👁 Full explanation
ARP resolves an on-link IPv4 next hop to a link address, using a broadcast request and normally unicast reply. For an off-subnet target, ARP resolves the gateway, not the remote target’s MAC. It bridges the network/link addressing boundary and is often classified at the link layer; calling ARP simply a network protocol uses a loose textbook convention. RARP reverses hardware-to-IP lookup; BOOTP/DHCP support boot configuration. ICMP reports errors and diagnostics; IGMP manages IPv4 multicast membership. These are separate companion protocols, not four pieces whose combination is IP.
16 related practice questions
Blueprint: LO2 · Note references: NET-M, NET-N, NET-R826
- DNS and DHCP
NET21
Web, file, mail and remote-login protocols
[Exam Focus]- Application service protocols
- HTTP: stateless request/response semantics
- HTTP message body optional
- HTTPS: HTTP with TLS
- FTP: separate control/data connections
- FTP ≠ SFTP
- SMTP: mail submission and relay
- POP3: retrieval
- IMAP: server-mailbox access/synchronization
- SMTP ≠ end-user mailbox retrieval
👁 Full explanation
HTTP defines web request/response semantics; it is stateless, and a message body may be absent. HTTPS adds TLS protection. FTP transfers files using control and separate data connections; it is not the same protocol as SFTP. SMTP submits and relays mail; POP3 retrieves messages and IMAP accesses/synchronizes server mailboxes. Saying SMTP handles both sending and end-user mailbox retrieval is inaccurate. - Usual ports and remote access
- FTP control 21; SSH 22
- Telnet 23; SMTP relay 25
- DNS 53; HTTP 80
- POP3 110; IMAP 143; HTTPS 443
- Telnet: unencrypted terminal
- SSH: protected remote access
- Configured ports may differ
- HTTP exchange ≠ physical duplex mode
👁 Full explanation
Usual service ports: FTP control 21, SSH 22, Telnet 23, SMTP relay 25, DNS 53, HTTP 80, POP3 110, IMAP 143, HTTPS 443. Telnet provides unencrypted remote terminals; SSH protects remote access. Servers can be configured on other ports. A browser’s HTTP exchange does not determine the physical duplex mode of its network interface.
13 related practice questions
Blueprint: LO2 · Note references: NET-M, NET-N
- Application service protocols
NET22
IPv4 notation and classful defaults
- IPv4 representation
- Four decimal octets, each 0–255
- 32 binary bits
- Octet weights: 128,64,32,16,8,4,2,1
- 11000001 10000011 00011011 11111111 → 193.131.27.255
- 257 invalid
- Syntax validity ≠ host assignability
- .0/.255 host validity depends on prefix
👁 Full explanation
Write IPv4 as four decimal octets 0–255, or as 32 binary bits. Use weights 128,64,32,16,8,4,2,1 within each octet. Thus 11000001 10000011 00011011 11111111 is 193.131.27.255. A value such as 257 is impossible. Syntactic validity differs from assignability: an address ending .0 or .255 can be a host under some prefixes. - Historical classful defaults
- A: leading 0, /8
- B: leading 10, /16
- C: leading 110, /24
- D: 1110 multicast; E: 1111 reserved
- Ordinary A: 1–126; 0/127 special
- B: 128–191; C: 192–223
- Usable: 2^24−2; 2^16−2; 254
- Modern CIDR actual prefix overrides classes
👁 Full explanation
Historical classes use leading patterns: A 0 with /8, B 10 with /16, C 110 with /24; D 1110 is multicast and E 1111 reserved. Ordinary class-A first octets are 1–126 because 0 and 127 have special uses. B spans 128–191 and C 192–223. Default usable counts are 2^24-2, 2^16-2 and 254. Modern CIDR requires the actual prefix and overrides class defaults.
18 related practice questions
Note references: NET-M, NET-N
- IPv4 representation
NET23
Special ranges, private addresses and IPv6
- Private and special IPv4 ranges
- RFC1918: 10.0.0.0/8
- 172.16.0.0/12 through 172.31.255.255
- 192.168.0.0/16
- Reusable internally; no global public routing
- LAN public addressing permitted with allocation
- 127.0.0.0/8 loopback; commonly 127.0.0.1
- Loopback works without external link
- 255.255.255.255: limited broadcast
- 0.0.0.0: possible unconfigured source
- Link-local/APIPA: 169.254.0.0/16
- Automatic selection excludes edge /24 blocks
👁 Full explanation
RFC1918 private blocks are 10.0.0.0/8, 172.16.0.0/12 (through 172.31.255.255), and 192.168.0.0/16. They can be reused internally but are not globally routed as public destinations. A LAN may also use legitimately assigned public addresses; private is common, not mandatory. 127.0.0.0/8 is IPv4 loopback, commonly 127.0.0.1, for local protocol access without an external link. 255.255.255.255 is limited broadcast; 0.0.0.0 can identify an unconfigured source. Link-local/APIPA uses 169.254.0.0/16, with edge /24 blocks excluded from normal automatic selection. - IPv6 contrasts
- 128-bit hexadecimal addresses; flexible prefixes
- No IPv4-style broadcast
- Fragmentation: sources only, never routers
- No automatic traffic encryption
- Authentication remains necessary
- Address space, bit length, encryption-support options
- Specific comparison needed for unique answer
👁 Full explanation
IPv6 has 128-bit hexadecimal addresses, flexible prefixes and no IPv4-style broadcast. Sources, not routers, fragment IPv6 packets. IPv6 does not automatically encrypt traffic or make authentication unnecessary. Compare IPv6’s larger 128-bit address space and encryption support separately; specify the property being evaluated.
11 related practice questions
Note references: NET-M, NET-N, NET-R1918, NET-R8200
- Private and special IPv4 ranges
NET24
Masks, prefixes and binary AND
[Exam Focus]- Prefix masks
- /p: p ones, then 32−p zeros
- Partial octets: 128,192,224,240,248,252,254
- /19=255.255.224.0
- /20=255.255.240.0
- /21=255.255.248.0
- 255.248.0.0 ≠ /21
👁 Full explanation
A /p IPv4 prefix has p leading one bits followed by 32-p zeros. Partial octet masks are 128,192,224,240,248,252,254. /19 is 255.255.224.0; /20 is 255.255.240.0; /21 is 255.255.248.0, correcting the study guide’s 255.248.0.0 mistake. - Network by binary AND
- Network=address AND mask
- Host zeros: block start
- Host ones: broadcast
- 172.16.28.252/20: third-octet increment 16
- Network=172.16.16.0; broadcast=172.16.31.255
- Written host/prefix need not be aligned
- 172.105.180.0/21 → 172.105.176.0/21
👁 Full explanation
Compute network=address AND mask. Host bits zero identify the block start; host bits one give broadcast. With 172.16.28.252/20, the third octet is grouped in blocks of 16, so the network is 172.16.16.0 and broadcast 172.16.31.255. A written host/prefix such as 172.105.180.0/21 need not be an aligned block label: masking yields 172.105.176.0/21.
2 related practice questions
Blueprint: LO4 · Note references: NET-M, NET-N
- Prefix masks
NET25
Find subnet bounds and usable hosts
[Exam Focus]- Subnet bounds and capacity
- Ordinary broadcast LAN: h=32−p
- Total=2^h; usable=2^h−2
- Reserve network and directed broadcast
- Changing-octet increment=256−mask octet
- Round down to increment multiple
- Last address=next boundary−1
👁 Full explanation
For ordinary broadcast LANs let h=32-p. Total addresses=2^h; usable hosts=2^h-2, reserving network and directed broadcast. Find the changing octet’s increment as 256-mask octet, round the address down to a multiple, and extend through the next boundary minus one. - Subnet boundary examples
- 192.168.2.64/26: .64–.127
- Usable .65–.126: 62 hosts
- 192.168.10.25/28 → .16–.31
- 172.17.128.0/21 → 172.17.135.255
- .128.255 and .135.0: valid interior hosts
- .135.255: broadcast
- /27: 32 total, 30 usable
👁 Full explanation
192.168.2.64/26 spans .64–.127; usable .65–.126 gives 62 hosts. 192.168.10.25/28 spans .16–.31, so its network is .16. 172.17.128.0/21 spans 172.17.128.0–172.17.135.255; .128.255 and .135.0 are valid interior hosts, but .135.255 is broadcast. /27 gives 32 total and 30 usable, not 32 usable.
16 related practice questions
Blueprint: LO4 · Note references: NET-M, NET-N
- Subnet bounds and capacity
NET26
Borrow bits and choose a mask
[Exam Focus]- Equal subnet borrowing
- Parent /a → child /p
- Borrowed bits b=p−a
- Subnets=2^b, no modern subtract-two
- Class B /16 → /19
- b=3 → eight subnets
- 8192 addresses; 8190 conventional hosts
- /19 alone does not identify parent
👁 Full explanation
To split parent /a into equal /p blocks, borrow b=p-a bits and obtain 2^b subnets. Do not subtract two subnets under modern practice. For a Class B /16 parent split to /19, b=3 gives eight subnets, each with 8192 addresses and 8190 conventional hosts. A /19 alone does not state its parent. - Choose mask from demands
- Smallest h satisfying 2^h−2≥H
- p=32−h
- 24 hosts → /27
- 52 or 57 → /26
- 100 → /25; 500 → /23
- At least six subnets → b=3
- /24 → /27: eight subnets
- Check subnet count and host capacity
👁 Full explanation
For H hosts, choose the smallest h satisfying 2^h-2≥H, then p=32-h. For 24 hosts use /27; 52 or 57 use /26; 100 use /25; 500 use /23. For at least six equal subnets choose b=3. A Class C /24 split to /27 yields eight subnets. Always check both the number of subnets and the host capacity.
9 related practice questions
Blueprint: LO4 · Note references: NET-M, NET-N
- Equal subnet borrowing
NET27
Design and implement a VLSM address plan
[Exam Focus]- VLSM allocation method
- Different masks for LAN sizes
- Sort largest demands first
- Round reservations into power-of-two blocks
- Aligned, nonoverlapping allocations within parent
- Explicit remaining free space
👁 Full explanation
VLSM assigns different masks to different LAN sizes. Sort demands largest first, round each to a power-of-two address block including reservations, allocate aligned nonoverlapping blocks within the parent, and leave the remaining space explicit. - VLSM worked plan
- /24 demands: 100,60,29
- .0/25: hosts .1–.126
- .128/26: hosts .129–.190
- .192/27: hosts .193–.222
- Remaining .224/27
- Two 100-host LANs: separate /24
- .0/25 plus .128/25
- Count router interfaces unless already included
👁 Full explanation
For a /24 with LAN demands 100,60,29: allocate .0/25 (hosts .1–.126), .128/26 (.129–.190), and .192/27 (.193–.222); .224/27 remains. Two remote LANs of 100 each fit .0/25 and .128/25 within a separate /24. Count router interfaces as hosts if not already included in the demand. - Address-plan implementation
- Unique usable IPs and masks
- Default gateway inside local subnet
- Router interfaces and routes
- DHCP exclusions
- Test local→gateway→remote→DNS separately
- Check duplicate addresses and overlap
- Verify return routes before application blame
👁 Full explanation
Implementation assigns unique usable IPs/masks, puts each default gateway in its local subnet, configures router interfaces/routes and DHCP exclusions, then tests local reachability, gateway reachability, remote routing and DNS separately. Check duplicate addresses, overlap and return routes before blaming an application.
2 related practice questions
Blueprint: LO4 · Note references: NET-M, NET-N
- VLSM allocation method
NET28
Point-to-point links and route aggregation
- Point-to-point prefix exceptions
- Conventional /30: four addresses, two endpoints
- Often smallest offered WAN choice
- RFC3021 /31: supported point-to-point links
- Both /31 addresses usable
- Subtract-two rule inapplicable to /31
- /32: single address or host route
- /30 not universally smallest link prefix
👁 Full explanation
A conventional /30 has four addresses and two usable endpoints; check the link and addressing assumptions when selecting a WAN prefix. RFC3021 permits /31 on supported point-to-point links: both addresses are endpoints, so the subtract-two rule does not apply. /32 identifies one address/host route. Do not claim /30 is universally the smallest valid link prefix. - CIDR aggregation
- Classless Inter-Domain Routing
- Replaces rigid class allocation
- Aggregate contiguous aligned common-prefix blocks
- Adjacent-looking labels may not aggregate
- Four consecutive /26 blocks → /24
- Preserve more-specific routes for correct next-hops
👁 Full explanation
CIDR, Classless Inter-Domain Routing, replaces rigid class allocation and supports aggregation. Combine contiguous aligned blocks sharing leading bits; unrelated adjacent-looking labels may not aggregate cleanly. Four consecutive /26 blocks covering a /24 summarize to /24. More-specific routes must remain available where the aggregate would otherwise send traffic to the wrong next hop.
3 related practice questions
Note references: NET-M, NET-N, NET-R3021, NET-R4632
- Point-to-point prefix exceptions
NET29
NAT and port translation
- NAT variants
- Static NAT: fixed address mapping
- Dynamic NAT: mapping pool
- PAT/NAPT: address-plus-port mapping
- Multiple private clients share public address
- Translation ≠ ARP or encryption
- Return traffic requires translation state
- Configured inbound mapping alternative
👁 Full explanation
Static NAT gives a fixed address mapping; dynamic NAT allocates mappings from a pool. PAT/NAPT maps address-plus-port combinations so multiple private clients share a public address. It is translation, not ARP resolution and not encryption. Return traffic must match the translation state or a configured inbound mapping. - Public Internet prerequisites
- 10.0.0.1 commonly uses gateway NAT
- Valid routing and public external address
- NAT supplies neither physical connectivity nor DNS
- Public address ≠ permission to use
- LAN: correctly allocated public/private unicast
- Subnet correctness remains necessary
👁 Full explanation
A private host such as 10.0.0.1 commonly reaches the public Internet through NAT at a gateway, together with valid routing and a public external address. NAT alone does not supply a physical connection or DNS. A public address does not automatically grant permission to use it; both public and private unicast addresses can be used on a LAN under the correct allocation and subnet.
3 related practice questions
Note references: NET-M, NET-N
- NAT variants
NET30
Routing algorithms and destination sets
- Routing versus forwarding
- Routing computes paths
- Forwarding selects packet next hop
- Longest matching prefix first
- Then routing-system tie breakers
- Default /0: no more-specific match
- Static: configured; dynamic: reachability exchange
- Distance vector: neighbor estimates
- Link state: distributed links, shortest paths
- Interior protocols: within autonomous system
- BGP: between autonomous systems
👁 Full explanation
Routing computes paths; forwarding chooses a next hop for an individual packet. Select the matching route with the longest prefix, then apply the routing system’s tie-breaking criteria. A default /0 matches when nothing more specific does. Static routes are configured; dynamic protocols exchange reachability. Distance vector uses neighbor estimates, while link state distributes link information and computes shortest paths. Interior protocols operate within an autonomous system; BGP exchanges routes between systems. - Destination sets and distribution
- Flooding: eligible-link copies, duplicate/lifetime controls
- Random walk: probabilistic neighbor
- Unicast: one; broadcast: all within scope
- Multicast: subscribed group
- Anycast: one shared-address member
- Anycast nearest by routing metric
- Multi-destination target list ≠ necessarily broadcast
- Multicast trees: reverse-path checks
- Ethernet spanning tree: separate layer-2 mechanism
👁 Full explanation
Flooding sends copies on eligible outgoing links with duplicate/lifetime controls; random walk picks a neighbor probabilistically. Unicast targets one destination, broadcast all in a scope, multicast a subscribed group and anycast one member sharing an address, normally nearest under routing metrics. Multi-destination packets can list multiple targets; this is not necessarily identical to broadcast. Group multicast trees use mechanisms such as reverse-path checks; Ethernet spanning tree is a different layer-2 mechanism.
5 related practice questions
Note references: NET-M, NET-N
- Routing versus forwarding
NET31
Circuit, message and packet switching
- Circuit versus packet switching
- Circuit: setup → reserved transfer → release
- Predictable allocated bandwidth
- Setup/blocking and idle reservation costs
- Traditional telephone call
- Packets statistically share links
- Queueing: variable delay and loss
- Voice-over-packet remains possible
- Buffering; scheduling; capacity planning
👁 Full explanation
Circuit switching sets up a path with reserved resources, transfers data, then releases it. Predictable allocated bandwidth trades against setup/blocking and wasted reservation during silence. A traditional telephone call is the standard example. Packet switching divides data into packets that share links statistically; queueing can add variable delay and loss. This does not make modern voice-over-packet impossible: buffering, scheduling and capacity planning manage it. - Forwarding and switching variants
- Datagrams forwarded independently
- Virtual circuit establishes forwarding state
- Virtual-circuit reservation optional
- Message switching stores complete message
- No dedicated end-to-end message path
- Store-and-forward waits for full packet/frame
- Cut-through starts after sufficient header
- Fragment-free waits collision-sensitive initial portion
- Routing ≠ guaranteed geometrically shortest path
👁 Full explanation
Datagram packets are forwarded independently. Virtual circuits establish forwarding state, but resource reservation is optional, not a necessary property of every virtual circuit. Message switching stores a complete message before forwarding, without a dedicated end-to-end path. Packet store-and-forward waits for the full packet/frame; cut-through starts after enough header arrives; fragment-free historically waits through the initial collision-sensitive portion. No routing algorithm guarantees that every packet always takes the geometrically shortest route.
12 related practice questions
Note references: NET-M, NET-N
- Circuit versus packet switching
NET32
Multiplexing and channelization
- Multiplexing and demultiplexing
- Multiple streams share one link
- Receiver separates streams
- Multiplexing ≠ broadcasting
- FDM: frequency bands, guard spacing
- WDM: optical wavelengths
- TDM: time slots
- Synchronous TDM: recurrent slots, including idle
- Statistical TDM: demand allocation, identification
👁 Full explanation
Multiplexing combines multiple input streams onto a shared link; demultiplexing separates them at the receiver. It differs from broadcasting one message to many destinations. FDM assigns distinct frequency bands with suitable guard spacing; WDM assigns different optical wavelengths. TDM allocates time slots: synchronous TDM reserves recurrent slots even if an input is idle, while statistical TDM allocates according to demand and needs identification. - Channelization versus port multiplexing
- FDMA: user frequency allocation
- TDMA: user time allocation
- CDMA: coded-signal separation
- Physical multiplexing ≠ transport port multiplexing
- Combining-signals question: multiplexing
- Missing correct option remains missing
👁 Full explanation
FDMA and TDMA allocate frequencies or time among users; CDMA separates coded signals. Physical multiplexing is different from transport port multiplexing. Combining signals onto a shared link is multiplexing; distinguish it from point-to-point connectivity, broadcast, synchronization and multicast.
3 related practice questions
Note references: NET-M, NET-N
- Multiplexing and demultiplexing
NET33
Identify networking layers and addressing assumptions
- Ambiguous networking stems
- Identify exact layer, protocol, scope
- Link and transport: flow/error control
- Locally administered MAC addresses
- Bridges and switches: both layer 2
- LAN: public or private unicast
- UDP and IP: both connectionless
- Session dialog ≠ TCP connection
- Overlaps need narrower stem/multiple selections
👁 Full explanation
First identify the exact layer, protocol and scope. Flow/error control can exist at both link and transport layers; MAC addresses can be locally administered; bridges and switches both operate at layer 2. A LAN can use public or private unicast space. UDP and IP are both connectionless. Session dialogs and TCP connections are distinct senses of connection. Distinguish the protocol, layer and scope before treating these descriptions as exclusive. - Damaged addressing and option questions
- Host without prefix: capacity indeterminate
- Explicit classful assumption permits default
- Subnet count requires parent block
- Obsolete zero/all-ones subnet exclusions: explicit only
- Missing concept ≠ duplicated distractor answer
- Restore OCR-damaged original options
👁 Full explanation
A host address without a prefix does not determine capacity unless the question explicitly assumes historical classful addressing. A subnet count needs a parent block. Excluding subnet zero and the all-ones subnet is an obsolete convention; apply it only when explicitly stated. Choose a networking concept by its definition rather than by repeated distractors. Read complete, unambiguous option labels before matching them to networking concepts.
35 related practice questions
Note references: NET-M, NET-N
- Ambiguous networking stems
No matching topics. Clear the search or change the filter.
Blueprint learning outcomes
- LO1 · Understand the concepts and principles of data communications and computer networks
NET01, NET04, NET05, NET06, NET07, NET08, NET13, NET14 - LO2 · Understand Protocols and various networking components
NET03, NET07, NET09, NET10, NET11, NET13, NET14, NET20, NET21 - LO3 · Understand TCP/IP & OSI Reference Model
NET03, NET12, NET16, NET17, NET18, NET19 - LO4 · Design and implement IP addressing and subnets
NET24, NET25, NET26, NET27