Week |
Dates |
Topic |
Slides |
HW |
01 |
Aug. 25 |
Introduction and Course Administrivia, Algorithmic Analysis |
|
|
Aug. 27 |
Proving Algorithm Correctness using Invariants |
|
02 |
Sep. 01 |
Calculating Instructional Cost, Asymptotic Analysis, Big-O, Big-Omega |
|
|
Sep. 03 |
Performance Comparison with L'Hospita's Rule, Limit rules review |
|
|
03 |
Sep. 08 |
Greedy Strategy: Minimum Spanning Tree, Single-Source Shortest Path |
|
Sep. 10 |
Huffman Codes |
|
04 |
Sep. 15 |
Greedy Strategy Correctness and Runtime Analysis: Huffman Codes |
|
Sep. 17 |
MST problem greedy correctness, Fractional Knapsack Problem |
|
05 |
Sep. 22 |
Dijkstra Greedy Correctness |
|
Sep. 24 |
Divide-and-Conquer Strategy: In-Class Problem Solving #2 |
|
|
06 |
Sep. 29 |
Solving Recurrances: Induction Method, Recurrance Trees, Substitution Method, and Master's Method |
|
Oct. 01 |
|
07 |
Oct. 06 |
Strassen's Algorithm, Convex Hull Problem, Quickhull |
|
|
Oct. 08 |
Extra: Jarvis' March, Graham Scan |
|
08 |
Oct. 13 |
midterm exam |
Oct. 15 |
midterm review |
|
|
09 |
Oct. 20 |
Dynamic Programming: In-class Problem Solving Session #3 |
|
Oct. 22 |
Bellman-Ford Algorithm, All-Pairs Shortest Path Problem |
|
|
10 |
Oct. 27 |
Matrix-Chain Multiplication, Longest Common Subsequence |
|
|
Oct. 29 |
0-1 Knapsack Problem |
|
11 |
Nov. 03 |
Network Flow: Max-Flow Min-Cut Theorem, Augmenting Path Approach |
|
|
Nov. 05 |
|
|
12 |
Nov. 10 |
Randomized & Approximation Algorithms |
|
|
Nov. 12 |
|
|
13 |
Nov. 17 |
Algorithmic Intractability: |
|
|
Nov. 19 |
|
|
|
14 |
Nov. 24 |
thanksgiving break |
Nov. 26 |
15 |
Dec. 01 |
Algorithms for Spatial Data (Arabgol) |
Clustering Algorithms for Big Data (Bagga) |
Dec. 03 |
Algorithms for Detection and Elimination of Data Redundancy in Big Data (Gajjala) |
A Suvery of Recent Advances in Formally Verifying Object-Oriented Software (Gorantla) |
16 |
Dec. 08 |
A Survey of Spatial Query Processing Techniques (Mididoddi) |
Algorithms for Fundamental Spatial Aggregate Operations over Regions (Mittapally) |
Dec. 10 |
SIMD Architectures and Algorithms for Image Processing and Computer Vision (Mothkur) |
Page-Rank Algorithms (Neredugomma) |
Evaluation of Algorithms in Implementing Unreliable Failure Detectors (Polapragada) |
17 |
Dec. 15 |
finals week |
Dec. 17 |