Chapter 1

Python Review

Chapter 2

Algorithm

Analysis

Python Classes and Intro. to Big-oh

Big-oh Practice and Big-oh of Python List and Dictionary methods

Chapter 3

Basic

Data

Structures

and

Section 6.6

Stack Implementations

FIFO Queue Implementations

Deque Implementation and Intro. to Binary Heap

Ch. 6.6: Priority Queue: Binary Heap Implementation

Unordered Lists implementation

Chapter 4

Recursion

Intro. to Recursion

Fibonacci and Coin-change Problems; Dynamic Programming

Coin-change Dynamic Programming; Intro. to Searching

Chapter 5

Search and

Sorting

Intro. to Hashing

Dictionary Implementations

Simple Sorts: Selection and Bubble sorts

Insertion Sort, and Advanced Sorts

Chapter 6

Trees

Intro. to Trees

Binary Search Tree (BST)

BST Delete

AVL Trees

Chapter 7

Graphs

Graph terminology, traversals (BFS and DFS)

Topological Sort and Dijkstra's Algorithm for Shortest-paths

Prim's Algorithm

Traveling Salesperson Algorithm (TSP)

Traveling Salesperson Approximation Algorithm