AP Comp Sci Principles – 2023 Cheat Sheet
AP Comp Sci Principles – 2023 Cheat Sheet
Unit 1: Creative Development
- Computing Innovations: Innovations utilizing programs in their functions.
- Examples:
- Physical: Robots, Tablets, Smart Technology.
- Non-Physical: Social Media, Video Games.
- Collaboration: Enhances idea diversity, catering to various needs.
- Pair Programming: Two individuals collaborate at one computer, alternating coding tasks.
Program Function and Purpose
- Purpose: Designed objectives of a program (e.g., problem-solving, creative expression).
- Code Components:
- Code Segments: Smaller collections of statements within a program.
- Code Statements: Individual instructions executed by the program.
- Program Data:
- Inputs: Data received by programs in various formats (visual, auditory).
- Outputs: Resulting data returned by the program, matching input formats.
- Events: Actions prompting the program to react.
- Behavior: Program's response to user interactions.
- Development Processes:
- Iterative: Developing prototypes, revising repetitively.
- Incremental: Breaking problems into parts and solving them individually.
- Documentation:
- Program Documentation: Description of program components.
- Comments: Inline documentation within the code.
Common Errors
- Logic Errors: Incorrect program outcomes.
- Syntax Errors: Incorrectly written code preventing execution.
- Run-Time Errors: Errors that arise during program execution.
- Overflow Errors: Generated when numerical data exceeds limits.
- Fixing Techniques:
- Hand Tracing: Manually tracking variable values through execution.
- Print Statements: Debugging by displaying variable values.
Data Fundamentals
- Definition: Collection of facts; stored in bits (binary digits).
- Binary System: Base-2 system utilized in machine code.
- Abstraction: Simplification of data complexity by focusing on key elements.
- Binary Numbers:
- 8 bits = 1 byte.
- Hexadecimal: Base 16, used for RGB color codes.
- Data Representation:
- ASCII: Standard encoding method converting text to binary.
- Analog vs. Digital Data: Analog shows continuous changes, digital simplifies measurements, omitting unnecessary data.
Data Compression
- Factors: Method of compression and repetition in data.
- Types:
- Lossless Compression: Preserves quality; lower compression.
- Lossy Compression: Higher compression; reduced quality.
Data Manipulation
- Metadata: Data that describes other data.
- Data Mining: Analysis of large data sets to extract meaningful information.
- Transforming Data: Editing values or representations.
- Cleaning Data: Standardizing data without altering its meaning.
Pseudocode
- Important for MCQ section; remember that AP Pseudocode uses an index starting at 1.
Data Types
- Examples: Numbers, Strings, Lists, Booleans.
- Strings: Ordered character collections.
- Substrings: Parts of a string.
- Concatenation: Joining strings with
+.
- Lists (Arrays): Ordered sequences of elements.
- Elements: Individual list values; indexed positions.
- Booleans: True/False values associated with logical operations (NOT, AND, OR).
Algorithms
- Definition: Step-by-step instructions solving a problem using sequencing, selection, and iteration.
- Sequencing: Code execution in written order.
- Selection: Conditional statements (if/else).
- Iteration: Repeating processes, leveraging conditions.
- Binary Search: An algorithm that efficiently searches by halving data sets.
Procedures/Functions
- Procedures: Blocks of programming instructions (methods/functions).
- Parameters: Inputs for procedures.
- Arguments: Specific values in procedure calls, exemplifying abstraction.
Unit 4: Computer Systems & Networks
- Internet Basics: Interconnected networks facilitating communication between devices.
- Data Transmission: Data divided into packets; metadata included for routing.
- Routing: Finding optimal delivery paths.
- Bandwidth: Rate of data transfer (measured in megabits per second).
- Protocols: Rules governing data communication (TCP/IP, UDP).
- World Wide Web: A system of interconnected programs and pages.
- Scalability: Ability to adapt to size variations.
Fault Tolerance
- Definition: System operation continuity despite partial failures.
- Redundancy: Duplication strategy aiding fault-tolerant systems.
Computing Models
- Sequential Computing: Processes one at a time.
- Parallel Computing: Simultaneous processing of tasks.
- Distributed Computing: Collaborative execution across multiple devices.
Key Concepts of Computing Impact
- Digital Divide: Disparity in internet access shaped by demographics, socioeconomic status.
- Computing Bias: Historical data shaping biases in technology (e.g., recruitment algorithms).
- Intellectual Property: Ownership of creative work.
- Copyright: Protection of creators' rights.
- Creative Commons: Licensing for shared use of creative work.
- Open Sourcing: Free distribution and modification of work.
- Citizen Science: Publicly engaged scientific research.
Digital Security Essentials
- Personally Identifiable Information (PII): Information identifying individuals.
- Security Threats: Difference between viruses and worms; malware; phishing scams.
- Multi-factor Authentication: Multiple verification methods for security.
Encryption Overview
- Definition: Data encoding for protection.
- Key Types:
- Symmetric Key Encryption: Same key for encrypting/decrypting.
- Public Key Encryption: Public key for encryption; private key for decryption.
Exam Tips
Multiple Choice Questions (MCQs)
- 120 minutes for 70 questions (70% of score).
- Manage time: approximately 1.7 minutes per question. Skip and return to confounding questions. Guess if needed (no penalty).
Create Task
- 12+ hours allocated; responsible for submission by the deadline (May 1, 2023, 11:59 PM EDT).
- Review scoring guidelines pre-submission, ensuring alignment with rubric requirements.
- Compare work with sample responses utilizing College Board resources; avoid plagiarism.
- Confidence is key; preparation spans the entire academic year!