Download syllabus - COW :: Ceng

yes no Was this document useful for you?
   Thank you for your participation!

* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project

Document related concepts

Multi-armed bandit wikipedia , lookup

Existential risk from artificial general intelligence wikipedia , lookup

Ethics of artificial intelligence wikipedia , lookup

Intelligence explosion wikipedia , lookup

Gene expression programming wikipedia , lookup

Pattern recognition wikipedia , lookup

History of artificial intelligence wikipedia , lookup

Stemming wikipedia , lookup

Genetic algorithm wikipedia , lookup

Department of Computer Engineering
CENG 316 Practice of Algorithms
Assoc. Prof. Dr. Ismail Hakki Toroslu
Catalog description: Practice of Algorithms (2-2) 3
Advanced algorithmic problems in graph theory, combinatorics, and artificial intelligence. Creative approaches to
algorithm design. Efficient implementation of algorithms.
Prerequisities: CENG 315 and the consent of the department.
Course objectives: 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 a diverse set of interesting algorithmic
Main Reference: S. S. Skiena, The Algorithm Design Manual, Springer-Verlag, 1998.
Other Important References:
 I. Parberry, Problems on Algorithms, Prentice Hall, 1995.
 S. S. Skiena, M. A. Revilla, Programming Challenges, Springer-Verlag, 2002.
 T. H. Cormen, C. E. Leiserson, R. L. Rivest , C. Stein, Introduction to Algorithms, 2nd Ed. The MIT Press,
Weekly Course Outline:
1. Introduction, Analysis of Algorithms, Algorithm Design Techniques (HW1).
2. - No class, out of town –
3. Combinatorics Problems, Backtracking (HW2).
4. Complexity Classes, Reduction, Examples on NP-completeness.
5. – No class, holiday 6. Divide and Conquer, Greedy, Induction Technique (HW3).
7. Dynamic Programming.
8. Advanced Graph Problems, Network Flow, Matching (HW4).
9. Artificial Intelligence Problems: Puzzle Solving, Game Playing.
10. Heuristic Techniques for Hard Problems (HW5).
11. Student Presentations.
12. Student Presentations.
13. Student Presentations.
14. Student Presentations.
Grading system:
Exam: %33 (Participating to internet programming contests, rankings and scores will determine the grade)
Homework: %33 (Programming assignments, posted Monday, due Wednesday of the assigned week)
Project: %33 (Programming project, preparing new contest tasks, presentation, report)
All the anouncements related to the homeworks and other things will be made in the newsgroup and in the course
page. Hard copy announcements and homeworks will not be distributed. It is the student's responsibility to follow
the related newsgroup in order to receive the homework or other information.
Related Websites