GitHub - AC01010/F23-CS-3510-Lecture-Notes: CS 3510 Lecture Notes, Fall 2023

This repository contains lecture notes that I scribed for Professor Singla's CS 3510 (Design and Analysis of Algorithms) class as a TA.

Name		Name	Last commit message	Last commit date
Latest commit History 3 Commits
Lec 10_ Greedy Scheduling.pdf		Lec 10_ Greedy Scheduling.pdf
Lec 13 Matchings.pdf		Lec 13 Matchings.pdf
Lec 14 Network Flows.pdf		Lec 14 Network Flows.pdf
Lec 15 Dynamic Programming I.pdf		Lec 15 Dynamic Programming I.pdf
Lec 16 Dynamic Programming II.pdf		Lec 16 Dynamic Programming II.pdf
Lec 17 Dynamic Programming III.pdf		Lec 17 Dynamic Programming III.pdf
Lec 19 P vs NP.pdf		Lec 19 P vs NP.pdf
Lec 1_Intro.pdf		Lec 1_Intro.pdf
Lec 20 Introduction to Reductions.pdf		Lec 20 Introduction to Reductions.pdf
Lec 22 k-SAT and Approximate Algorithms.pdf		Lec 22 k-SAT and Approximate Algorithms.pdf
Lec 23 TSP and Approx Knapsack.pdf		Lec 23 TSP and Approx Knapsack.pdf
Lec 24 Max Cut.pdf		Lec 24 Max Cut.pdf
Lec 26 Linear Programming Continued.pdf		Lec 26 Linear Programming Continued.pdf
Lec 27 Randomized Algorithms.pdf		Lec 27 Randomized Algorithms.pdf
Lec 2_Divide and Conquer.pdf		Lec 2_Divide and Conquer.pdf
Lec 3_Multiplication and Median Finding.pdf		Lec 3_Multiplication and Median Finding.pdf
Lec 4 Median Finding Continued and Fast Matrix Multiplication.pdf		Lec 4 Median Finding Continued and Fast Matrix Multiplication.pdf
Lec 5_Inversion Counting.pdf		Lec 5_Inversion Counting.pdf
Lec 6_DFS and SCC.pdf		Lec 6_DFS and SCC.pdf
Lec 7_Topological_Sorting.pdf		Lec 7_Topological_Sorting.pdf
Lec 8_Shortest Path.pdf		Lec 8_Shortest Path.pdf
Lec 9_Minimum Spanning Tree.pdf		Lec 9_Minimum Spanning Tree.pdf
README.md		README.md

Provide feedback