CS201: Resources | Saylor Academy

Topic	Name	Description
	Course Syllabus

© Saylor Academy 2010-2026 except as otherwise noted. Excluding course final exams, content authored by Saylor Academy is available under a Creative Commons Attribution 3.0 Unported license. Third-party materials are the copyright of their respective owners and shared under various licenses. See detailed licensing information. Saylor Academy®, Saylor.org®, and Harnessing Technology to Make Education Free® are trade names of the Constitution Foundation, a 501(c)(3) organization through which our educational activities are conducted.

Course Introduction

Course Syllabus

Unit 1: Algorithm Efficiency

1.1: The Importance of Algorithm Efficiency

1.2: The Realities of "Efficiency"

Unit 1 Assessment

Unit 2: Abstract Data Types and Arrays in C++

2.1: Abstract Data Types

2.2: Implementation of Abstract Data Types

2.3: Linked Lists

2.4: Arrays

Unit 2 Assessment

Unit 3: Pointers and References in C++

3.1: Native Variables in C

3.2: Direct References to Memory

Unit 3 Assessment

Unit 4: Dynamic Memory Allocation

4.1: C++ Memory Allocation

4.2: C Memory Allocation

4.3: Memory Fragmentation

Unit 4 Assessment

Unit 5: Introduction to Stacks and Queues

5.1: Lists

5.2: Stacks

5.3: Queues

Unit 5 Assessment

Unit 6: Linked Stacks, Queues, and Lists

6.1: Linked Lists

6.2: Linked Stacks

6.3: Linked Queues

Unit 6 Assessment

Unit 7: Searching and Sorting Algorithms

7.1: Searching through Data

7.2: Sorting Data

7.3: Big-O Analysis of Merge and Insertion Sort

Unit 7 Assessment

Unit 8: Hash Tables, Graphs, and Trees

8.1: Hash Tables

8.2: Graph Basics

8.3: Paths and Traversal

8.4: Minimum Spanning Trees

Unit 8 Assessment

Study Guide

Certificate Final Exam

Course Feedback Survey