COMP3711H (L1) - Honors Design and Analysis of Algorithms
Instructor: Mordecai Golin golin@cse.ust.hk
Office hours: (in Room 3559) by email appointment.
TAs:
HON Ka Lam | klhon@cse.ust.hk | |
QIU Yuan | yqiuac@connect.ust.hk |
Time and Venues:
-
Lectures:
Monday & Wednesday 10:30 - 11:50AM, Room 2503 New Room! -
Tutorial:
Friday 11-11:50AM, Room 4619
Textbook:
-
Algorithms
- Dasgupta, Papadimitriou, and Vazirani. McGraw Hill.
Other Reference Books:
-
Introduction to Algorithms (3rd ed)
- Cormen, Leiserson, Rivest and Stein. MIT Press
- E-version available from the university library
-
Programming Pearls (2nd ed)
- Bentley. Addison Wesley
-
Algorithm Design
- Kleinberg and Tardos. Addison Wesley
-
Problems on Algorithms (2nd ed)
- Ian Parberry and William Gasarch (free book)
Class Information:
-
Click "Pages" on the left to see a list of all upper-level Canvas pages for this course.
This includes Course Outcomes + Assessment Rubrics.
Many of those pages are also accessible directly via the links at the top of this page.
Assignment Information:
- There will be 4 Assignments handed out during the semester as well as various extra credit problems. See the Assignment Page for links to the individual assignments and extra credits.
- The assignments will, in total, be worth 30% of the final grade. The Midterm will also be worth 30% and the Final Exam will be worth 40%.
Exam Scheduling (Tentative):
Midterm | Thursday, October 18, 2018 | 19:00-21:00 | LTG | |||
Final | Wednesday, Dec. 19, 2018 | 08:30--11:30 | Tsang Shiu Tim Art Hall |
Intellectual Honesty & Plagiarism:
- Students are expected to follow the HKUST Academic Honor Code
- All work submitted for grading, e.g., assignments, must be your own
- You are permitted to discuss problems with other students but you must write-up all solutions by yourself, in your own words.
- If you got the main idea for a solution from another student or a web-site you must acknowledge that source in your submission.
- Submission of non-acknowledged material will be considered as plagiarism and dealt with under the university policy for cheating.
Course Summary:
Date | Details | Due |
---|---|---|