Classes

Phylogeny Problem
Course Structure and Expectations
Evaluating Algorithms

Predicting Program Properties
Orders of Growth
O and Ω Notation

Class 3: Levels of Abstraction [PPT, PDF]

Θ and little-o
Levels of Abstraction
List Datatype

Dynamic Programming
Needleman-Wunsch Algorithm
Introducting Trees

Class 5: Logs and Trees [PPT, PDF]

Public Key Cryptography
Fast Exponentiation
Tree Traversal
PS1 and CS216 Grading Scheme

Class 6: Ordered Data Abstractions [PPT, PDF]

Dictionary Data Abstraction
Binary Search
Ordered Binary Tree

Greedy Algorithms
Interval Scheduling
Subset Sum

Complexity Classes
P vs. NP
NP-Completeness
NP-Complete Problems

Why hard problems are useful?
Knapsack Ciphers
Thought and Abstraction
Introduction to C

Bounds checking
Rvalues and Lvalues
Pointers
Python's List implementation

Memory Management
malloc
free
Resizing lists

Class 13: Huffman Codes [Chalk]

Class 14: Optimality of Huffman Codes [Chalk]

Class 15: Compression [PPT, PDF] (slides not used in class)

Class 16: Numbers [PPT, PDF]

Class 17: 0xCAFEBABE (Virtual Machines) [PPT, PDF]

Class 18: Code Safety [PPT, PDF]

Class 19: Java Security [PPT, PDF]

Class 20: Hair-Dryer attacks and Introducing x86 [PPT, PDF]

Class 21: Calling Conventions [PPT, PDF]

Class 22: Unconventional Calling [PPT, PDF]

Class 23: Faster Dictionaries [PDF, PDF]