Computer Science Electives
The typical computer science sequence is given below. To enroll in Intro Java, a student must have successfully completed Algebra 1. An interview and/or placement test will be used to determine atypical placement.
| Intro Java => | Advanced Java => | AP Computer Science AB => | Java Projects |
Course Topics
| Intro Java | Advanced Java | AP Computer Science AB | Java Projects |
|---|---|---|---|
| Prerequisite: Successful completion of Algebra 1 | Prerequisite: C+ or better in Intro Java | Prerequisite: Successful completion of Advanced Java or permission of the instructor | Prerequisite: C- or better in AP CS AB |
| Reading and research on history on programming languages | Review of Intro Vocabulary and ideas | Object Oriented Program Design Specifics; Decomposition; Appropriate Choices; Breadth of choices | Try/Catch/Finally worksheet Sample Code Analysis Brainstorming for major project |
| First programs: Hello World, Temperature Conversion, Turtle Graphics Exploring the compiler Debugging 3-6 programs |
Extended if-else structure Nested for loops Nest while loops Debugging complex loops 4-8 programs |
Programming Implementation Methodology Constructs |
Creating Threads, Synchronization, and Control Sample Code Analysis Program fragments I and II designed |
| "If-else" worksheet "While" worksheet "For" worksheet 6-8 programs More on Debugging |
Inheritance Abstract Classes Interfaces Polymorphism 4-6 programs |
Program Analysis Testing Debugging; Error Handling Modification; Extension Analysis of Algorithms (Big-Oh) |
Sockets and exchange of information Sample Code Analysis Program fragment III designed |
| Purpose Discussion Syntax discussion Var. scope worksheet Accessor and mutator methods Method overloading 6-8 programs |
Array List Usage Worksheet Array List vs Arrays comparison Sorting and Searching Arrays 6-8 programs |
Data Structures Simple Classes Arrays (1D, 2D, Linked Lists, Stacks, Queues, Trees, Heaps, Priority Queues, Sets, Maps |
Creating, saving, and retrieving information from a file in Java Sample Code Analysis Program fragment IV design |
| Baseball Player Class Analysis Encapsulation Information Hiding Constructors Method calling 2-4 programs |
Designing a GUI using BreezySwing 4-6 programs |
Standard Algorithms Operations: traversals, insertions, deletions, iterations Searching: Sequential Binary, Hashing Sorting: Selection, Insertiona, Mergesort, Quicksort, Heapsort |
Students work individually/collaboratively on final project. Essay accompanies code, describing software development process, team contributions, and specific computer science ideas grasped |
| Arrays worksheet 3-4 programs |
Computing In Context Hardware components System software Types & use of systems |