COMP 3711H Design and Analysis
of Algorithms (Honors Track)
Dr. Mordecai GOLIN
Room 3559, firstname.lastname@example.org
- 13/12/2014 There will be final exam viewing
sessions Monday (Dec 15) and Tuesday (Dec 17) afternoons.
For venue and times see Examination Page
- 13/12/2014 Final Grades have been posted in the Mark database on the Grade page.
- 25/09/2014 Intellectual Honesty Policy updated (see bottom of this page)
- Old News available here
Other Reference Texts
- Lecture venue and time: Rm 4502, 9:00 - 10:20 on
Tuesday and Thursday
- Tutorial venue and time: Rm 2302, 12:00 - 12:50 on
- Tutor's info: Bo QIN (email@example.com)
- Tutor's office hour: TBA
- Office Hours
- If you have any question about the course, you can
talk to me after class or by appointment, find the tutor during his
office hours, or send your questions to me or the TA by email.
Papadimitriou, and Vazirani. McGraw Hill.
- Syllabus (Tentative)
- Sorting Algorithms
- Balanced Binary Search Trees,
- Algorithmic Design Techniques:
Divide-and-Conquer, Dynamic Programming, Greedy
- Approximation & Randomized Algorithms
- (30%) . There will be four
assignments, each worth the same amount. Each assignment will
have 10-14 days to complete. The first assignment will be
distributed towards the end of September.
- (30%) Midterm: Monday, October 27, from 19:30-21:30 in Room 4334
- (40%) Final: Wednesday, December 10, from 12:30-15:30 in Room LG1027 (see here)
- The tutor will regularly inform me of students'
participation in tutorials. Active participation in tutorials may be
considered in minor grade adjustment at instructor's discretion.
Intellectual Honesty and 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.
of non-acknowledged material will be considered as plagiarism and dealt
with under the university policy for cheating.
Sept 24, 2014