This course is designed to teach techniques for the design and analysis of efficient computer algorithms through theoretical backgrounds and examples of advanced methods and data structures. Topics covered include: Asymptotic Growth Analysis of Functions. Average and Worst Case Analysis. Sorting and Selection Problems. Advanced Search Trees. Graph Theory. Related Algorithms. Divide and Conquer. Greedy Programming Paradigms. Hashing. Complexity Classes of P, NP and NP-Complete.