Skip to main content

Unit 4

11–15% of exam

Computer Systems and Networks

The internet is a giant network of networks that moves your data in small pieces called packets, following shared rules called protocols. This unit explains how that works, why the internet keeps running when parts of it fail, and how splitting a job across several processors or computers can finish it faster.

Study this unit

Flashcards (29)Practice questions (51)Computer Science Principles must-know sheet

Free-response questions on this unit

Write your own answer, then score it with the rubric or with AI.

Big ideas

  • The internet is a network of networks built on open protocols anyone can use
  • Data travels in packets that can take different paths and arrive out of order
  • The World Wide Web runs on the internet; it isn't the internet itself
  • Redundant paths make the internet fault tolerant
  • Parallel and distributed computing speed up big jobs, but the sequential part limits the speedup

Full unit reviews

Longer videos that cover the whole unit. Good for a first pass or a final review.

  • AP CS Principles: The Internet and Networks Review

    Mr Comp SciWatch on YouTube (opens in a new tab)

  • [CompSci] Computer Systems and Networks | Big Ideas in Computer Science Principles

    Eamon MarchantWatch on YouTube (opens in a new tab)

  • AP CSP 2021 - Internet Review

    Quincy TennysonWatch on YouTube (opens in a new tab)

Computing devices connected together form a network, and the internet is a network of networks that works because everyone follows open protocols such as IP, TCP and UDP. Your data is split into packets that routers send along paths that can change. Bandwidth is the most data a connection can carry in a set time, usually measured in bits per second. The World Wide Web (linked pages sent using HTTP) is one service that runs on the internet.

Key terms

  • packet
  • protocol (IP, TCP, UDP)
  • routing
  • bandwidth
  • World Wide Web (HTTP)
  • scalability
  • AP CS Principles Exam Review - The Internet

    Flavio KupermanWatch on YouTube (opens in a new tab)

  • The Internet: IP Addresses & DNS

    CodeAIWatch on YouTube (opens in a new tab)

  • The Internet: Crash Course Computer Science #29

    CrashCourseWatch on YouTube (opens in a new tab)

  • Addressing and Protocols. Topic 4.1, Code.org Unit 2.3 walkthrough. 4 AP CSP review questions!

    Dr_WuWatch on YouTube (opens in a new tab)

  • Packets and Protocols

    CodeHSWatch on YouTube (opens in a new tab)

  • Bit Rate, Bandwidth, and Latency (AP Computer Science Principles Unit 2: The Internet)

    Professor CunninghamWatch on YouTube (opens in a new tab)

Read the review notes: 4.1 The Internet

A few quick questions on this topic, with the answers explained.

Redundancy means having extra parts, like several possible paths between two devices, so the system keeps working if one part fails. Because packets can be rerouted around a broken connection or router, the internet is fault tolerant, though building in redundancy costs more.

Key terms

  • fault tolerance
  • redundancy
  • path
  • rerouting
  • reliability
  • AP CSP Topic 4.2 - Routers and Redundancy - Code.org Unit 2.4 walkthrough - PLUS 4 practice MCQs!!

    Dr_WuWatch on YouTube (opens in a new tab)

  • The Internet: Packets, Routing & Reliability

    CodeAIWatch on YouTube (opens in a new tab)

  • Quick Bit: Redundancy and Fault Tolerance

    UTeach Computer ScienceWatch on YouTube (opens in a new tab)

  • Redundancy and Fault Tolerance (AP Computer Science Principles, Unit 2)

    Professor CunninghamWatch on YouTube (opens in a new tab)

  • AP CSP U2 L4 Routers and Redundancy

    Janelle WhalenWatch on YouTube (opens in a new tab)

  • AP CSP Topic 4.2 - Fault Tolerance - Speedrun! 43 MCQs!

    Dr_WuWatch on YouTube (opens in a new tab)

Read the review notes: 4.2 Fault Tolerance

A few quick questions on this topic, with the answers explained.

Sequential computing does one operation at a time, parallel computing runs parts of a program at the same time, and distributed computing spreads a job across several computers. A parallel solution's time is the time for the steps that must run one after another plus the time of the slowest parallel piece, and speedup is the sequential time divided by the parallel time. For example, a 10-second step that must come first plus two 30-second steps run side by side takes 40 seconds instead of 70, a speedup of 70 ÷ 40 = 1.75; adding more processors can't remove the steps that must run in order.

Key terms

  • sequential computing
  • parallel computing
  • distributed computing
  • speedup
  • AP CS Principles Exam Review - Parallel Computing

    Flavio KupermanWatch on YouTube (opens in a new tab)

  • Sequential and Parallel Computing

    CodeHSWatch on YouTube (opens in a new tab)

  • AP CSP Topic 4.3 - Sequential, Parallel, and Distributed computing - 8 practice MCQs !

    Dr_WuWatch on YouTube (opens in a new tab)

  • AP CSP U6 L5 Distributed and Parallel Computing

    Janelle WhalenWatch on YouTube (opens in a new tab)

  • AP CSP Topic 4.3 - Sequential, Parallel, and Distributed computing - 38 practice MCQs, SPEEDRUN !

    Dr_WuWatch on YouTube (opens in a new tab)

Read the review notes: 4.3 Parallel and Distributed Computing

A few quick questions on this topic, with the answers explained.