Class Projects
Students will build, test, and publish their own game in KTBlocks
CODING PLATFORM
The KTCoder all-in-one coding platform supports our interactive online classes, our specialized curriculum, and our students’ passion for learning.
STUDENT HELP HOURS
Help hours are led by our highly qualified teaching assistants. It is an easy and free way to get immediate feedback on your code.
PROGRESS REPORTS
KTBYTE will e-mail parents with behavior and grade progess reports.
COMPLETION CERTIFICATES
Students can request a certificate of completion once they finish each course.
Class Description:
This class provides online training for the USA Computing Olympiad (USACO) Gold Division, a programming competition looked at by universities and used as a qualifier for the International Olympiad in Informatics (IOI). Classes will be held online or in-person, and during each lesson students will work on challenging sample problems with the help of their instructor. Then, students attempt a problem set for homework on the same topic covered in class, and are able to receive help during student help hours.
The goal of this course is to prepare students to score well on USACO's Gold Divison and help them advance to the Platinum Division. This class covers advanced problems, building on algorithms from Bronze and Silver level, but also requires knowledge of other advanced programming concepts like dynamic programming. Topics covered include graph search, dynamic programming, and greedy algorithms. An example problem might have the student find the fastest path through all cows, given a list of cows, their coordinates, and their movement patterns. It's important for students to practice USACO problems for about 3 hours per week, including homework and review, in order to do well on the contest.
View Example Problem View USACO FAQ
Prerequisites
Instructor approval. Prior completion of USACO Silver or equivalent recommended. [CORE 6a] recommended.
Class Description:
This class provides online training for the USA Computing Olympiad (USACO) Gold Division, a programming competition looked at by universities and used as a qualifier for the International Olympiad in Informatics (IOI). Classes will be held online or in-person, and during each lesson students will work on challenging sample problems with the help of their instructor. Then, students attempt a problem set for homework on the same topic covered in class, and are able to receive help during student help hours.
The goal of this course is to prepare students to score well on USACO's Gold Divison and help them advance to the Platinum Division. This class covers advanced problems, building on algorithms from Bronze and Silver level, but also requires knowledge of other advanced programming concepts like dynamic programming. Topics covered include graph search, dynamic programming, and greedy algorithms. An example problem might have the student find the fastest path through all cows, given a list of cows, their coordinates, and their movement patterns. It's important for students to practice USACO problems for about 3 hours per week, including homework and review, in order to do well on the contest.
View Example Problem View USACO FAQ
Prerequisites:
Instructor approval. Prior completion of USACO Silver or equivalent recommended. [CORE 6a] recommended.
Related Classes
Syllabus:
Graph Search 1
HashSet and TreeSet
Sliding Window
Combinatorics
Dynamic Programing
Greedy Algorithms, Priority Queues
Union-Find Data Structure and Minimal Spanning Tree
Binary Search; O(log(n)) Algorithms
Graph Search 2
Problem Review
Dynamic Programming 2
Odds and Ends
Binary Index Tree
Proving Correctness (by Contradiction)
Plane Sweep (TreeSets 2)
Greedy Algorithms 2
Dynamic Programing 3
Bonus Content - TBD
Syllabus
Graph Search 1
HashSet and TreeSet
Sliding Window
Combinatorics
Dynamic Programing
Greedy Algorithms, Priority Queues
Union-Find Data Structure and Minimal Spanning Tree
Binary Search; O(log(n)) Algorithms
Graph Search 2
Problem Review
Dynamic Programming 2
Odds and Ends
Binary Index Tree
Proving Correctness (by Contradiction)
Plane Sweep (TreeSets 2)
Greedy Algorithms 2
Dynamic Programing 3
Bonus Content - TBD