Introduction to algorithms: The role of algorithms in computing; Designing and Analysis of Algorithms; growth of functions; recurrence; Sorting and Order Statistics: Sorting in linear time; Medians and order statistics; Dynamic Programming: Common subproblems; Optimal substructure; Fibonacci Sequence; Minimum Edit Distance; greedy algorithms; Data structures for set manipulation problems: Queues; Stacks; Search tree; Randomized search tree; Red-black tree; Advanced topics: Greedy algorithms; The Fast Fourier Transform and its applications; Pattern Matching algorithms; Graphs; NP complete problems;