Michelle |

AnD Materials

Algorithms & Data Structures

This page contains the slides, notes, and code demos from my previous sessions as a Teaching Assistant for AnD.

Weekly Sessions

Week 1: Introduction & Induction

Induction, Asymptotic notation, Runtime basics, log-rules

Slides Notes

Week 2: O-Notation

O, Omega, Theta Notation, Summation Rules

Slides Notes

Week 3: One Problem - Many Solutions

Maximum Subarray Sum

Slides Notes

Week 4: Searching & Sorting

Linear-, Binary-search & Sort variations

Slides Notes

Week 5: Sorting Cont'd & Datastructures

Quick- & Heap-sort, Lists, Arrays, Stacks, Queues

Slides Notes

Week 6: Abstract Datatypes, Dynamic Programming I

Binary Trees, 2-3-Trees, MSS, Jump Game, LCS, Edit Distance

Slides Notes

Week 7: Dynamic Programming II

Subset Sum, Knapsack, LAS

Slides Notes

Week 8: Introduction to Graphs

Notation, Eulerian Walks, Hamiltonian Cycles

Slides Notes

Week 9: Graph Traversal

Directed Graphs, Topological sorting, DFS

Week 10: Shortest Paths I

BFS, Dijkstra

Slides

Week 11: Shortest Paths II, MSTs I

Bellman Ford, Boruvka, Prim

Slides

Week 12: MSTs II, Semester Recap I

Kruskal

Slides

Week 13: All-to-All Shortest Path, Semester Recap II

Floyd-Warshall, Johnson

Slides

Script & Additional Material

Script (as of Week 7) ANKI Deck: Runtimes CODE: Searching & Sorting CODE: Linked List Demo ANIMATION: 2-3-Trees