COMP 122 – Design and Analysis of Algorithms.pptVIP

COMP 122 – Design and Analysis of Algorithms Spring 2004 MW 11:00-12:15, SN 014 Course Overview Intro to algorithm design, analysis, and applications Algorithm Analysis Asymptotic Notation, Recurrence Relations, Probability Combinatorics, Proof Techniques, Inherent Complexity. Data Structures Lists, Heaps, Graphs, Trees, Balanced Trees, Hash Tables. Sorting Ordering Mergesort, Heapsort, Quicksort, Linear-time Sorts (bucket, counting, radix sort), Selection, Other sorting methods. Algorithmic Design Paradigms Divide and Conquer, Dynamic Programming, Greedy Algorithms, Graph Algorithms, Randomized Algorithms. Primary Focus Develop thinking ability. problem solving skills. (algorithm design and application) formal thinking. (proof techniques analysis) What Will We Do? Examine interesting problems. Devise algorithms to solve them. Prove these algorithms correct. Analyze their resource usage (time, memory). Understand data structures core algorithms. Learn problem-solving techniques. See applications in real-world situations. Goals Be very familiar with a collection of core algorithms. Be fluent in algorithm design paradigms: divide conquer, greedy algorithms, randomization, dynamic programming, approximation methods. Be able to analyze the correctness and runtime performance of a given algorithm. Be familiar with the inherent complexity (lower bounds intractability) of some problems. Be intimately familiar with basic data structures. Be able to apply techniques in practical problems. Textbook References Introduction to Algorithms, 2nd Ed. by Cormen, Leiserson, Rivest, Stein (CLRS), McGraw Hill, 2002. Lecture slides online (Thanks, Prof. Ming Lin) OTHER REFERENCES: Algorithmics: The Spirit of Computing, Harel How to Solve It, Polya. The Design and Analysis of Computer Algorithms, Aho, Hopcroft and Ullman. Algorithms, Sedgewick. Algorithmics: Theory Practice, Brassard Bratley. Writing Efficient Pro