Introduction to Computer Science and Programming (Spring 2011) (M-I-T)

Optional Recitation: Algorithm Complexity and Class Review (M-I-T)

Lecture 8: Efficiency and Order of Growth (M-I-T)

Quiz 2 Review Session (M-I-T)

Recitation 10: Introduction to Dynamic Programming (M-I-T)

Recitation 1: Introduction to Coding Concepts (M-I-T)

Recitation 2: Loops, Tuples, Strings, and Functions (M-I-T)

Recitation 3: Lists and their Elements, Sorting, and Recursion (M-I-T)

Recitation 4: Recursion, Pseudo code, and Debugging (M-I-T)

Recitation 5: Quiz 1 Answers and Object-Oriented Programming (M-I-T)

Recitation 6: Probability and Statistics (M-I-T)

Recitation 7: Distributions, Monte Carlo, and Regressions (M-I-T)

Recitation 8: Hierarchical and k-means Clustering (M-I-T)

Recitation 9: Directed and Undirected Node Graphs (M-I-T)