WWWOur Site
BES-teacher resize-web art EHS-teacher resize-web baseball
NEW Masthead Image


Tarleton's Links
icon Math 1
icon Math 1
(SMART Board)
icon Trigonometry
icon Trigonometry
(SMART Board)
icon AP Comp. Science
icon AP Comp. Science
(SMART Board)
icon College Board
icon Supply Lists
icon Graduation

Ms. Vicki Tarleton
Mathematics and Computer Science
excellence
AP Computer Science
Monthly Calendar
Overview of Course
Language: Java

Course Overview: This course is a more disciplined approach than a traditional programming course. The emphasis is placed on procedural and data abstraction, programming methodology, algorithms, and data structures. AP Computer Science is designed to serve as a first course in college level computer science for students with no prior computing experience. Since Java is a large and complex language, the APCS course will cover only a restricted subset of Java. In order to provide a complete exposure to critical computer science topics, this class will include all APCS AB components.

Outline of Topics Covered:
*Binary, octal, and hexadecimal number systems
*HW/SW and high-level programming
*Algorithmic problem solving
*JAVA syntax, semantics, and arithmetic expressions
*Basic applet applications
*Use instance variables and public/private methods and classes
*Boolean short circuit evaluation
*Conditions, logical expressions, selection control structures, and looping
*One-dimensional and multi-dimensional arrays
*Abstract Data Types (including constructors and destructors)
*Modifying existing classes and creating new classes
*Overriding and overloading
*Implement final local and static final class variables
*Understand inheritance hierarchies
*Design and implement subclasses
*Design abstract classes and interfaces
*Conversion to supertypes and casts
*Discuss packages and visibility
*Understand exception concept, common exceptions, and throwing standard checked exceptions
*Use linked lists (including null reference and traversals)
*Create and implement stacks and queues
*Discuss recursive methods
*Implement trees, binary trees, and binary search trees
*Searching and sorting techniques
*Implementing linked lists and binary trees using pointer-based arrays
*Big-O notation for evaluating algorithm efficiency
*Understand large program development (Marine Biology Case Study)

Textbooks: Problem Solving with Java (2nd Edition) Elliot B. Koffman and Ursula Wolz
Data Structures and Other Objects using Java (2nd Edition) Michael Main

Software: JBuilder 7.0 (Borland ) www.borland.com
This software is free and can be downloaded from the above site.
Footer - Left Corner Image Footer - LeftNav Right Border Image