Date Topic Slides Reading Jan 03 (Tue) Introduction PDF [GTG] chapter 1 and 2 Jan 05 (Thu) Algorithm Analysis: Asymptotic worst-case analysis PDF [GTG] chapter 4 Jan 06 (Fri) Algorithm Analysis: Asymptotic worst-case analysis PDF [GTG] chapter 4 Jan 10 (Tue) Algorithm Analysis: Asymptotic worst-case analysis PDF [GTG] chapter 4 Jan 12 (Thu) Algorithm Analysis: Examples PDF [GTG] chapter 4 Jan 13 (Fri) Quiz-01 and Quiz-02 - - Jan 17 (Tue) Algorithm Analysis: Recursive functions, binary search PDF [GTG] chapter 5 Jan 19 (Thu) Algorithm Analysis: Recursive functions, Solving recurrence relations PDF [GTG] chapter 5 Jan 20 (Fri) Algorithm Analysis: Recursive functions, Divide and Conquer and Quiz-03 PDF [GTG] chapter 5 Jan 24 (Tue) Algorithm Analysis: Divide and Conquer, Merge Sort, Stack, Queue PDF [GTG] section 13.1, [GTG] chapter 6 Jan 26 (Thu) Holiday (No Class) - - Jan 27 (Fri) Data Structures: Stack and Queue, Amortized analysis, Dynamic Arrays, Linked List PDF [GTG] chapter 3 Jan 28 (Sat) (Thu schedule) Data Structures: Linked List and Quiz-04 PDF [GTG] chapter 3 Feb 02 Minor-I (5:30 - 6:30pm, LH325)(Solution) - - Feb 07 (Tue) Data Structures: Tree, Binary Tree PDF [GTG] Chapter 8 Feb 09 (Thu) Data Structures: Priority Queue, Heap PDF [GTG] chapter 9 Feb 10 (Fri) Data Structures: Heap and Quiz-05 PDF [GTG] chapter 9 Feb 14 (Tue) (Fri schedule) Data Structures: Heap, Heap Sort, Binary Search Tree, AVL Tree PDF [GTG] chapter 11 Feb 16 (Thu) Data Structures: AVL Tree and Quiz-06 PDF [GTG] chapter 11 Feb 17 (Fri) Mid Term Evaluations (No Class) - - Feb 21 (Tue) Data Structures: AVL Tree PDF [GTG] chapter 11 Feb 22 (Wed) (Fri schedule) Data Structures: (2, 4)-Tree PDF [GTG] chapter 11 Feb 23 (Thu) Data Structures: B-Tree and Quiz-07 PDF [GTG] chapter 11 Feb 24 (Fri) Semester Break (No Class) - - Feb 28 (Tue) Semester Break (No Class) - - Mar 02 (Thu) Semester Break (No Class) - - Mar 03 (Fri) Semester Break (No Class) - - Mar 07 (Tue) Data Structures: Hashing PDF [GTG] chapter 10 Mar 09 (Thu) Data Structures: Universal Hashing PDF - Mar 10 (Fri) Data Structures: Universal Hashing and Quiz-08 PDF - Mar 14 (Tue) Algorithms: Introduction PDF - Mar 16 (Thu) Algorithms: Graph Exploration, BFS PDF - Mar 17 (Fri) Algorithms: BFS and Quiz-09 PDF - Mar 21 (Tue) Algorithms: BFS application, DFS, Connected Components PDF - March 24 Minor-II (5:30 - 6:30pm, LH325)(Solution of one of the two versions) - - Mar 28 (Tue) Algorithms: Connected Components, Topological Ordering PDF - Mar 30 (Thu) Algorithms: Strongly Connected Components PDF - Mar 31 (Fri) Algorithms: Greedy Algorithms (Interval Scheduling) PDF - Apr 01 (Sat) (Fri schedule) Algorithms: Greedy Algorithms (Job Scheduling) and Quiz-10 PDF - Apr 04 (Tue) Holiday (No Class) - - Apr 06 (Thu) Algorithms: Greedy Algorithms (Minimim Spanning Tree) PDF - Apr 07 (Fri) Algorithms: Greedy Algorithms (Minimim Spanning Tree) PDF - Apr 08 (Sat) (Tue schedule) Algorithms: Greedy Algorithms (Dijkstra Algorithm) and Quiz-11 PDF - Apr 11 (Tue) Algorithms: Divide and Conquer (Counting Inversions) PDF - Apr 13 (Thu) Holiday (No Class) - - Apr 14 (Fri) Holiday (No Class) - - Apr 18 (Tue) Algorithms: Dynamic Programming (Longest Increasing Subsequence) PDF - Apr 20 (Thu) Algorithms: Dynamic Programming (Longest Common Subsequence) PDF - Apr 21 (Fri) Algorithms: Dynamic Programming (0/1-Knapsack) and Quiz-12 PDF PDF - Apr 25 (Tue) Algorithms: Network Flow (Ford-Fulkerson) PDF - Apr 27 (Thu) Algorithms: Network Flow (Ford-Fulkerson, Matching) PDF - Apr 28 (Fri) Algorithms: Network Flow (Team selection), Computational intractability PDF - Apr 29 (Sat) (Thu schedule) Algorithms: Computation intractability (polynomial time reduction) and Quiz-13 PDF - May 01-06 Major Exam - -