Tuesday, 11 June 2019


TEXT BOOKS:
1. Fundamentals of Computer Algorithms, Ellis Horowitz, Satraj Sahni and Rajasekharan.
2. Introduction to Algorithms, T.H.Cormen, C.E.Leiserson, R.L.Rivest and C.Stein.

 REFERENCE BOOKS:
1. Algorithms: Fourth Edition, Robert Sedgewick. 

Web Resources:
Algorithms by Robert Sedgewick
Algorithms by Abdul Bari 
MIT - Open Course-ware Videos on Algorithms 
Lecture Schedule:

LectureUnit No.Name of the Topic
Lecture1
I
Introduction to Algorithms
Lecture2Algorithm Specifications
Lecture3Types of Algorithms
Lecture4Time Complexity
Lecture5Time Complexity
Lecture 6Time Complexity
Lecture7Space Complexity
Lecture 8Asymptotic Notations
Lecture 9Master's Theorem with Proof
Lecture 10Amortized Analysis
Lecture 11Amortized Analysis
Lecture 12Sorting in Linear time
Lecture 13Sorting in Linear time
Lecture 14Revision
Lecture 15
II
D&C General Method
Lecture 16Binary Search
Lecture 17Defective Chess Board
Lecture 18Finding Max. and Min.
Lecture 19Quick Sort
Lecture 20Quick Sort
Lecture 21Merge Sort
Lecture 22Merge Sort
Lecture 23Matrix Multiplication - Block
Lecture 24Matrix Multiplication - Strassen's
Lecture 25Revision
Lecture 26
III
Greedy - General Method
Lecture 27Job sequencing with deadlines
Lecture 28knapsack problem
Lecture 29knapsack problem
Lecture 30Single source shortest path problem,
Lecture 31Optimal Merge Patterns
Lecture 32Optimal Merge Patterns
Lecture 33Introduction to Probabilistic analysis:
Lecture 34The Hiring Problem
Lecture 35Indicator random variables
Lecture 36Randomized Quick Sort
Lecture 37Randomly built binary search trees
Lecture 38Revision
Lecture 39
IV
DP - General Method
Lecture 40Matrix Chain Multiplication
Lecture 410/1 Knapsack Problem
Lecture 42All Pairs Shortest Path Problem
Lecture 43TSP
Lecture 44String Editing
Lecture 45String Editing
Lecture 46Reliability Design
Lecture 47Reliability Design
Lecture 48Multi-Threaded Algorithms:
Lecture 49Basics
Lecture 50Multi-Threaded Matrix Multiplication
Lecture 51Multi-Threaded Merge Sort
Lecture 52Revision
Lecture 53
V
Backtracking - General Method
Lecture 54Backtracking - General Method
Lecture 55N-Queens Problem
Lecture 56N-Queens Problem
Lecture 57Sum of Subsets Problem
Lecture 58Sum of Subsets Problem
Lecture 59Control Abstraction for LC -Search
Lecture 60LC-Search for 15 Puzzle Problem
Lecture 61Control Abstraction for FIFO -Search
Lecture 62Control Abstraction for LIFO - Search
Lecture 63Introduction to NP-Hard
Lecture 64Introduction to NP-Completeness
Lecture 65Revision
Posted by at

No comments:

Post a Comment

Subscribe to: Post Comments (Atom)