AP Computer Science A Course at a Glance, Effective Fall 2019 Plan The Course at a Glance provides a useful visual organization of the AP Computer Science A curricular components, including the follow[.]
Course at a Glance Primitive Types UNIT ~8–10 Class Periods MOD 1.1 Plan The Course at a Glance provides a useful visual organization of the AP Computer Science A curricular components, including the following: §§ Sequence of units, along with approximate weighting and suggested pacing Please note, pacing is based on 45-minute class periods, meeting five days each week for a full academic year VAR 2.5–5% UNIT AP Exam Weighting Why Programming? Why Java? VAR 1.4 Compound Assignment Operators MOD 2.4 Calling a Void Method with Parameters 1.5 Casting and Ranges of Variables MOD 2.5 Calling a Non-void Method VAR 2.6 VAR 2.7 VAR COMPUTATIONAL THINKING PRACTICES 2.8 Practices spiral across units Code Logic Code Implementation Code Testing Documentation Creating and Storing Objects (Instantiation) Calling a Void Method Teach Objects: Instances of Classes MOD 2.3 §§ Spiraling of the big ideas and practices across units Program Design and Algorithm Development AP Exam Weighting Expressions and Assignment Statements §§ Progression of topics within each unit 5–7.5% 1.3 5 Class Periods VAR CON MOD 2.1 MOD 2.2 CON ~13–15 Variables and Data Types 1.2 CON Using Objects MOD 2.9 String Objects: Concatenation, Literals, and More String Methods Wrapper Classes: Integer and Double Using the Math Class CON + BIG IDEAS Big ideas spiral across units MOD Modularity CON Control VAR Variables IOC Assess Assign the Personal Progress Checks—either as homework or in class—for each unit Each Personal Progress Check contains formative multiplechoice questions and formative free-response questions that are written in a similar style to what students will experience on the end-of-year exam Feedback from the Personal Progress Checks shows students the areas on which they need to focus Personal Progress Check Personal Progress Check Multiple-choice: ~25 questions Multiple-choice: ~25 questions Free-response: question §§ Methods and Control Structures: partial NOTE: Partial versions of the free-response questions are provided to prepare students for more complex, full questions that they will encounter on the AP Exam V.1 | 22 © 2019 College Board 00762-118-CED-CSA_Introduction.indd 22 4/13/19 12:08 PM UNIT ~11–13 CON 3.1 Boolean Expressions and if Statements Class Periods 15–17.5% AP Exam Weighting Boolean Expressions CON 3.3 if-else Statements CON 4.3 3.4 CON Control Flow else if Statements 3.5 Compound Boolean Expressions 3.6 Equivalent Boolean Expressions + CON + CON while Loops Writing Classes ~12–14 MOD 5.1 Class Periods 5–7.5% AP Exam Weighting Anatomy of a Class 4.2 CON + 4.1 CON CON CON UNIT Iteration % AP Exam ~14–16 Class Periods 17.5–22.5 Weighting if Statements and CON 3.2 CON UNIT for Loops Developing Algorithms Using Strings MOD 5.2 Constructors MOD 5.3 Documentation with Comments 4.4 Nested Iteration 4.5 Informal Code Analysis MOD 5.4 Accessor Methods MOD 5.5 Mutator Methods MOD 5.6 Writing Methods MOD 5.7 Static Variables and Methods VAR 5.8 Scope and Access 5.9 this Keyword VAR IOC N/A 5.10 Ethical and Social Implications of Computing Systems Personal Progress Check Personal Progress Check Personal Progress Check Multiple-choice: ~20 questions Free-response: questions §§ Methods and Control Structures §§ Multiple-choice: ~15 questions Free-response: questions §§ Methods and Control Structures §§ Methods and Control Structures: partial Multiple-choice: ~25 questions Free-response: questions §§ Class §§ Class: partial V.1 | 23 2019 College Board 00762-118-CED-CSA_Introduction.indd 23 4/13/19 12:08 PM UNIT ~6–8 VAR 6.1 VAR + VAR 6.2 + Class Periods 10–15% AP Exam Weighting ~10–12 Array Creation and Access VAR Traversing Arrays VAR 7.1 7.2 6.3 CON UNIT Array 6.4 Enhanced for Loop for Arrays VAR Developing Algorithms Using Arrays CON ArrayList Class Periods 2.5–7.5% UNIT AP Exam Weighting Introduction to ArrayList ArrayList Methods VAR Class Periods 7.5–10% AP Exam Weighting 8.1 2D Arrays 8.2 Traversing 2D Arrays VAR CON 7.3 Traversing ArrayLists 7.4 Developing Algorithms Using ArrayLists 7.5 Searching 7.6 Sorting 7.7 Ethical Issues Around Data Collection 3 CON ~10–12 2D Array + CON IOC N/A Personal Progress Check Personal Progress Check Personal Progress Check Multiple-choice: ~15 questions Free-response: questions §§ Array and ArrayList (Array only) §§ Array and ArrayList (Array only): partial Multiple-choice: ~15 questions Free-response: question §§ Array and ArrayList (ArrayList focus) Multiple-choice: ~10 questions Free-response: question §§ 2D Array V.1 | 24 © 2019 College Board 00762-118-CED-CSA_Introduction.indd 24 4/13/19 12:08 PM UNIT UNIT Inheritance ~13–15 Class Periods 5–10% 10 AP Exam Weighting ~3–5 MOD 9.1 Creating Superclasses and Subclasses CON MOD 9.2 Writing Constructors for Subclasses CON MOD 9.3 Overriding Methods MOD 9.4 MOD 9.5 MOD Recursion Class Periods 5–7.5% AP Exam Weighting 10.1 Recursion 10.2 Recursive Searching and Sorting super Keyword Creating References Using Inheritance Hierarchies MOD Personal Progress Check Personal Progress Check 10 Multiple-choice: ~15 questions Free-response: questions §§ Class §§ Multiple-choice: ~10 questions Free-response: question §§ Methods and Control Structures (recursive and non-recursive solutions allowed) V.1 | 25 2019 College Board 00762-118-CED-CSA_Introduction.indd 25 4/13/19 12:08 PM ... UNIT Array 6.4 Enhanced for Loop for Arrays VAR Developing Algorithms Using Arrays CON ArrayList Class Periods 2.5–7.5% UNIT AP Exam Weighting Introduction to ArrayList ArrayList Methods VAR Class... 7.5–10% AP Exam Weighting 8.1 2D Arrays 8.2 Traversing 2D Arrays VAR CON 7.3 Traversing ArrayLists 7.4 Developing Algorithms Using ArrayLists 7.5 Searching 7.6 Sorting 7.7 Ethical Issues Around Data... 00762-118-CED-CSA_Introduction.indd 23 4/13/19 12:08 PM UNIT ~6–8 VAR 6.1 VAR + VAR 6.2 + Class Periods 10–15% AP Exam Weighting ~10–12 Array Creation and Access VAR Traversing Arrays VAR 7.1 7.2