The Internet
How computing devices form networks, how the Internet routes packets using open protocols like IP, TCP, UDP, and HTTP, and how the World Wide Web differs from the Internet itself.
AP Computer Science Principles Unit 4 Review: Computer Systems & Networks
- 11–15% of AP multiple choice
- 3 topics
- AP exam review verified for 2027
The Internet is a network of interconnected networks that routes data as packets using open protocols like IP, TCP, and HTTP. Redundancy through multiple paths makes it fault-tolerant. Parallel computing splits a program across simultaneous operations; distributed computing splits it across multiple devices. Both improve speed, but efficiency is always limited by the remaining sequential portion.
Fiveable's AP Computer Science Principles Unit 4 review covers 4 topics, with guided practice questions for the unit.
AP Computer Science Principles unit 4 topics
Fault Tolerance
How redundancy, especially multiple paths between devices, makes the Internet fault-tolerant, and how to identify single points of failure in a network diagram.
Parallel and Distributed Computing
How sequential, parallel, and distributed computing models compare, how to calculate execution time and speedup, and why the sequential portion of a program limits efficiency gains.
Big Idea 4 Overview: Computer Systems and Networks
AP Computer Science Principles Big Idea 4 review: the Internet, fault tolerance, and parallel computing. 11-15% of the exam, key vocab, and practice links.
Practice AP Computer Science Principles unit 4 questions
Try AP-style questions on unit 4, then use the review notes below for anything you miss.
AP Computer Science Principles unit 4 practice test
A timed, AP-style test built only from unit 4 questions — multiple choice plus free response, scored with AI feedback. Use the standard format or build your own.
Unit 4 review notes
4.1
Networks, Protocols, and Packets
The Internet is a computer network made of interconnected networks that communicate using open, standardized protocols. Any computing device, including computers, tablets, servers, routers, and smart sensors, can connect as long as it can run a program and reach an Internet-connected device. Data is broken into packets that each carry a data chunk and metadata. Packets travel from sender to receiver along dynamically chosen routes and are reassembled at the destination. The Internet is distinct from the World Wide Web: the Web is a system of linked pages and files that runs on top of the Internet using HTTP.
- Protocol: An agreed-upon set of rules that specify how devices communicate. Internet protocols are open and nonproprietary, which is why any device can join.
- Packet: A chunk of data plus metadata (addressing and sequencing information) used to route and reassemble the full message at the destination.
- Routing: The process of finding a path from sender to receiver. On the Internet, routing is dynamic, meaning the path is not fixed in advance.
- Bandwidth: The maximum amount of data a network can transmit in a fixed amount of time, measured in bits per second.
- World Wide Web vs. Internet: The Internet is the underlying network infrastructure. The Web is a service that runs on it, using HTTP to link pages, programs, and files.
Can you explain why packets from the same message might arrive out of order, and which protocols (IP, TCP, UDP, HTTP) handle which jobs?
| Protocol | Layer / Purpose | Key characteristic |
|---|---|---|
| IP | Addressing and routing packets | Identifies sender and receiver addresses |
| TCP | Reliable data delivery | Ensures ordered, complete packet delivery |
| UDP | Fast, lightweight delivery | No guaranteed order or delivery; lower overhead |
| HTTP | Web communication | Protocol the World Wide Web uses; runs over the Internet |
4.2
Redundancy and Fault Tolerance
The Internet is engineered to be fault-tolerant: it can keep functioning even when individual devices or connections fail. The main mechanism is redundancy, which means including extra components or paths so that if one fails, others take over. Network redundancy specifically means having more than one path between connected devices. When a link or device goes down, routing automatically directs subsequent packets along a different route. A system with only one path between two points is vulnerable because that single connection is a point of failure. Adding redundancy costs more resources but increases reliability.
- Fault tolerance: The ability of a system to continue functioning when one or more of its components fail.
- Redundancy: Extra components or paths included so the system can keep working if primary components fail.
- Network redundancy: Having more than one path between connected devices so data can reroute around a failed link.
- Single point of failure: A component with no backup; if it fails, the entire system or connection goes down.
- Trade-off: Redundancy improves reliability but requires additional resources such as extra cables, routers, or bandwidth.
Given a network diagram, can you identify which connections are redundant and which device or link removal would cause a complete failure?
| Scenario | Fault-tolerant? | Reason |
|---|---|---|
| Two paths exist between A and B | Yes | If one path fails, data reroutes through the other |
| Only one path exists between A and B | No | Failure of that path cuts off all communication |
| Extra router added as backup | Yes | Redundant component takes over if primary fails |
4.3
Sequential, Parallel, and Distributed Computing
Sequential computing runs operations one at a time; total time is the sum of every step. Parallel computing breaks a program into smaller operations and runs some simultaneously on multiple processors; total time equals the sequential portion plus the longest parallel task. Distributed computing uses multiple separate devices to run a program, enabling problems too large or slow for one machine. Speedup is calculated as sequential time divided by parallel time. Efficiency gains from parallelism are always limited by the portion of the program that must remain sequential, a constraint described by Amdahl's Law. At some point, adding more parallel processors yields no meaningful improvement.
- Sequential computing: Operations run one at a time; total time = sum of all steps.
- Parallel computing: Some operations run simultaneously; total time = sequential portion + longest parallel task.
- Distributed computing: Multiple devices each run part of a program, allowing problems too large or slow for one machine to be solved.
- Speedup: Sequential time divided by parallel time; measures how much faster the parallel solution is.
- Amdahl's Law: Efficiency gains from parallelism are limited by the sequential fraction of the program; adding more parallel processors eventually stops helping.
If a task has 4 steps that can run in parallel (each taking 2 seconds) and 1 sequential step taking 3 seconds, what is the total parallel execution time and the speedup compared to running all 5 steps sequentially?
| Model | How it works | Total time formula | Key benefit |
|---|---|---|---|
| Sequential | One operation at a time | Sum of all steps | Simple, predictable |
| Parallel | Some steps run simultaneously on one system | Sequential portion + longest parallel task | Faster for divisible problems |
| Distributed | Multiple devices each handle part of the program | Depends on coordination and longest task | Handles problems too large for one machine |
Key terms
| Term | Definition |
|---|---|
| Computer network | A group of interconnected computing devices capable of sending or receiving data. The Internet is a computer network made of many interconnected networks. |
| Routing | The process of finding a path from sender to receiver across a network. On the Internet, routing is dynamic and not fixed in advance. |
| Bandwidth | The maximum amount of data that can be transmitted over a network connection in a fixed amount of time, measured in bits per second. |
| TCP | Transmission Control Protocol; ensures reliable, ordered delivery of data packets across the Internet. |
| HTTP | HyperText Transfer Protocol; the protocol used by the World Wide Web to transmit data between clients and servers. |
| World Wide Web | A system of linked pages, programs, and files that uses HTTP and runs on top of the Internet. It is not the same as the Internet. |
| Redundancy | The inclusion of extra components or paths so a system can keep functioning if primary components fail. |
| network redundancy | Having more than one path between connected devices so data can reroute around a failed link or device. |
| Scalability | The capacity of a system to change in size and scale to meet new demands. The Internet was designed to be scalable so new devices can join easily. |
| Sequential Computing | A model where operations run one at a time in order; total execution time equals the sum of all steps. |
| Amdahl's Law | The principle that efficiency gains from parallel computing are limited by the sequential portion of a program; adding more parallel processors eventually yields diminishing returns. |
| Sender | The device that initiates and transmits data across a network toward a receiver. |
| Receiver | The device that receives and reassembles data transmitted by a sender. |
| Computing devices | Physical artifacts that can run a program, including computers, tablets, servers, routers, and smart sensors. |
How to review unit 4
Topics students miss most
Miss rates come from Fiveable multiple-choice practice.
Common unit 4 mistakes
Confusing the Internet with the World Wide Web
The Internet is the physical and logical network infrastructure. The World Wide Web is one service that runs on it. HTTP is a Web protocol, not the Internet itself. Exam questions often test whether you can keep these separate.
Thinking parallel time equals the sum of all parallel tasks
Parallel execution time is the sequential portion plus the longest single parallel task, not the sum of all parallel tasks. If four tasks each take 2 seconds and run simultaneously, they contribute 2 seconds total, not 8.
Assuming more parallel processors always means faster results
Amdahl's Law says the sequential fraction of a program is a hard ceiling on speedup. Once the parallel portion is fully optimized, adding more processors does nothing for the sequential steps.
Treating any network with multiple devices as fault-tolerant
A network is only fault-tolerant if there are multiple paths between devices. A chain of devices with only one path between each pair has single points of failure even though it has many devices.
Mixing up TCP and UDP trade-offs
TCP guarantees ordered, complete delivery but has more overhead. UDP is faster with less overhead but does not guarantee delivery or order. Choosing between them depends on whether reliability or speed matters more for the application.
How this unit shows up on the AP exam
Network diagram analysis
Multiple-choice questions often present a diagram of connected devices and ask you to identify whether the network is fault-tolerant, locate a single point of failure, or trace a valid path from sender to receiver after a link is removed. Practice reading these diagrams and applying the definitions of redundancy and fault tolerance directly to the visual.
Execution time and speedup calculations
Questions give a task broken into sequential and parallel steps with time values and ask you to calculate total parallel execution time or speedup. Know the formulas cold: parallel time = sequential portion + longest parallel task; speedup = sequential time / parallel time. Questions also ask you to reason about why adding more processors stops improving performance.
Protocol and packet reasoning
Questions ask you to match protocols (IP, TCP, UDP, HTTP) to their functions, explain what packet metadata is used for, or distinguish the Internet from the World Wide Web. A common task is reading a scenario about data transmission and identifying which protocol property (reliability, speed, addressing) applies.
More ways to review
Topic study guides
Open the individual guides for Unit 4 when you want a closer review of one topic.
Practice questions
Use AP-style practice after you review the notes so you can check what you understand.
FRQ practice
Practice free-response reasoning and compare your answer with scoring guidance.
Cram archive videos
Watch past review streams filtered to Unit 4 when you want a video walkthrough.
Official unit cheatsheet
Open the Fiveable one-page unit review, then explore visual cheatsheets for a quick refresher.
Score calculator
Estimate your broader AP score goal after you review the course and exam format.
Unit 4 printables
Print the unit cheatsheets ($3) for Unit 4. Yours to keep, no subscription needed.
get printablesFrequently Asked Questions
What's on the AP CSP Unit 4 progress check (MCQ and FRQ)?
The AP CSP Unit 4 progress check on AP Classroom includes both MCQ and FRQ parts drawn from all three unit topics: The Internet, Fault Tolerance, and Parallel and Distributed Computing. MCQ questions test how packets route and how networks handle failure. FRQ questions ask you to explain or analyze computing scenarios from those same topics. For matched practice, visit AP CSP Unit 4.
How do I practice AP CSP Unit 4 FRQs?
AP CSP Unit 4 FRQs most often draw from 4.1 The Internet and 4.3 Parallel and Distributed Computing, asking you to explain how data moves through a network, describe fault-tolerant design, or compare sequential vs. parallel processing. Practice by writing out full explanations in your own words, then checking that you named specific concepts like packets, routing, and parallel speedup. Find practice prompts at AP CSP Unit 4.
Where can I find AP CSP Unit 4 practice questions?
For AP CSP Unit 4 practice questions, including multiple-choice and practice test sets, head to AP CSP Unit 4. You'll find MCQ questions covering The Internet, Fault Tolerance, and Parallel and Distributed Computing. Mixing MCQ drills with short written explanations is the best way to prep for both the progress check and the end-of-course exam.
How should I study AP CSP Unit 4?
Start AP CSP Unit 4 by building a clear picture of how the Internet moves data through packets, then move to Fault Tolerance so you understand why redundant paths matter. Finish with Parallel and Distributed Computing, focusing on when parallelism actually speeds things up vs. when it doesn't. Draw diagrams for network paths, write out your own fault-tolerant network example, and test yourself with MCQs at AP CSP Unit 4 after each topic.