AP CSP - Advanced Computing Challenges

Front

Redundant Data vs. Information Loss

Back

> [!INSIGHT] Compression Tradeoff Data compression reduces bits (storage/speed) but risks losing information (lossy) or requires processing time (lossless). Redundant data (repeated patterns) compresses better than random data.

Front

Computing Innovation Risks

Back

Risks include negative environmental impact (e-waste, energy use), security breaches (identity theft), and equity loss (digital divide). Mitigation requires identifying these specific harms during the design phase.

Front

Symmetric vs. Asymmetric Encryption

Back

> [!NOTE] Key Management Symmetric uses one shared key (fast, but key distribution is risky). Asymmetric (Public Key) uses a public key for encryption and a private key for decryption (slower, but solves secure key exchange).

Front

The Internet Packet Routing

Back

Data is split into packets. Each packet contains metadata (Source IP, Destination IP, sequence number). Routers use the destination IP and routing tables (protocols like BGP) to determine the next hop, potentially reassembling packets via different paths.

Front

Sequential vs. Parallel Computing

Back

Sequential: One task at a time. Parallel: Multiple tasks simultaneously. **Speedup:** Parallel is faster, but limited by the overhead of managing parallel tasks and the need for sequential portions (Amdahl's Law concept).