Any Future Plans are Tentative

Part I: C++

• Class 1: Hello C++. CLI, Headers, Variables, Functions, our world.
• Class 2: Bit by Bit Integers. Learning the integer types, bit manipulation (XOR, AND, OR, SHIFTING, FLIPPPING), encoding information into bits, "bit masking".
• Class 3: Generate a Random Prime (fizzbuzz, random numbers, header files, breaking up a large task, prime detection)
• Class 4: Dealing with Memory (pointers, dereferencing, aliases, address of (int *x vs *x + 2 vs int &x vs &x), allocating memory (new/delete vs malloc/free), address arithmetic and arrays)
• Class 5: Classes, Structs, Templates
• Class 6: Loose Ends and a DIY string class (practice project)
• Class 7: Project 1 specification clarification, Basic Complexity Theory, Timing Samples, Debugging Advice
• Class 8: Makefiles, Templates, Headers for classes
• March 15th: Another Practice Test

Part 2: Learn how to build the STL

• Class 9: Abstract Data Types, Linked Lists, Basic Complexity
• Class 10: Insertion Sort as intro to sorting and practical complexity
• Class 11: High level intro to Hash Tables (Implementing SET on limited key space, extending to larger key space by using a hash algorithm, dealing with two keys that hash to the same value)
• Class 12: Industry ready hash functions, Murmur, FNV, Linear Probing, Chaining
• Class 13: Bloom Filters as a different use of hash functions and probabilistic algorithm play
• Class 14: Stacks and Queues
• Class 15: Ton of ADTs (Heaps, Double ended queues etc)
• Class 16: Practice Test 2

Part 3: Trees, BSTs, and more

• Class 17: Binary Search Tree introduction
• Class 18: BST continued
• Class 19: Prefix trees / Tries / Radix Trees
• Class 20: Balancing Binary Search Trees
• Class 21: 234 Trees
• Class 22: Practice Finals and Red Black Trees