What is Computer Science 2?
This course picks up where CS1 leaves off. We start with an OOP review and move through all Java Collections. This course will cover all of the topics formerly covered in the AP AB CS course plus some additional topics. At the end of this course, the students will have covered the same topics typically covered in a college level CS2 course. The topic list below shows the topics typically covered. This materials is great for dual credit and independent study courses.
A+ CS2 material approved for use with UW dual credit program.
UW
Dual Credit Information
DOWNLOAD AP COMPUTER
SCIENCE AB SYLLABI - AP audit
approved
COMPUTER SCIENCE 2 |
|||
| Topic |
Labs / Descriptions |
Start |
Slides |
| Basic Review | Matrices AP Computer Science GridWorld Case Study |
||
| OOP Rev Programs | Roman Numerals / Comparable | ||
|
Inheritance Interfaces |
AP Computer Science
GridWorld Case Study -
Bug / Actor lab02 Pong --interfaces and inheritance --turn Pong into breakout |
||
| Parameters Review | Matrix Math - 3D [][][] | ||
| ArrayList | Expression Solvers AP Computer Science GridWorld Case Study - Critter |
||
| Iterators | Iterator interface ListIterator interface Enhanced For Loop AP Computer Science GridWorld Case Study - Griderators |
||
|
Interfaces Comparable |
Comparable Labs with
built-in sorts lab06b GradeBook TIC TAC TOE - interfaces / abstract classes / GUI |
||
| Sets | HashSet and TreeSet | ||
| Maps | HashMap and TreeMap
Maps with Comparable Maps with Sets |
||
| Exceptions | Try Catch Finally | ||
| Recursion | Mazes Permutations/Combinations Graphics AP Computer Science GridWorld Case Study Fractals |
||
| Graph Theory | Recursive Connection
Algorithms Uses Maps/Sets Edges - Vertices - Nodes Networks |
||
| Number Systems | Base Conversion the
long way Base Conversion using java methods |
||
| Boolean Algebra | Tic Tac Toe Rock Paper Scissors |
||
| Stacks | Java Stack -
AP 07 topic Postfix Breakers |
||
| Queues | Basics Java LinkedList as a Queue - AP 07 topic Java Queue interface - AP 07 topic |
||
| Priority Queues | Basics Java Queue interface - AP 07 topic |
||
| Linked Lists | Java Create your own Single Double |
||
| Hash Tables | Built with Linked Lists | ||
| Binary Trees | Basic Operations Advanced Operations AP Computer Science GridWorld Case Study |
||
| Heaps | Array implementation Use to make a Priority Queue |
||
| Sorting Searching | Insertion Sort Quick Sort Merge Sort Radix Sort Heap Sort |
||
| Big O | Sort Timing | ||
| Case Study Project | AP Computer Science GridWorld Case Study | ||
| Abstract Classes / Inheritance | BlackJack - text and
graphics --Abstract
Classes --Inheritance --Graphics with Images - final handout |
||
| OOP Project | StarFighter Game -
graphics --expand into Space Invaders Abstract Classes/Interfaces/Inheritance |
||
| AP review labs | Review Labs | ||
All materials listed on this site were created using Java 5.0, but will work with past versions of Java as well.
If
you have questions or comments, please send me an email at
stacey.armstrong@apluscompsci.com
author
information


