Description of Individual Course Units
|
Offered By |
Computer Science |
Level of Course Unit |
First Cycle Programmes (Bachelor's Degree) |
Course Coordinator |
ASSOCIATE PROFESSOR ZEYNEP NIHAN BERBERLER |
Offered to |
Computer Science |
Course Objective |
This course aims to provide an introduction to a new programming paradigm based on constraints over finite domains and provide experience of how to use these methods for solving combinatorial problems. Different constraint modeling languages and programming tools will be introduced and used for modeling complex discrete optimization and combinatorial problems as constraint programs, as well as to write specific search methods. |
Learning Outcomes of the Course Unit |
||||||||||
|
Mode of Delivery |
Face -to- Face |
Prerequisites and Co-requisites |
None |
Recomended Optional Programme Components |
None |
Course Contents |
|||||||||||||||||||||||||||||||||||||||||||||
|
Recomended or Required Reading |
Textbook(s): Rossi, F., Van Beek, P., Walsh, T., Handbook of Constraint Programming, Elsevier Science, New York, 2006 (ISBN: 9780080463803). |
Planned Learning Activities and Teaching Methods |
The course is taught in a lecture, class presentation and discussion format. Besides the taught lecture, group presentations are to be prepared by the groups assigned and presented in a discussion session. In some weeks of the course, results of the homework given previously are discussed. |
Assessment Methods |
||||||||||||||||||||||||
*** Resit Exam is Not Administered in Institutions Where Resit is not Applicable. |
Further Notes About Assessment Methods |
None |
Assessment Criteria |
Will be announced. |
Language of Instruction |
Turkish |
Course Policies and Rules |
Will be announced. |
Contact Details for the Lecturer(s) |
zeynep.berberler@deu.edu.tr |
Office Hours |
To be announced in the beginning of the semester. |
Work Placement(s) |
None |
Workload Calculation |
||||||||||||||||||||||||||||||||
|
Contribution of Learning Outcomes to Programme Outcomes |
||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|