Tian2 田二
The Tian2 Study Library AP Edition · Tian2 Editorial Bureau
Volume I · MMXXVI AP Computer Science Principles
Library AP Computer Science Principles Unit 3: Algorithms and Programming
⁂   AP Computer Science Principles · Unit 3

3. Algorithms and Programming

30–35% of the AP exam. Key topics: Variables and assignment using AP pseudocode (← operator), Arithmetic, relational, and Boolean operators (AND, OR, NOT), Strings and string operations, Lists and collections: creation, access, INSERT, APPEND, REMOVE, LENGTH, AP pseudocode 1-based list indexing, Procedures: defining with parameters, calling, and returning values, Libraries and APIs: using existing procedures, Sequential, selection (IF/ELSE/ELSE IF), and iteration (REPEAT N TIMES, REPEAT UNTIL, FOR EACH) constructs, Developing and refining algorithms, Linear search vs. binary search (binary search requires sorted list), Algorithm efficiency: conceptual comparison of time requirements, Heuristic approaches for intractable problems, Undecidable problems and the Halting Problem, Simulations and modeling.

30–35% exam weight standard track

Unit 3: Algorithms and Programming

Study guide content for this unit is being prepared. Check back soon for complete lesson notes, formula sheets, and worked examples.

Topics in this unit

  • Variables and assignment using AP pseudocode (← operator)
  • Arithmetic, relational, and Boolean operators (AND, OR, NOT)
  • Strings and string operations
  • Lists and collections: creation, access, INSERT, APPEND, REMOVE, LENGTH
  • AP pseudocode 1-based list indexing
  • Procedures: defining with parameters, calling, and returning values
  • Libraries and APIs: using existing procedures
  • Sequential, selection (IF/ELSE/ELSE IF), and iteration (REPEAT N TIMES, REPEAT UNTIL, FOR EACH) constructs
  • Developing and refining algorithms
  • Linear search vs. binary search (binary search requires sorted list)
  • Algorithm efficiency: conceptual comparison of time requirements
  • Heuristic approaches for intractable problems
  • Undecidable problems and the Halting Problem
  • Simulations and modeling