In AP Computer Science Principles, redundancy is the inclusion of extra components that can mitigate failure if other components fail (EK CSN-1.E.2), like multiple paths between devices on the Internet. In data compression, redundancy also means repeated data that compression algorithms can squeeze out.
Redundancy is one of those terms that does double duty in AP CSP, and the exam loves both meanings.
In Unit 4 (Computer Systems and Networks), redundancy is a good thing. It means building extra components into a system so that if one part fails, another can take over. The CED defines it directly in EK CSN-1.E.2 as "the inclusion of extra components that can be used to mitigate failure of a system if other components fail." The Internet is the classic example. Network redundancy means having more than one path between any two connected devices, so if a router or cable dies, data just takes a different route. That's what makes the Internet fault-tolerant.
In Unit 2 (Data), redundancy flips meaning. There, it refers to repeated or predictable patterns in data, like "AAAAAAA" in a file. Compression algorithms work by finding and removing that redundancy. Per EK DAT-1.D.3, how much a file shrinks depends on how much redundancy the original data has and which algorithm you use. Same word, two contexts. In networks, you add redundancy on purpose. In data, you squeeze it out on purpose.
Redundancy sits at the heart of Topic 4.2 (Fault Tolerance) and supports learning objective AP Comp Sci P 4.2.A, which asks you to describe the benefits of fault tolerance, explain how a given system is fault-tolerant, and identify vulnerabilities to failure. You can't answer any of those without redundancy. A system is fault-tolerant because it has redundant components or paths, and a system is vulnerable where it lacks them (think single points of failure). It also shows up in Topic 2.2 (Data Compression) under AP Comp Sci P 2.2.A, where the amount of redundancy in data determines how well compression works. If you can recognize redundancy in both contexts, you've covered two units with one concept.
Keep studying AP Computer Science Principles Unit 2
Fault Tolerance (Unit 4)
Redundancy is the how, fault tolerance is the result. A system becomes fault-tolerant by including redundant components, so when one fails, the system keeps running. EK CSN-1.E.1 says the Internet was engineered this way from the start.
Routing (Unit 4)
Routing is what puts network redundancy to work. When a device or connection fails, routing finds an alternate path for subsequent data (EK CSN-1.E.4). Redundant paths are useless without a routing system smart enough to use them.
Lossless data compression (Unit 2)
Lossless compression shrinks files by replacing redundant, repeated data with shorter representations, then perfectly rebuilds the original. More redundancy in the file means more room to compress. This is the flip side of the term, where redundancy is something you remove instead of add.
Backup (Unit 4)
A backup is a specific form of redundancy applied to data and servers. The practice question about a redundant server automatically taking over when the primary fails is backup-style redundancy keeping a system online.
Redundancy shows up almost entirely in multiple-choice questions, usually in scenario form. A typical stem describes a network setup and asks you to identify the benefit of a redundant design, spot the vulnerability, or pick the modification that improves fault tolerance. For example, a star topology with a single central hub is a classic trap. The fix is adding redundant connections so there's more than one path between devices, eliminating the single point of failure. You might also see redundant servers that take over automatically, or triple modular redundancy where three processors vote on an output. In Unit 2 questions, redundancy appears when comparing compression algorithms, since size reduction depends on how much redundancy the original data contains. Your job is always the same. Identify where the redundancy is (or isn't), and explain what it does for the system.
These get used interchangeably, but they aren't the same thing. Redundancy is a design choice, the extra components or paths you build in. Fault tolerance is the property a system gains as a result, the ability to keep operating when parts fail. Redundancy is the cause, fault tolerance is the effect. On an MCQ, if the question asks what was added to the system, the answer is redundancy. If it asks what the system can now do, that's fault tolerance.
Redundancy means including extra components that can mitigate failure if other components fail (EK CSN-1.E.2).
Network redundancy is achieved by having more than one path between any two connected devices, so data can reroute when something fails.
Redundancy is what makes a system fault-tolerant; without redundant components, a single point of failure can take the whole system down.
In Unit 2, redundancy means repeated patterns in data, and the amount of redundancy in a file determines how much compression can shrink it.
The Internet was deliberately engineered with redundancy so that if a device or connection fails, subsequent data is sent via a different route.
A single central hub or lone server is a vulnerability; adding redundant paths or backup servers is the standard fix exam questions look for.
Redundancy is the inclusion of extra components that can mitigate failure of a system if other components fail (EK CSN-1.E.2). On the Internet, that means multiple paths between devices, so traffic can reroute around a failed router or cable.
It depends on context. In networks (Unit 4), redundancy is deliberately good because it makes systems fault-tolerant. In data (Unit 2), redundancy is wasted space that compression algorithms remove to reduce file size. AP CSP tests both meanings.
Redundancy is the design technique (extra components or paths), while fault tolerance is the resulting ability of the system to keep working despite failures. You add redundancy to achieve fault tolerance.
The Internet has more than one path between connected devices, so if a device or connection fails, routing sends subsequent data along a different route (EK CSN-1.E.3 and CSN-1.E.4). No single failure brings the whole network down.
Compression algorithms shrink files by removing redundancy, the repeated or predictable patterns in data. Per EK DAT-1.D.3, the more redundancy in the original data, the more a compression algorithm can reduce its size.