Intermediate Algorithms
[CORE 6a]
Full Course
Class Package
Class Description:
[CORE 6a] teaches algorithms and data structures using Java in a lecture format. Students complete weekly graded homework assignments and monthly quizzes. Most students find it helpful to attend our student help hours for support learning these advanced concepts. The material is similar to what may be encountered in lower level USACO competitions. After this class, students can choose to enroll in [AI 1], our Intro to Machine Learning course.
Prerequisites:
[CORE 5b] or permission of instructor
Related Classes
Sample Projects
These are examples of projects that students create as they grow their skills in [CORE 6a]
Syllabus
Selection Sort (and intro to Insertion Sort)
Insertion Sort
Binary Search
Merge Sort
Sorting Review
Quiz - Sorting
Recursion
Stacks and Queues
Recursion with Stacks
Floodfill
Recursion and Floodfill Review
More Recursion Review
Quiz - Recursion and Floodfill
Objects and References Review, Linked List Intro
Linked Lists
Linked Lists Algorithms
Games with Linked Lists
Quiz - Linked Lists
All Class Times
- Classes Starting Soon ▼
- Classes in Session ▼
Summer Semester: Twice Per Week
* Student Help Hours Included. See time on the bottom of website.
** Instructors currently scheduled are not guaranteed and could change at KTBYTE's discretion
Summer Semester: Three Times Per Week
* Student Help Hours Included. See time on the bottom of website.
** Instructors currently scheduled are not guaranteed and could change at KTBYTE's discretion
Summer Semester: Five Times Per Week
* Student Help Hours Included. See time on the bottom of website.
** Instructors currently scheduled are not guaranteed and could change at KTBYTE's discretion
These times don't work for you?
* Press the plus button to add more availabilities.