CS201: Resources | Saylor Academy

© Saylor Academy 2010-2024 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.

Topic	Name	Description
	Course Syllabus
	Course Terms of Use

Course Introduction

Course Syllabus

Course Terms of Use

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

1.1: Abstract Data Types

1.2: Contiguous Implementation

1.3: Non-Contiguous Implementation

1.4: Introduction to Memory Pointers

1.5: Linked Lists

1.6: Arrays

Unit 1 Assessment

Unit 2: Introduction to Stacks and Queues

2.1: Introduction to Lists

2.2: Implementing Lists with Arrays

2.3: Overview of Stacks and Queues

2.3.1: Introduction to Stacks

2.3.2: Introduction to Queues

Unit 2 Assessment

Unit 3: Pointers and References in C++

3.1: Review of C-Native Variables

3.2: Review of Pointers

3.3: Pointing to Memory

3.4: Pointers for Scalars, Vectors, and Functions

3.5: Pointers for Arrays

3.6: Pointer Arithmetic

3.7: Working with Pointers

Unit 3 Assessment

Unit 4: Dynamic Memory Allocation

4.1: C++ Memory Allocation

4.2: C Memory Allocation

4.3: Memory Fragmentation

4.4: C/C++ Based on "Unsafe" Types

Unit 4 Assessment

Unit 5: Linked Stacks, Queues, and Lists

5.1: Linked Lists

5.2: Linked Stacks

5.3: Linked Queues

Unit 5 Assessment

Unit 6: Algorithm Efficiency

6.1: The Importance of Algorithm Efficiency

6.2: Big-O Analysis

6.3: Discussions on Algorithm Efficiency

6.4: Measuring Algorithm Efficiency

6.5: Space-Time Tradeoff

Unit 6 Assessment

Unit 7: Searching and Sorting Algorithms

7.1: Peak Finding via Vector Search

7.2: Models of Computation and Document Distance

7.3: Why Sort? Insertion Sort and Merge Sort

7.3.1: Big-O Analysis of Merge and Insertion Sort

7.3.2: Merge and Insertion Sort in C/C++

7.4: Linear Search

7.5: Fibonacci Search

7.6: Binary Search, Bubble Sort, and Selection Sorts

7.7: Quicksort

Unit 7 Assessment

Unit 8: Hash Tables, Graphs, and Trees

8.1: Hash Tables

8.2: Graphs

8.2.1: Graph Searches

8.2.2: Finding Lowest-Cost Paths

8.2.3: Finding a Minimum Spanning Tree

8.3: Trees

Unit 8 Assessment

Study Guide

Course Feedback Survey

Certificate Final Exam

Proctor-Verified Final Exam

Archived Materials