Syllabus

This page summarises the links to all notes that are relevant to 10.020. Please read them carefully by the weeks stipulated. You will learn each of the big topics above in the following weeks:

Week 01: Python Revision and Sorting Algorithm

• Bubble Sort
• Insertion Sort

Week 02: Analysing Programs

• Binary Heap
• Heapsort
• Analysing Computation Time

Week 03: Divide and Conquer

• Divide and Conquer
• Merge Sort

Week 04: Object-Oriented Paradigm

• Object Oriented Programming
• Linear Data Structures

Week 05: Inheritance and Introduction to Graph

• Computation as Object
• Inheritance
• Optional: Abstract Base Class
• Optional: Fixed-Size Array and Linked List

Week 06: Graph Traversal

• Introduction to Graph
• Breadth First Search and
• Depth First Search

Week 08: Design of State Machines

• State Machine
• SM Abstract Class
• State Space Search

Week 09: Visualizing and Processing Data

• Working With Data
• NumPy Array
• Creating Plots using Matplotlib and Seaborn

Week 10: Modeling Continuous Data

• Linear Regression
• Multiple Linear Regression

Week 11: Classifying Categorical Data

• Logistic Regression
• Confusion Matrix and Metrics

Contributors

These notes and problem sets were prepared by Oka Kurniawan, Zachary Teo Wei Jie, and Amanda Kosim.