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: Searching Data

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

Week 06: Inheritance and Object-Oriented Design

• Inheritance and Abstract Base Class
• Fixed-Size Array and Linked List

Week 08: Visualizing and Processing Data

• Working With Data
• Creating Plots using Matplotlib and Seaborn

Week 09: Modeling Continuous Data

• Linear Regression
• Multiple Linear Regression

Week 10: Classifying Categorical Data

• Logistic Regression
• Confusion Matrix and Metrics

Week 12: Design of State Machines

• State Machine
• SM Abstract Class
• State Space Search

Contributors

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