COURSE INFORMATION SHEET GEORGE WASHINGTON UNIVERSITY Department of Computer Science CS 6212 Section 10 Credits: 3 FACULTY INFORMATION Dr. Amrinder Arora E-mail: [email protected] Cell Phone: 571 276 8807 REQUIRED TEXT Title: Analysis and Design of Algorithms (Second Edition) Author: Amrinder Arora Publisher: Cognella Academic Publisher, www.cognella.com ISBN: 978-1-63487-073-3 To order: [email protected], phone 1-800-200-3908 ext. 513 Office Hours Tuesday 4:30 PM - 6 PM Science and Engineering Hall, Room 4456 POLICIES Reading Assignments Reading assignments are given during each lecture. In the subsequent lectures, students are asked to summarize those assignments. Those are the opportunities for getting “class participation” points. Evaluation Homeworks, Quizzes: Projects (4): Class Participation: Mid-term Exam: Final Exam: 20% 20% 10% 25% 25% Submission Guidelines Email submissions only to [email protected] Do not send any questions to the dropbox – TA does not read it unless I plan to grade that day. Email Email can be used for help but the reply may take more than 24 hours. While sending email, always use a proper subject that reflects the problem. Academic Integrity Policy Academic dishonesty includes plagiarism, cheating, and other illegal or unethical behaviors in doing the work of the course. However, collaboration on homework assignments is accepted, as well as encouraged. The focus however is that the solutions must be understood by you before being restated. Midterm and final are closed books, individual tests. Slides, Blogs, Twitters, Etc All slideshares are publicly available at: http://www.slideshare.net/amrinderarora/presentations You can subscribe to blog: http://standardwisdom.com/softwarejournal/category/education/ Twitter: @amrinderarora hashtag: #cs6212gwu Tentative Sequence of Topics Lecture 1. Lecture 2. Introduction and Asymptotic Notations Summation and Series Data Structures – Stack, List, Graph, Tree, Binary Search Tree, Union Find Lecture 3. Divide and Conquer Strategy, Merge Sort, Quick Sort, Recurrence Relations Lecture 4. Divide and Conquer – Median Finding, Quick Select, Recurrence Relation Solving Lecture 5. Greedy Method – Knapsack Problem, Minimum Spanning Tree, Union Find Lecture 6. Dynamic Programming, Fibonacci sequence, Matrix Chain Multiplication, Game Programming, Shortest Path problems in Graph Theory Lecture 7. DP Review – comparison with greedy, comparison with D&C, MVCS, LIS Lecture 8. Graph Traversal, DFS, Biconnectivity Lecture 9. BFS, Branch and Bound and its applications Lecture 10. NP Completeness and Complexity Classes Lecture 11. More Reductions + Theory of Lower Bounds Lecture 12. Project Presentations Class Presentations Project 4 presentations are made in class by student teams.