 |  | [Video Lectures] |
 | |  | 9.Graph Algoritms 4 - Intro to Geometric Algorithms.ram (201.17 MB) |
| | | 2.Sorting.ram (200.55 MB) |
| | | 8.Graph Algoritms 3 - Shortest Path.ram (195.23 MB) |
| | | 5.Red-Black Trees.ram (192.11 MB) |
| | | 6.Graph Algorithms 1 - Topological Sorting,Prim's Algorithm.ram (186.53 MB) |
| | | 1.Algorithms-Overview.ram (186.02 MB) |
| | | 18.Np Completeness 4.ram (185.31 MB) |
| | | 11.Dynamic Programming 1 of 2.ram (184.87 MB) |
| | | 13.Parsing.ram (181.32 MB) |
| | | 3.Sorting 2.ram (180.95 MB) |
| | | 4.Searching And Data Structures.ram (180.59 MB) |
| | | 12.Dynamic Programming 2 of 2.ram (176.70 MB) |
| | | 15.Greedy Algs. 2 & Intro to NP Completeness.ram (172.63 MB) |
| | | 19.Approximation Algs..ram (172.43 MB) |
| | | 16.NP Completeness 2 & Reductions.ram (171.08 MB) |
| | | 10.Geometric Algorithms - Graham & Jarvis.ram (170.00 MB) |
| | | 7.Graph Algorithm 2 - DFS,BFS,Kruskal's Algorithm,Union Find Data Structure.ram (168.97 MB) |
| | | 17.Np Completeness 3 - More Reductions.ram (165.89 MB) |
| | | 20.Alternate Models Of Computations.ram (164.77 MB) |
|  | | 14.Knapsack,Bandwidth Min. Intro - Greedy Algs.ram (141.62 MB) |
| | [Problem Sets] |
| | | [Problem Set 1] |
| | |  | Problem Set 1 Solutions.pdf (1.21 MB) |
| | | | Problem_Set_01.pdf (7.10 KB) |
| | | [Problem Set 6] |
| | | | Problem Set 6_ NP-Complete Reductions.pdf (1.08 MB) |
| | | | Problem_Set_06.pdf (5.11 KB) |
| | | [Problem Set 2] |
| | | | Problem_Set_02_Solutions.pdf (84.10 KB) |
| | | | Problem_Set_02.pdf (5.24 KB) |
| | | | Problem_Set_02_Solutions.tex (3.91 KB) |
| |  | 2_1a.eps (53.84 KB) |
| | | [Problem Set 5] |
| | | | Problem_Set_05_Solutions.dvi (48.39 KB) |
| | | | Problem_Set_05_Solutions.tex (8.24 KB) |
| | | | Problem_Set_05.pdf (6.25 KB) |
| | | 2_2c.eps (16.08 KB) |
| | | [Problem Set 3] |
| | | | Problem_Set_03.pdf (15.60 KB) |
| | |  | Problem_Set_03_Solutions_Code.tar.gz (6.42 KB) |
| | | [Problem Set 4] |
| | | | Problem_Set_04.pdf (14.08 KB) |
| | | | Problem_Set_04_Solutions_Code.tar.gz (3.52 KB) |
| | | 2_1b.eps (13.29 KB) |
| | | 2_2b.eps (11.26 KB) |
| |  | fig5.gif (9.14 KB) |
| | | 2_2a.eps (5.35 KB) |
| | | fig2.gif (2.41 KB) |
| | | fig3.gif (2.14 KB) |
| | | fig4.gif (1.69 KB) |
| | | fig1.gif (0.97 KB) |
|  | Algorithms - Lectures and Courseware.png (303.18 KB) |
| | Contents - Algorithms.png (183.07 KB) |
| | [Lecture Notes] |
| | | lecture_notes1.pdf (84.50 KB) |
| | | lecture_notes2.pdf (30.32 KB) |
| | [Handouts] |
| | | [Reciation_01] |
| | |  | Trees.htm (18.94 KB) |
| | | | [Trees_files] |
| |  | | | style.css (5.00 KB) |
| | | [Reciation_05] |
| | | | Rubik's Cube.htm (13.04 KB) |
| | | | [Rubik's Cube_files] |
| | | | | style.css (5.00 KB) |
| | | [Reciation_03] |
| | | | Second Attempt O(n).htm (9.36 KB) |
| | | | [Second Attempt O(n)_files] |
| | | | | style.css (5.00 KB) |
| | | [Reciation_02] |
| | | | Abstract and Concrete Datatypes.htm (9.03 KB) |
| | | | [Abstract and Concrete Datatypes_files] |
| | | | | style.css (5.00 KB) |
| | | [Reciation_07] |
| | | | Floyd-Warshall (ADU Feb 15).htm (8.43 KB) |
| | | | [Floyd-Warshall (ADU Feb 15)_files] |
| | | | | style.css (5.00 KB) |
| | | [Reciation_09] |
| | | | The Ford-Fulkerson Algorithm in C.htm (5.12 KB) |
| | | | [The Ford-Fulkerson Algorithm in C_files] |
| | | | | style.css (5.00 KB) |
| | | [Reciation_10] |
| | | | [Knight Tour_files] |
| | | | | style.css (5.00 KB) |
| | | | Knight Tour.htm (2.07 KB) |
| | | [Reciation_04] |
| | | | [Breadth-First Search_files] |
| | | | | style.css (5.00 KB) |
| | | | Breadth-First Search.htm (3.78 KB) |
| | | [Reciation_06] |
| | | | [Developing a Dynamic Programming algorithm_files] |
| | | | | style.css (5.00 KB) |
| | | | Developing a Dynamic Programming algorithm.htm (2.76 KB) |
| | | [Reciation_08] |
| | | | [Preventing an Array-Index-Out-Of-Bound Error_files] |
| | | | | style.css (5.00 KB) |
| | | | Preventing an Array-Index-Out-Of-Bound Error.htm (4.83 KB) |
| | | General_Info.pdf (2.75 KB) |
| |  | useful-links.txt (0.92 KB) |
| | Syllabus.pdf (7.31 KB) |
