KTBYTE Computer Science Academy >> Classes >>


Intermediate Algorithms

Class Description:

CS02a is our AP level course that focuses on content that appeared on the past AP Computer Science AB exam; a more difficult test than the current A exam. This is in addition to AP CS-A exam material. This includes topics such as how to build linked lists out of references, implement combinatorics algorithms, and implement recursive sorting algorithms. This is not a prep course, and students will be learning new and challenging concepts. The expected workload and difficulty of this course is equivalent to a 100-level college course. CS02a is taught online only.

Online Class Icon
This is an Online Class

CS01b or permission of instructor

Class Features:

Weekly Problem Sets


Our homework is done online
Virtual Machine (VM)

Included for Online Classes

A Virtual Machine is a remote desktop that allows students to connect to it from anywhere. We provide VMs so that students use it during classes and to work on homework.
Student Support:
Office Hours with
Teacher's Assistants

Office hours are led by our highly qualified teaching assistants. It is an easy and free way to get immediate feeback on your code. Our homework is difficult - office hours can help you overcome obstacles and develop a stronger understanding of the material!
Audio Lectures

We provide pre-recorded Audio Lectures to allow for students to self-study, practice, and learn CS.
Online Textbook

We provide a online, interactive, Java & Algorithms textbook to allow for students to self-study, practice, and learn CS.
Class Recordings

We provide recordings of our classes for if a student misses or needs to re-listen to a class.
Parent Support:
Student Progress Report

The parent account dashboard allows for parents to track their student's progress in the class.

Double Pendulum Simulation: Mathimatically named "Chaos".

Centipede: When shot, the circles on the centipede turns into squares, which becomes barriers.

Fern Stepped: A demo of the topic Recursions.

Mine Sweeper:Demo of the Algorithm: Flood Fill

Gradient Fill: Demo of the Algorithm: Flood Fill. The red dots define certain areas, so when it floods, those areas become the starting points for the color flood.

Merge Sort Algorithm Demo: The rectangles are sorted by height using the algorithm.

Linked List: Demo of data structure called Link List

Electric Tree: Graph Search Demo The further away from the root, the greater the color shift.

Online Class Options:

Fall Semester
18 weekly lessons
Thu Sep 6 - Jan 24
Thu 5:20-6:20 pm ET
View Price/Enroll
Fall Semester
18 weekly lessons
Sat Sep 8 - Jan 26
Sat 5:20-6:20 pm ET
View Price/Enroll