Problem 1
An enterprise network architect is assigned the private IPv4 network address block $192.168.0.0/16$ and must divide it into subnets using Classless Inter-Domain Routing (CIDR). Each subnet must accommodate at least 500 usable host IP addresses. To minimize wasted IP address space, what subnet mask must be configured, how many usable host addresses does each subnet support, and what is the broadcast address for Subnet 4 (the fifth subnet, assuming zero-based indexing starting at 192.168.0.0)?
- A255.255.252.0 (yielding 1022 usable hosts per subnet, Subnet 4 broadcast: 192.168.15.255)
- B255.255.255.0 (yielding 254 usable hosts per subnet, Subnet 4 broadcast: 192.168.4.255)
- C255.255.254.0 (yielding 510 usable hosts per subnet, Subnet 4 broadcast: 192.168.9.255)correct
- D255.255.248.0 (yielding 2046 usable hosts per subnet, Subnet 4 broadcast: 192.168.31.255)
Show the solution
**Step 1: Determine Required Number of Host Bits (h)** From the FE Reference Handbook (Computer Networks / IPv4 Addressing): The number of usable host IP addresses for $h$ host bits is: $$N_{hosts} = 2^h - 2$$ We require $N_{hosts} \ge 500$: $$2^h - 2 \ge 500 \implies 2^h \ge 502$$ Since $2^8 = 256 < 502$ and $2^9 = 512 \ge 502$, we must allocate: $$h = 9\text{ host bits}$$ Usable hosts per subnet: $$N_{hosts} = 2^9 - 2 = 512 - 2 = 510\text{ usable host IPs}$$ **Step 2: Determine CIDR Prefix and Subnet Mask** An IPv4 address has 32 bits: $$\text{Network Prefix} = 32 - h = 32 - 9 = /23$$ Subnet mask in dotted-decimal notation: - 1st octet: 8 ones $= 255$ - 2nd octet: 8 ones $= 255$ - 3rd octet: 7 ones, 1 zero $= 11111110_2 = 254$ - 4th octet: 8 zeros $= 0$ Subnet mask: **255.255.254.0** **Step 3: Determine Subnet Boundaries and Subnet 4 Broadcast Address** Each $/23$ subnet spans $2^9 = 512$ addresses, which increments the 3rd octet by 2: - Subnet 0: 192.168.0.0 to 192.168.1.255 (Broadcast: 192.168.1.255) - Subnet 1: 192.168.2.0 to 192.168.3.255 (Broadcast: 192.168.3.255) - Subnet 2: 192.168.4.0 to 192.168.5.255 (Broadcast: 192.168.5.255) - Subnet 3: 192.168.6.0 to 192.168.7.255 (Broadcast: 192.168.7.255) - Subnet 4: 192.168.8.0 to 192.168.9.255 (Broadcast: **192.168.9.255**) Conclusion: The mask is **255.255.254.0**, providing **510 hosts**, with Subnet 4 broadcast **192.168.9.255**. Distractor Analysis: - Option A: yielding 1022 usable hosts per subnet, Subnet 4 broadcast: 192.168.15.255 - Option B: yielding 254 usable hosts per subnet, Subnet 4 broadcast: 192.168.4.255 - Option C: yielding 510 usable hosts per subnet, Subnet 4 broadcast: 192.168.9.255 (Correct) - Option D: yielding 2046 usable hosts per subnet, Subnet 4 broadcast: 192.168.31.255
Problem 2
Regarding network protocol stacks, OSI layering, and transmission protocols, which TWO of the following statements are correct?
- AThe Address Resolution Protocol (ARP) dynamically resolves a known 32-bit logical IPv4 address to a 48-bit physical MAC address on a local Ethernet broadcast domain.
- BTCP provides connectionless, best-effort datagram delivery with zero handshake overhead and no retransmission of dropped packets.
- CTCP establishes reliable, full-duplex stream communication between endpoints via a three-way handshake (SYN, SYN-ACK, ACK) and manages sliding window flow control.
- DRouters operate strictly at OSI Layer 2 (Data Link Layer) and make packet forwarding decisions exclusively by inspecting MAC hardware addresses.
Show the solution
**Step 1: Evaluate Address Resolution Protocol (Option A)** From the FE Reference Handbook (Computer Networks / Layer 2-3 Interworking): ARP operates between the Network (IP) and Data Link (MAC) layers. When a host needs to transmit a packet to a local IP address, it broadcasts an ARP request to learn the target's physical MAC address. Therefore, Option A is **CORRECT**. **Step 2: Evaluate TCP 3-Way Handshake and Flow Control (Option C)** TCP is a connection-oriented Transport Layer protocol that initiates sessions with a 3-way handshake (SYN, SYN-ACK, ACK) to synchronize sequence numbers and receive window buffers, ensuring reliable in-order delivery. Therefore, Option C is **CORRECT**. **Step 3: Evaluate Distractors** - Option B is incorrect: Connectionless, best-effort delivery without handshake or retransmissions describes UDP (User Datagram Protocol), not TCP. - Option D is incorrect: Routers operate at OSI Layer 3 (Network Layer) and forward packets based on logical IP addresses; Ethernet switches operate at Layer 2. Conclusion: Correct options are **A and C**.
Problem 3
In a packet-switched computer network running an OSPF Link-State Routing protocol, 5 routers $\{A, B, C, D, E\}$ are interconnected with bidirectional link costs: - $A-B: 3$, $A-C: 5$ - $B-C: 1$, $B-D: 7$ - $C-D: 2$, $C-E: 6$ - $D-E: 2$ Using Dijkstra's Shortest Path Algorithm with router $A$ as the source: What is the minimum cumulative path cost to reach destination router $E$, and what is the optimal path sequence?
- A11 (via path A -> C -> E)
- B10 (via path A -> B -> D -> E)
- C9 (via path A -> C -> D -> E)
- D8 (via path A -> B -> C -> D -> E)correct
Show the solution
**Step 1: Dijkstra's Algorithm Initialization** From the FE Reference Handbook (Computer Networks / Network Layer / Routing Algorithms / Dijkstra): Let $d(v)$ be the shortest known distance from source $A$ to node $v$, and $S$ be the set of visited nodes: - Initially: $S = \{A\}$ - $d(A) = 0$ - $d(B) = 3$ (pred: $A$) - $d(C) = 5$ (pred: $A$) - $d(D) = \infty$ - $d(E) = \infty$ **Step 2: Iteration 1** Minimum unvisited node is $B$ ($d(B) = 3$). Add $B$ to $S = \{A, B\}$. Update neighbors of $B$: - $d(C) = \min(5, d(B) + c(B,C)) = \min(5, 3 + 1) = 4$ (update pred: $B$) - $d(D) = \min(\infty, d(B) + c(B,D)) = \min(\infty, 3 + 7) = 10$ (pred: $B$) **Step 3: Iteration 2** Minimum unvisited node is $C$ ($d(C) = 4$). Add $C$ to $S = \{A, B, C\}$. Update neighbors of $C$: - $d(D) = \min(10, d(C) + c(C,D)) = \min(10, 4 + 2) = 6$ (update pred: $C$) - $d(E) = \min(\infty, d(C) + c(C,E)) = \min(\infty, 4 + 6) = 10$ (pred: $C$) **Step 4: Iteration 3** Minimum unvisited node is $D$ ($d(D) = 6$). Add $D$ to $S = \{A, B, C, D\}$. Update neighbors of $D$: - $d(E) = \min(10, d(D) + c(D,E)) = \min(10, 6 + 2) = 8$ (update pred: $D$) **Step 5: Iteration 4** Only node $E$ remains ($d(E) = 8$). Add $E$ to $S$. Backtracking predecessors: $E \leftarrow D \leftarrow C \leftarrow B \leftarrow A$. Path: $A \to B \to C \to D \to E$ with total cost $3 + 1 + 2 + 2 = 8$. Conclusion: The minimum path cost is **8** via **$A \to B \to C \to D \to E$**. Distractor Analysis: - Option A: via path A -> C -> E - Option B: via path A -> B -> D -> E - Option C: via path A -> C -> D -> E - Option D: via path A -> B -> C -> D -> E (Correct)