Intermediate Algorithms
[CORE 6a]
Full Course
课程套餐
课程介绍:
[CORE 6a]是AP级别的课程,侧重于过去AP计算机科学AB考试中出现的内容;AB考试是比目前的A级考试更难的考试。该课程包含除AP计算机科学A级考试之外的知识。包括一些主题,例如如何从引用中构建链表,实现组合数学算法,并实现递归排序算法。这不是一门入门课,学生们将学习新的和有挑战的概念。这门课程的预期学习任务和难度相当于一门100级的大学课程。[CORE 6a]仅限于在线教学。
入班要求:
修过[CORE 5b]或获得导师同意
相关课程
项目示例
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
所有课程时间
- 即将开始的课程 ▼
- 正在进行的课程 ▼
Summer Semester: Twice Per Week
* Student Help Hours Included. See time on the bottom of website.
** KTBYTE可以自行决定更改目前安排的授课老师
Summer Semester: Three Times Per Week
* Student Help Hours Included. See time on the bottom of website.
** KTBYTE可以自行决定更改目前安排的授课老师
Summer Semester: Five Times Per Week
* Student Help Hours Included. See time on the bottom of website.
** KTBYTE可以自行决定更改目前安排的授课老师
这些时间都不合适吗?
* Press the plus button to add more availabilities.