Joseph added it Apr 23, Lucy added it Feb 27, Aditya rated it it was amazing Apr 08, Tao is currently reading it Sep 18, This will be an important reference book as well as being a useful dezign textbook. Goodreads helps you keep track of books you want to read. Akshay Agarwal marked it as to-read Aug 18, Yu Chen is currently reading it Oct 02, If you like books and love to build cool products, we may be looking for you. Just a moment while we sign you in to your Goodreads account.
|Published (Last):||9 July 2009|
|PDF File Size:||17.20 Mb|
|ePub File Size:||14.1 Mb|
|Price:||Free* [*Free Regsitration Required]|
Class Schedule Course Overview This course presents fundamental ideas and techniques of modern algorithm design and analysis.
After completing this course, students should be able to analyze and design efficient algorithms for a variety of computational problems. For more details, see the Syllabus.
We will assume that everyone has seen the material in these courses, and will use it as necessary. Specifically, from CSCI this includes elementary data structures, binary search, sorting, big-O notation, and basic terminology involving graphs including the concepts of depth-first search, breadth-first search, and connectivity.
These topics are covered in chapters 2 and 3 of the textbook. The prerequisites for this course also include a background in discrete mathematics, including order of function growth, sets, recurrence relations, and proof techniques such as induction and contradiction.
This also includes strong and structural induction. The lectures and homework involve the analysis of algorithms at a fairly mathematical level. If you did not take a corresponding course, you must contact me during the first week of classes.
To refresh your knowledge of Discrete Mathematics please read the handout on Discrete Math , as well as Chapters 2 and 3 of the textbook, and try to solve all problems. If you cannot solve many of them, I strongly recommend that you take a course in Discrete Mathematics before taking this course.
Although the lectures will mostly be drawn from the textbook, we will still cover things that do not appear in the text, and the textbook includes material that we will not cover in class. You are responsible for the content of the lectures as well as any assigned readings. Kozen: The Design and Analysis of Algorithms. Homework, Exams, and Grading Students are encouraged to attend all classes.
Your active in-class participation will be a substantial part of your learning process, and will be taken into consideration when final grades are determined. Homework will be assigned every weeks, and can be done in pairs. There will not be any programming assignments.
Homework should submitted on LMS, and also be handed in at the beginning of lecture on the day it is due. For more information about homework, see the Homework Guide.
You are required to prove your statements, unless otherwise specified. If a homework or exam question asks you to design an algorithm for a certain task, then the answer must consist of a description of the algorithm an English description is fine , as well as an analysis of its running time and a proof of its correctness.
There will be a midterm exam in class see the Class Schedule for exact date , and a comprehensive final exam during finals week. All exams are open-textbook and open-notes. Make-up tests or homework assignments will not be given except in case of an emergency. Students who know they are going to miss a test must notify me in advance. Special circumstances can be accommodated if I am notified about them in advance.
We will drop the lowest homework grade. Regrades: Any request to re-evaluate a grade must be made within one week of the return date of the homework or exam in question. You must explain why you think your grade should be changed in writing, and submit your request to me or a TA, together with the original problem solution. The second grade will remain. It is also your responsibility to monitor your grades on LMS; if there is any error you must bring it to my attention within one week of the grade being posted.
Exam Cutoffs: In addition, your maximum final grade can be at most 5 points more than your weighted exam average. So, for example, if your weighted exam average is 73 percent, then the maximum grade that you would be able to receive in the class is Policy on Academic Integrity: You are allowed and encouraged to discuss homework problems with other members of the class, and to formulate ideas together.
However, everyone must write up their assignments separately, and include the names of everyone you discussed the assignment with. You may not copy or near-copy a solution from another, or use resources other than the class notes or the class textbook. Failure to write the solution to a homework completely on your own will be considered a breach of academic integrity, and may result in the final grade being reduced by a letter and a 0-grade for the homework for both parties.
No collaboration and nothing electronic is allowed during exams. The Rensselaer Graduate Student Supplement also defines various forms of Academic Dishonesty and procedures for responding to them. Students should make themselves familiar with this information.
The Design and Analysis of Algorithms / Edition 1
The Design and Analysis of Algorithms