During my time TAing CS 3510 in the Spring of 2022, I created a series of lecture notes for students that were highly detailed written copies of spoken lecture materials. These were well liked by many students, hence I decided to make these notes public for higher education accessability with hopes that future sections of CS 3510 at Georgia Tech (and beyond) would be able to leverage these as additional resources.
The file structure is named accordingly based on the module the lecture was in. The entire structure is printed here:
├── 1 Divide and Conquer
│ ├── 1 Welcome Big O.pdf
│ ├── 2 Intro D&C.pdf
│ ├── 3 Intro Recurrences.pdf
│ ├── 4 Master Theorem.pdf
│ ├── 5 Modular Arithmetic.pdf
│ └── 6 RSA.pdf
├── 2 Dynamic Programming
│ ├── 1 Intro Dynamic Programming.pdf
│ ├── 2 Longest Increasing Subsequence.pdf
│ ├── 3 Longest Common Subsequence.pdf
│ ├── 4 Knapsack.pdf
│ └── 5 Chain Matrix Multiplication.pdf
├── 3 Graphs
│ ├── 1 Intro Graphs.pdf
│ ├── 2 Strongly Connected Components.pdf
│ ├── 3 BFS and Dijkstra.pdf
│ ├── 4 Minimum Spanning Trees.pdf
│ └── 5 Bellman Ford Floyd Warshall.pdf
├── 4 Complexity Theory
│ ├── 1 Intro Complexity.pdf
│ ├── 2 SAT Problem.pdf
│ ├── 3 Hamiltonian Path.pdf
│ ├── 4 Subset Sum.pdf
│ ├── 5 Graph Coloring.pdf
│ └── 6 Fast Fourier Transform.pdf
├── Exams
│ └── Exam1A.pdf
├── Homework
│ ├── Homework 1A Solutions.pdf
│ ├── Homework 1B Solutions.pdf
│ ├── Homework 1C Solutions.pdf
│ ├── Homework 2A Solutions.pdf
│ ├── Homework 3A Solutions.pdf
│ ├── Homework 4A Solutions.pdf
│ └── Homework 4B Solutions.pdf
└── README.md
6 directories, 31 files
There may be typos or errors in these lecture notes. This, as most online resources, should not be treated as a single source of truth and should rather be an additional resource used in parallel with textbooks, lectures, homeworks, etc.