Fall 2019
Class schedule: TR 5:30 pm - 06:45 pm, HDN - 107
Office hours: T 3:00 - 5:00 pm, R 1:00 - 3:00 PM or by appointment
|
|||||||||||||||||||||||||||
Demos |
Textbook: Introduction to Algorithms, McGraw Hill Publishing Company and MIT Press, 2009 (3rd edition).
The MIT Press web site for the textbook is http://mitpress.mit.edu/algorithms. HOMEWORKS QUIZZES (as
parts of Mid-Terms) 1.
Quiz #1 on Dynamic Programming chapter (LCS and CMM
algorithms) is on 9/10/2019 (first 25 minutes of the class). 2.
Quiz #2 on Greedy Algorithms chapter (HC,
AS and FK algorithms) is on 9/17/2019 (first 25 minutes of the class). 3. Quiz #3 on Amortized Analysis
chapter (one of the three methods to apply to a problem; see problems 1 - 3
of HW3) is on 9/26/2019 (first 25 minutes of the class). 4. Quiz #4 on Parallel Algorithms
chapter (there will be a problem(s) similar to problems 30.1-1, 30.1-2,
30.1-3, 30.2-8, 30.5-2, 30.5-3) is on 10/17/2019 (first 25 minutes of the
class). 5. Quiz #5 on Computational Geometry
chapter (know cross product operations and algorithms for `whether any pair
of segments intersect`, `convex hull`, `closest pair`) is on 10/31/2019
(first 25 minutes of the class). 6. Quiz #6 on NP-Completeness chapter
(know definitions of complexity classes and reductions: 3Col to CCov, 3SAT to IS, IS to
CLIQUE, IS to VC, 3SAT to DHP) is on 11/19/2019 (first 25 minutes of the class). EXAMS |
||||||||||||||||||||||||||
|
|||||||||||||||||||||||||||
|
|
||||||||||||||||||||||||||
|
|
F. Dragan
dragan at cs.kent.edu
Fall 2019
NOTICE OF MY COPYRIGHT AND INTELLECTUAL PROPERTY RIGHTS. Any
intellectual property displayed or distributed to students during this
course (including but not limited to powerpoint
presentations, notes, quizzes, examinations) by the professor remains the
intellectual property of the professor. This means that the student may
not distribute, publish or provide such intellectual property to any
other person or entity for any reason, commercial or otherwise, without the
express written permission of the professor.