suggested for ages 14-18
In this course, students briefly review Java fundamentals and focus on advanced topics in Java: recursion, searching and sorting algorithms, big-O notation, and advanced data structures. The data structures discussed include linked lists, stacks, queues, priority queues, maps, trees, and graphs.
This course goes beyond the scope of AP Computer Science A and covers material typically seen in a college-level data structures and algorithms course in Java. Students who excel in this course have a strong math background (Algebra 2 or higher recommended).
This course typically takes 3-6 months to complete. This depends on the student's dedication to homework, their previous experience, and the difficulty of course material. Our instructors move at the pace of the student, taking extra time to reinforce concepts as needed.
AJ1 Review: Variables, Strings, and Input
AJ2 Review: Arrays and ArrayLists
AJ3 Review: Java Objects and Classes
AJ5 Linear Search and Big-O Notation
AJ6 Binary Search
AJ7 Selection and Insertion Sort
AJ8 Bubble Sort
AJ9 Merge Sort
AJ10 Sustainable Programming
AJ11 Linked Lists
AJ12 Stacks and Queues
AJ13 Priority Queues and Maps
AJ14 Binary Search Trees
AJ15 Hash Tables
AJ17 Master Project: Google Maps