AP Java is our most advanced Java course, designed for responsible learners looking to challenge themselves. AP Java is an accelerated course that covers everything in Java levels 1 to 3 and more, up to a university level understanding. Students will apply the skills they learn to practice problems, creating their own programs, and creating their own games. By the end of this course, students will be prepared to take the Advanced Placement Computer Science exam, which may qualify them for credits at post-secondary institutions.

Book A FREE Trial

Advanced Students: This course is for students who have completed Java Level 2. This course is also for students preparing for the Advanced Placement Computer Science exam.

This course typically takes 3-6 months to complete. This depends on the student's experience and how fast they can master the concepts and the knowledge. Our instructors move at the pace of the student, it may take extra time for some students to reinforce what they have learned.

Review 1 will focus on the different variable types and identifiers. Students will review how to modify them, perform operations, and format output.

Students will be run through a series of practice problems and will be given the opportunity to ask questions. Additionally, students will be shown commonly made mistakes in order to avoid them.

Review 2 will go through conditionals and iterative loops. Students will review how to efficiently use them and avoid errors.

Students will be run through a series of practice problems and will be given the opportunity to ask questions. Additionally, students will be shown commonly made mistakes in order to avoid them.

Review 3 will review the different types of errors and how to handle them. Students will be shown different errors and will be asked the type of error and how to handle/avoid them.

Students will be run through a series of practice problems and will be given the opportunity to ask questions. Additionally, students will be shown commonly made mistakes in order to avoid them.

Review 4 goes through all concepts surrounding Classes. This includes objects, polymorphism, inheritance, and the Java standard classes.

Review 5 will cover proper program design and analysis techniques.

Review 6 covers Arrays, Lists, and ArrayLists. Students will be reminded how to use them and how they work in memory.

Review 7 covers recursive loops. Students will be reminded of how to use recursion, and identify strategies for efficiently creating them.

Review 8 covers the different searching and sorting algorithms. Students will be reminded of the time complexity of each algorithm and when to use which.

Review 9 is a final review of all concepts needed for the AP Computer Science exam. Students will be taken through a cumulative review.

Students will be taken through a final mock exam and ensure that they are fully prepared for the final exam.

Book A FREE Trial

AGES 10 - 15

This course is designed to build the basics of a **complicated mathematical field**. It is designed to be a complete introduction to the fundamental concepts of** number theory** for students in grades 7-10.

The class covers topics such as **primes** and **composites**; **multiples**, **divisors**, and **divisibility**; **prime factorization** and its uses; **modular arithmetic** and more.

Learn more →

AGES 10 - 15

Students in grades 6-10 will build a solid understanding of **more advanced geometry** concepts in this course. It is designed to expand on the **standard high school geometry curriculum** and to challenge students with new concepts and problems.

Topics include **congruent** and **similar triangles**, **circles**, **3D geometry**, and** introductory trigonometry**.

Learn more →

AGES 10 - 15

To build on the concepts from the Introduction level course, students will build on their **Counting and Probability** knowledge.

A thorough introduction for students in grades 7-10 to counting and probability topics such as **permutations**, **combinations**, **Pascal's triangle**, **geometric probability**, **basic combinatorial identities**, **the Binomial Theorem**, **Pigeonhole Principle Conditional**, **Probability Graph Theory** and more.

Learn more →