Understand packets, routing, redundancy, fault tolerance, distributed work, and cybersecurity.
5 lessons5 estimated blocksAP topics 4.1–4.3, 5.615 original exam questions
Unit overview
Use these lessons like the Algebra II and Physics pages: read the notes, learn the vocabulary, follow a worked example, attempt the quick checks before revealing solutions, and make a prediction before running the investigation.
5 blocks85-minute blocks, approximately 12 in the 16-week map
5 lessonsNotes, examples, vocabulary and quick checks
15 questionsFilterable exam-style bank
Success criteria
Distinguish the Internet from the Web.
Explain how DNS supports names.
Analyze a network failure using a graph.
Compare sequential, parallel and distributed execution.
Explain encryption, authentication and common attacks.
Course model: CodeHS for targeted coding, this page for conceptual understanding, and AP Classroom for official aligned assessment. This is an original supplementary resource, not an official College Board publication.
Lesson map
Lesson numbering on this page is site-specific. CodeHS uses a different lesson numbering system.
Each lesson ends with two quick checks. Open each answer only after attempting the problem.
Lesson 6.1 · AP 4.1 · 1 block
Internet structure and addressing
CodeHS: 11.1 Welcome to the Internet; 11.2 Internet Hardware; 11.3 Internet Addresses
Learning targets
Distinguish the Internet from the Web.
Explain IP addresses and packet-switched infrastructure.
Core notes
The Internet is a network of interconnected networks. IP provides addressing and packet delivery conventions. The World Wide Web is a service that uses the Internet. Devices and routers use layered protocols to communicate despite differences in underlying hardware.
Vocabulary
Internet interconnected network of networks
IP address network address
router forwards packets
Web linked online documents and applications
Worked example
Sending a webpage request involves the browser, network protocols, routers, and the receiving server. The Web is not the entire Internet.
Try it · Check your understanding
1. Does an IP address identify a human user permanently?Show solution
Not necessarily; addresses can be shared or reassigned.
2. Is email part of the World Wide Web by definition?Show solution
No. Email is an Internet service independent of the Web.
Describe how packets can follow different paths and be reassembled.
Core notes
DNS resolves names to addresses. Data is divided into packets which may travel by different routes. Routing determines useful next hops; multiple routes help systems remain available when paths fail. TCP supports reliable ordered delivery; IP handles packet addressing and routing.
Vocabulary
DNS name-to-address system
packet unit of transmitted data
protocol agreed communication rules
routing choosing packet paths
Worked example
If router B fails, a packet may travel A→C→D instead of A→B→D if the alternate link remains available.
Try it · Check your understanding
1. Must all packets follow the same route?Show solution
No; different packets can use different paths.
2. Does DNS encrypt all data?Show solution
No; DNS resolution and encryption are different functions.
Fault tolerance is the ability to continue operating when components fail. Redundancy supplies alternate components or routes. But one critical bridge or server may remain a single point of failure. Model failures by removing an edge or node, then checking reachability.
Vocabulary
fault tolerance continues through failures
redundancy duplicate or alternate parts
single point of failure component whose loss breaks system
reliability consistent functioning
Worked example
A ring network may route around one broken cable. A chain network may split when its middle cable breaks.
Try it · Check your understanding
1. Why add a second route?Show solution
To preserve connectivity when one path is unavailable.
2. Does redundancy guarantee immunity from every failure?Show solution
No; multiple failures or shared dependencies can still disrupt service.
Compare sequential, parallel and distributed execution.
Identify communication and coordination costs.
Core notes
Sequential tasks execute in order. Parallel computing runs compatible parts at the same time; distributed computing spreads work over different networked computers. Parallel speedup is limited by serial portions and coordination overhead. More machines do not guarantee proportional speed improvement.
Vocabulary
sequential one step after another
parallel overlapping work
distributed multiple connected machines
speedup comparison of runtimes
Worked example
Four workers can process four independent images concurrently, but a final aggregation stage still takes time after their results return.
Try it · Check your understanding
1. Can every task be perfectly parallelized?Show solution
No; dependencies and overhead limit speedup.
2. Can distributed computers experience network delay?Show solution
Explain encryption, authentication and common attacks.
Identify appropriate security practices.
Core notes
Encryption protects confidentiality by transforming data so that the intended recipient can recover it using keys. Authentication confirms identity. Symmetric encryption shares a secret key; public-key encryption uses a public/private key pair. Phishing, malware, and weak passwords exploit different vulnerabilities.
Vocabulary
encryption protect confidentiality
authentication verify identity
public key shareable cryptographic key
phishing deceptive attempt to obtain secrets
Worked example
A secured website connection can encrypt data in transit, but it cannot prevent a user from revealing a password to a phishing page.
Try it · Check your understanding
1. Does encryption alone prove who sent a message?Show solution
Core video selection: The matching CodeHS lesson video and AP Daily topic video for each lesson. Direct AP Daily videos are accessed inside the school's AP Classroom enrollment and may not have public URLs.
Lesson 6.1: Internet structure and addressing. Watch the matched CodeHS lesson video and the corresponding AP Daily topic video for 4.1; pause to answer the notes prompt before the interactive lab. AP Daily requires student login.
Lesson 6.2: DNS, packets and routing. Watch the matched CodeHS lesson video and the corresponding AP Daily topic video for 4.1; pause to answer the notes prompt before the interactive lab. AP Daily requires student login.
Lesson 6.3: Fault tolerance and redundancy. Watch the matched CodeHS lesson video and the corresponding AP Daily topic video for 4.2; pause to answer the notes prompt before the interactive lab. AP Daily requires student login.
Lesson 6.4: Parallel and distributed computing. Watch the matched CodeHS lesson video and the corresponding AP Daily topic video for 4.3; pause to answer the notes prompt before the interactive lab. AP Daily requires student login.
Lesson 6.5: Cybersecurity and encryption. Watch the matched CodeHS lesson video and the corresponding AP Daily topic video for 5.6; pause to answer the notes prompt before the interactive lab. AP Daily requires student login.
Video selections are topic- and platform-matched. Teachers should check account availability and assign individual CodeHS/AP Daily clips from their course dashboards.
Interactive inquiry · Packet network simulator
Make a prediction, manipulate the model, record observations, and explain whether your original thinking was correct.
Student lab record: Before you start, write your prediction and reasoning. Afterward, record at least two trials and an evidence-based conclusion. This model is illustrative and its limitations should be noted.
Packet route and fault-tolerance simulator
Model five routers: A (sender), B, C, D and E (receiver). Connections are A–B, B–E, A–C, C–D, D–E and B–D. Predict whether messages can still travel from A to E when a router fails.
Choose a failure and find a route.
Analysis: Which nodes are single points of failure? Why is packet routing not the same thing as encryption?
Investigation record
Lab responses stay in this page; they are not uploaded or stored on a server.
AP-style practice & self-check
Original multiple-choice questions focus on reasoning, not just coding. Filter by lesson and difficulty. Show explanations in practice mode or hide them in exam mode.
Mastery target: 80% on mixed original questions, plus a clear written explanation on one unfamiliar scenario. Treat the bank as practice, not a secure test.
Teacher lesson specifications & implementation
Teacher-facing scope, exact learning goals, CodeHS alignments, and assessment requirements. This section can be hidden or separated before student publishing.
Pacing and lesson allocation
5 × 85-minute blocks. Shorten or extend CodeHS programming time based on prior experience and how many blocks actually meet; all lessons are supplemental to the main CodeHS course.
Default block: 10 min retrieval · 20 min notes/video · 20 min inquiry · 25 min selected CodeHS/independent practice · 10 min quick assessment.
Lesson
AP
CodeHS
Measurable targets
Assessment specifications
6.1 Internet structure and addressing
4.1
11.1 Welcome to the Internet; 11.2 Internet Hardware; 11.3 Internet Addresses
Distinguish the Internet from the Web.; Explain IP addresses and packet-switched infrastructure.
40 points: 20 original AP-style multiple-choice questions (1 point each), four short-answer reasoning prompts (3 points each), and one 8-point novel investigation/analysis. Mix current-unit and prior-unit topics. Use AP Classroom separately for official question practice.
Assessment and feedback strategy
Independent predictions precede each simulation.
Students justify one wrong multiple-choice distractor in writing.
Teacher verifies model limitations, not just numeric answers.
Repeat key pseudocode and binary ideas in later units.