METU
Department of Computer Engineering
CENG 316 PRACTICE OF ALGORITHMS
Fall 2012
Instructor: Prof. Ismail Hakki Toroslu
Office: A-309, toroslu@ceng.metu.edu.tr
Lecture Hours: Monday 15:40-17:30
Office/Recitation Hours: Monday 13:40-15:30
Catalog Description: Advance algorithmic problems in graph theory, combinatorics and artificial intelligence.
Creative approaches to algorithm design. Efficient implementation of algorithms.
Course Objective: This course is practically rather than theoretically oriented, and the main aim of the course is to improve the creativity
of the students as well as to enhance their basic knowledge in designing algorithms and skills to efficiently implement them.
This is to be achieved by working on diverse set of interesting algorithmic problems.
Prerequisite: CENG 315
Text Book: S. Skiena, The Algorithm Design Manual, Telos/Springer-Verlag, 1998.
References: None
Course Outline:
0. [24/09] Introduction [PA 1]
1. [01/10] NO CLASS
2. [08/10] Overview of Algorithm Design and Analysis
3. [15/10] Potpourri [PA 2]
4. [22/10] Divide and Conquer [PA 3]
5. [29/10] HOLIDAY
6. [05/11] Greedy
7. [12/11] Dynamic Programming [PA 4]
8. [19/11] NP-C, Exhaustive Search, Brute-Force [PA 5]
9. [26/11] Branch and Bound, Heuristics
10. [03/12] Approximate Algorithms
11. [10/12] Computational Geometry
12. [17/12] STUDENT PRESENTATIONS
13. [24/12] STUDENT PRESENTATIONS
14. [31/12] STUDENT PRESENTATIONS
Grading:
. Programming Assignments [5 tasks, each due next week] 40%
. Project [2 new tasks, several alternative solutions, report (similar problems, formulation, discussions, evaluations), presentation] 60%
Grading Policies:
1. Late assignment submissions are not allowed.
2. No grouping or cooperation is allowed for the assignments.
3. Academic dishonesty will be subject to disciplinary action.