-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathindex.html
40 lines (25 loc) · 1.67 KB
/
index.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
<!DOCTYPE html>
<html>
<head>
<title>CS 3511: Algorithms Honors, Spring 2018</title>
</head>
<body>
<h1>CS 3511: Algorithms Honors, Spring 2018</h1>
This repository contains homeworks I created and curated as Head TA for CS 3511,
an undergraduate honors class on Algorithms at Georgia Tech, during Spring 2018.<br>
If you're an instructor or a TA of an algorithms class, feel free to use them
for your classes! I only ask that you don't create a public repository of your
solutions to these homeworks, in order to make this repository an effective
teaching resource. If you'd like to know the solutions to any of the problems,
please contact me.
<h3>Organization of Topics</h3>
<a href="./hw1.pdf" target="_blank">Homework 1</a>: Time-complexity, Master Theorem, proof techniques, basic modular arithmetic <br>
<a href="./hw2.pdf" target="_blank">Homework 2</a>: Sorting, divide-and-conquer on one or more arrays <br>
<a href="./hw3.pdf" target="_blank">Homework 3</a>: Divide-and-conquer on finite and infinite sequences and graphs <br>
<a href="./hw4.pdf" target="_blank">Homework 4</a>: Depth and breadth-first search for shortest paths, paths with constraints, connected components <br>
<a href="./hw5.pdf" target="_blank">Homework 5</a>: Strong connectivity, search with memoization on graphs, Bellman-Ford <br>
<a href="./hw6.pdf" target="_blank">Homework 6</a>: Minimum spanning tree, greedy and dynamic programming on sequences <br>
<a href="./hw7.pdf" target="_blank">Homework 7</a>: Greedy and dynamic programming on graphs, max-flow min-cut theorem, intro to LP-duality <br>
<a href="./hw8.pdf" target="_blank">Homework 8</a>: Proving NP-completeness using reduction <br>
</body>
</html>