Java Software Solutions for AP Computer Science 3rd Edition 2011, Lewis et al.

Transcription

1 A Correlation and Narrative Brief of AP Computer Science 3rd Edition 2011, Lewis et al. To the AP Computer Science A Course Description

2 TEXTBOOK NARRATIVE FOR THE STATE OF TENNESSEE AP* Computer Science, 3/e (ISBN: ) Overview AP* Computer Science fully supports the latest course description for the AP* Computer Science exam. Features Expanded discussion of the representation of primitive types including imprecision and round off error. Enhanced discussion of testing, debugging, and loop analysis, Integrated coverage of ethical and social implications related to computing. New AP* Correlation Guide to College Board topics. Table of Contents Chapter 1 Computer Systems 1 Chapter 2 Objects and Primitive Data Chapter 3 Program Statements Chapter 4 Writing Classes Chapter 5 Enhancing Classes Chapter 6 Arrays Chapter 7 Inheritance Chapter 8 Recursion Chapter 9 Linear Data Structures Chapter 10 Non-linear Data Structures Appendix A: Glossary Appendix B: The Unicode Character Set Appendix C: Java Operators Appendix D: The Java Class Library Appendix E: Number Systems Appendix F: Responsible Use of Computer Systems Index Program Components AP* Test Prep Online Instructor s Resources (Solutions, PowerPoints, Tests, Sample Exams). 2

3 Topic Outline - Following is an outline of the major topics considered for the AP Computer Science A Exam. This outline is intended to define the scope of the course but not necessarily the sequence. I. Object-Oriented Program Design - The overall goal for designing a piece of software (a computer program) is to correctly solve the given problem. At the same time, this goal should encompass specifying and designing a program that is understandable, can be adapted to changing circumstances, and has the potential to be reused in whole or in part. The design process needs to be based on a thorough understanding of the problem to be solved. A. Program design 1. Read and understand a problem description, purpose, and goals. SE: 2, Apply data abstraction and encapsulation. SE: 56-57, , TG: Ch 2, 1-3, Ch 4, 1-3, Ch 5, 1-4 AP: Read and understand class specifications and relationships among the classes ( is-a, has-a relationships). 4. Understand and implement a given class hierarchy. 5. Identify reusable components from existing code using classes and class libraries. SE: , , 364 TG: Ch 4, 1-3 SE: TG: Ch 7, 1-3 SE: 53, 82-89, B. Class design 1. Design and implement a class. SE: , , , , TG: Ch 4, Choose appropriate data representation and algorithms. SE: , AP: Apply functional decomposition. SE: , Extend a given class using inheritance. SE: , , , 389 TG: Ch 7, 1-3 3

4 II. Program Implementation - The overall goals of program implementation parallel those of program design. Classes that fill common needs should be built so that they can be reused easily in other programs. Object-oriented design is an important part of program implementation. A. Implementation techniques 1. Methodology a. Object-oriented development SE: TG: Ch 1, 1-3 AP: b. Top-down development SE: TG: Ch 1, 1-3 c. Encapsulation and information hiding SE: TG: Ch 4, 1-3, Ch 5, 1-4 d. Procedural abstraction SE: 56-57, 192 TG: Ch 5, 1-4 AP: B. Programming constructs 1. Primitive types vs. objects SE: 52-57, TG: Ch 2, 1-4 AP: Declaration a. Constant declarations SE: 65 b. Variable declarations SE: 61 TG: Ch 2, 1-4 c. Class declarations SE: d. Interface declarations SE: TG: Ch 5, 1-4 AP: 42-44, 66, 77 e. Method declarations SE: TG: Ch 4, 1-3 AP: 27 f. Parameter declarations SE: 199 TG: Ch 4, 1-3, Ch 5, 1-4 AP: Console output (System.out.print/println) SE:

5 4. Control a. Methods SE: TG: Ch 4, 1-3 b. Sequential SE: 120 c. Conditional SE: TG: Ch 3, 1-4 AP: d. Iteration SE: , , , , 336 TG: Ch 3, 1-4 e. Understand and evaluate recursive methods SE: TG: Ch 8, 1-3 AP: C. Java library classes (included in the AP Java subset) SE: 82-96, 264, TG: Ch 9, 1-2 AP: III. Program Analysis - The analysis of programs includes examining and testing programs to determine whether they correctly meet their specifications. It also includes the analysis of programs or algorithms in order to understand their time and space requirements when applied to different data sets. A. Testing 1. Test classes and libraries in isolation. SE: Identify boundary cases and generate appropriate test data. SE: Perform integration testing. SE: B. Debugging 1. Categorize errors: compile-time, run-time, logic. SE: Identify and correct errors. SE: 37, Employ techniques such as using a debugger, adding extra output statements, or hand-tracing code. SE:

6 C. Understand and modify existing code SE: 25, 30-31, 47-48, 55, 58, 59, 61, 62, 64, 71, 75, 79, 87, 91, 92, 94, 96, , , , 129, 137, , , , , 150, , 154, 156, , , , , , 185, 186, , 194, , 205, , 208, , 212, , 217, 218, 219, , 224, , , 248, 250, 251, , 258, 259, 260, 261, 262, 263, , 275, , 280, , , 298, 300, , 304, 307, 308, , , 313, 315, 316, 318, 320, , , , 335, 337, , 342, , 346, , , , , , , , , , , , , , 452, , , 477, , , , 491, , , , 519, , 522, , 532, , 536, , , 551 D. Extend existing code using inheritance SE: , TG: Ch 7, 1-3 AP: 37 E. Understand error handling 1. Understand runtime exceptions. SE: F. Reason about programs 1. Pre- and post-conditions SE: AP: Assertions SE: 201 G. Analysis of algorithms 1. Informal comparisons of running times SE: Exact calculation of statement execution counts SE: 314 H. Numerical representations and limits 1. Representations of numbers in different bases SE: 6-9, Limitations of finite representations (e.g., integer bounds, imprecision of floating-point representations, and round-off error) SE: 66, 134 6

7 IV. Standard Data Structures - Data structures are used to represent information within a program. Abstraction is an important theme in the development and application of data structures. A. Simple data types (int, boolean, double) SE: B. Classes SE: 53, C. Lists SE: , TG: Ch 6, 1-3 AP: D. Arrays SE: TG: Ch 6, 1-3 AP: 17-23, V. Standard Algorithms - Standard algorithms serve as examples of good solutions to standard problems. Many are intertwined with standard data structures. These algorithms provide examples for analysis of program efficiency. A. Operations on data structures previously listed 1. Traversals SE: , Insertions SE: Deletions SE: B. Searching 1. Sequential SE: AP: Binary SE: TG: Ch 10, 1-2 AP: 73 C. Sorting 1. Selection SE: TG: Insertion SE: AP: Mergesort SE: AP: 72 7

8 VI. Computing in Context - An awareness of the ethical and social implications of computing systems is necessary for the study of computer science. These topics need not be addressed in detail but should be considered throughout the course. A. System reliability SE: B. Privacy SE: C. Legal issues and intellectual property SE: D. Social and ethical ramifications of computer use SE: