Computer Science

(Week 1) Big O Notation and Binary Trees
1. Weekend Daily Structure and Expectations
2. Weekend Introduction to Computer Science
3. Weekend Computer Science Testing Environment
4. Monday Big O Notation
5. Monday Big O Practice
6. Tuesday Trees
7. Tuesday Binary Trees
8. Tuesday Binary Search Trees: Part 1
9. Wednesday Binary Search Trees: Part 2
10. Wednesday Binary Search Trees: Part 3
11. Thursday Binary Search Trees: Practice
(Week 2) Graph Theory
1. Monday Graphs
2. Monday Representing Graph Structures With Code
3. Tuesday Building Graphs: Part 1
4. Tuesday Building Graphs: Part 2
5. Wednesday Stacks and Queues
6. Wednesday Depth and Breadth Search Algorithms
7. Thursday Depth First Algorithms
8. Thursday Breadth First Algorithms
9. Thursday Graph Theory: Practice
(Week 3) Bit Manipulation and Hashing
1. Monday ASCII
2. Monday Bits, Bytes, and Binary Numbers
3. Tuesday Manipulating Bits
4. Tuesday Bit Manipulation Practice
5. Wednesday Hash Tables
6. Wednesday Optimizing Hashing Algorithms
7. Thursday Hashes: Practice
(Week 4) Algorithms
1. Monday Algorithms Overview
2. Monday Binary Search Algorithm
3. Tuesday Insertion Sort
4. Tuesday Selection Sort
5. Tuesday Bubble Sort
6. Wednesday Merge Sort
7. Thursday Quicksort
(Week 5) Additional Data Structures and Key Concepts
1. Monday Linked Lists
2. Tuesday Heaps
3. Tuesday Tries
4. Wednesday Memory Basics
5. Thursday Memoization