Course Syllabus - Highland Park High School

AP COMPUTER SCIENCE I (2013-2013)
Instructor: Brenda McGurgan Room: G-202
Phone: 214-780-4772 Conference Period: 8 th period (2:40-3:30)
Email: mcgurgb@hpisd.org
Course Description and Goals
The AP Computer Science A course is an introductory course in computer science. Because the design and implementation
of computer programs to solve problems involve skills that are fundamental to the study of computer science, a large part
of the course is built around the development of computer programs that correctly solve a given problem. These programs
should be understandable, adaptable, and, when appropriate, reusable. At the same time, the design and implementation of
computer programs is used as a context for introducing other important aspects of computer science, including the
development and analysis of algorithms, the development and use of fundamental data structures, the study of standard
algorithms and typical applications, and the use of logic and formal methods. In addition, the responsible use of these
systems is an integral part of the course.
Upon completion of the class, students should be able to:
• design and implement solutions to problems by writing, running, and debugging computer programs.
• use and implement commonly used algorithms and data structures.
• develop and select appropriate algorithms and data structures to solve problems.
• code fluently in an object-oriented paradigm using the programming language Java. Students are expected to be
familiar with and be able to use standard Java library classes from the AP Java subset.
• read and understand a large program consisting of several classes and interacting objects. Students should be able
to read and understand a description of the design and development process leading to such a program. (An
example of such a program is the AP Computer Science Case Study.)
• recognize the ethical and social implications of computer use.
Class Rules
1. No food or drink (exception: bottled water is acceptable)
2. The HPISD Responsible Use Policy will be followed.
3. Downloading or installation of software is prohibited.
4. Save work only to your network folder unless otherwise directed.
5. Be respectful and courteous to your instructor and classmates at all times.
6. Dress and behavior as outlined in the Kiltie will be followed.
Course Requirements
1. Sign up and take the AP Computer Science Exam A (Tuesday, May 6, 8:00am)
2. Barron's AP Computer Science A - by Roselyn Teukolsky [available in the Highland Park Student Store]
(due October 4) ISBN-10: 1438001525
3. 3-ring binder (D-ring) 1.5” or 2” with 10 dividers and extra notebook paper.
First binder grade will be: Wednesday, Sept 4, 2013
Grades
Minor Grades (homework, quizzes, labs) = 40% of 6 weeks grade
Major Grades (exams and projects) = 60% of 6 weeks grade
(retake policy for Major grades will follow district-approved Grading Guidelines)
AP Computer Science I 2013-2014 page 1 of 4

Late Work
All homework assignments are due at the beginning of class, when the bell rings, on the required date. All
assignments received at that time will have the potential of receiving 100% of the possible points for that work. If the
assignment is not received at that time, it is late. 15 points per day will be deducted from the earned grade for all late
work. Programming assignments usually have a 4:00pm deadline on a given date.
1 day late = 15 point deduction
2 days late = 30 point deduction
3 days late = 45 point deduction
After 3 days, the highest grade possible will be a 50
Homework: Late work will be accepted ONLY UNTIL answers have been given out in class. After answers
have been given in class, a zero will be recorded.
Tardy and Absence Policy and Makeup Work
For all school-related absences and absences where there is prior knowledge of the absence, it is expected that all work
will be turned in prior to the absence. For exams and work where early submission is not possible, The Kiltie governs
tardy and attendance policy and the right to make up work.
Lab Availability:
Open Lab and tutorials are available at the following times:
M-Th --7:30am – 8:10am
M-Th --3:30pm – 4:00pm
AP Computer Science I 2013-2014 page 2 of 4

Course Objectives
The students will study the following topics:
UNIT 1 – Computer Hardware and Number Systems
1.1 Name and identify the three parts that make
up the computer system.
1.2 Identify major hardware components and
give examples.
1.3 List, compare and contrast the two CPU
logic categories and give examples of each
1.4 Compare and contrast ASCII and Unicode
1.5 Convert text and numbers to Unicode and
corresponding values in base 2 , base 10 &
base 16
1.6 Convert base 2 , base 10 & base 16 values to
Unicode and its corresponding text and
numbers.
UNIT 2 – The “Object” of Java Programming
2.1 List critical elements in the Java
Programming Language
2.2 Identify the elements within the Class
structure
2.3 Construct a Remark Block and use 1 line
remarks and multi-line remarks.
2.4 Create and identify reserved words, userdefined
and pre- defined identifiers using
the Java Naming rules.
2.5 Program, test, and debug simple output
objects using a single object class and a
program class.
UNIT 3 – Objects and Primitive Data
3.1 Discuss objects and the services provided
by methods
3.2 Discuss Inheritance and data hiding
3.3 List and discuss the primitive data types
3.4 Declare and use primitive data variables
3.5 Declare and use string, object reference
variables.
3.6 Find and use the Java Application
Programming Interface [API]
3.7 Define and use the string concatenation
operator
3.8 Use the print and println methods
3.9 Use Escape characters in string output.
3.10 Assign values to variables
3.11 Compare constants and variables and create
examples of each
3.12 Create mathematical expressions using
Java math operators
3.13 Compute answers using proper orders of
operations and operator precedence
3.14 Discuss and give examples of division and
remainder rules
3.15 Discuss data conversion using assignment
conversion, arithmetic promotion, and
casting
UNIT 4 – Math Classes and Methods
4.1 Import and use standard java class libraries
including java.util
4.2 Instantiate objects using new
4.3 Instantiate string objects by assignment
4.4 Discuss strings as immutable objects
4.5 Use string methods
4.6 Use the Scanner class to bring in data from
the keyboard
4.7 Use wrapper classes to represent primitive
data
4.8 Create and use random number generators
to create random int and double values
4.9 Create and use for and while loops
4.10 Define Loop Control Variable [LCV] the
tell what it does
4.11 Define “flag” or “sentinel” value and tell
what it does
4.12 Define “infinite loop”
4.13 Use if, if else, and nested if else statements
to make decisions
UNIT 5 – Logic and More Loops
5.1 Compare pre-test and post-test loops
5.2 Create and use nested loops
5.3 Compare the Assignment Operator[=] to
the Equality Operator [= =]
5.4 List the Compound Assignment Operators
and tell what they mean.
5.5 Write equivalent expressions to the
Compound Assignment Operators.
5.6 Tell what it means to “chain” assignments
and given an example.
5.7 List the relational and logical operators
[NOT, AND, OR]
5.8 List the three rules for Logical Operators
5.9 Define “short circuit” evaluation and write
a sample expression.
5.10 Write the truth tables for OR, AND, and
NOT
5.11 Use deMorgan’s Law to re-write
expressions
5.12 Use truth tables to evaluate logical
expressions
5.13 Develop Boolean logic structures to
control loops
5.14 Write examples of the nested for loop to
create two-dimensional arrays
Unit 6 – Writing Methods
6.1 Define “members of a class”
6.2 Distinguish between and use class and
instance identifiers
6.3 Discuss 4 constructor method rules
6.4 Write “constructor” methods
AP Computer Science I 2013-2014 page 3 of 4

6.5 Discuss and write “void” methods
6.6 Discuss and write “return” methods
6.7 Discuss “scope” and correctly use visibility
modifiers
6.8 Distinguish between “actual” and “formal”
parameter lists
6.9 Discuss and correctly use method
signatures
6.10 Write “toString” methods
6.11 Discuss Method Overloading and tell
when they are used
6.12 Write overloaded methods
UNIT 7 – Arrays
7.1 Define and create arrays
7.2 List the rules that govern array creation
7.3 Compare static and dynamic data structures
7.4 Discuss array exceptions
7.5 Discuss and use “bounds checking”
7.6 Discuss and use “initializer lists”
7.7 Discuss object arrays
7.8 Discuss passing arrays as parameters
7.9 Search an array
7.10 Discuss Big Oh and its implications on
efficiency
7.11 Discuss time and memory efficiency
7.12 Discuss and explain binary searches
7.13 Compare efficiency for basic search and
sort methods
7.14 Create two-dimensional arrays
7.15 Use a “for each” loop to iterate over an
array
UNIT 8 – References and Parameters
8.1 Discuss references
8.2 Define the garbage heap
8.3 Use 3 steps of object instantiation
8.4 Compare parameters – passing by reference
and passing by value
8.5 Discuss interfaces and the Comparable
interface
UNIT 9 – Inheritance, Polymorphism, and Collections
9.1 Use the “super” reference to call the parent
constructor
9.2 Create a recursive “factorial” program
9.3 Discuss how visibility modifiers affect
inheritance
9.4 Compare overriding methods vs.
overloading methods
9.5 Create overriding methods
9.6 Discuss Collections
9.7 Write programs using ArrayLists
UNIT 10 – Abstract classes, Interfaces, Recursion,
Searching and Sorting
10.1 Compare parent class from derived classes
10.2 Create UML inheritance diagrams
10.3 Discuss how visibility modifiers affect
inheritance
10.4 Discuss the use of multiple interfaces and
single inheritance rules
10.5 Compare overriding methods vs.
overloading methods
10.6 Create overriding methods
10.7 Discuss polymorphic references and
“dynamic binding”
AP Case Study – Gridworld will be introduced and
infused into the 2 nd semester.
SIX WEEKS
Units covered
1st 1,2, part of 3
2 nd 3,4, part of 5
3 rd 5,6, part of 7
End of 1 st Semester
4 th 7,8,part of 9
5 th 9,10, Case Study
6 th Practice AP question
Free Response Practice
AP Exam – May 7
Special Topics
AP Computer Science I 2013-2014 page 4 of 4