About CS5234 (Wk 0).ppt

About CS5234 (Wk 0) Course Overview All the Nitty Gritty About CS5234 Homeworks Homeworks are fairly challenging About Academic Honesty and Cheating Is this course suitable for you? Course Pre-requisites Mathematical Maturity CS5234: Comb and Graph Alg (Fall 2002) Instructor: Leong Hon Wai, S16 06-01 .sg/~CS5234/2002/ Course Objectives: covers advanced design and analysis of algorithms emphasizes efficient algorithms and data structures Algorithms for combinatorial optimisation Use of algorithms in advanced software development Target Students: advanced undergraduate (4th year) students beginning graduate students those doing research in algorithm design CS5234: Overview…(2) Prerequisite: CS3230 Design and Analysis of Algorithms AND C++ Programming Skills Or Consent of Instructor TextBook and Reference Material: [CLRS01] Introduction to Algorithms, (2nd edition) by Cormen, Leiserson, Rivest, Stein [COOP, @$7x] (Material also comes from [Tarj83], [RND77], [SKD83]) CS5234: Overview… (3) Course Grading: 30% Homeworks 20% Programming Assignments 50% Final Exam (OPEN BOOK) Homework: (30%) About 4-5 sets (about 1 every 2-3 weeks) Very important part of the course Programming Assignments: (20%) Two C++ programming assignments Uses LEDA Library (C++) CS5234: Topics (Tentative) ADVANCED DATA STRUCTURES Heaps, Shortest Path and MST Leftist Heaps and O(m lg lg n) MST Alg. Amortized Analysis and Binomial Heaps [Fast Review] F-Heaps Fast Shortest Path Alg. COMBINATORIAL Optimization Maximum Matching: Algorithms and Applications Network Flow Problems: Algorithms and Applications NP-COMPLETENESS NP-completeness: Cooks Theorem, Reduction Approximation Algorithms Local Search Methods SPECIAL TOPICS: TSP TTP, Knapsack Problem, Graph Partitioning CS4534: References Main Text: [CLRS01] Introduction to Algorithms, (2nd edition) (SC-RBRx2) by Cormen, Leiserson, Rivest, Stein, MIT, (2001) References: [Tar83]* Data Structures and