WEB PAGE: | http://www.site.uottawa.ca/~lucia/courses/5165-02/ | |||||||||||||||||||||||||||||
PROFESSOR: | Lucia Moura, tel: 562-5800 ext. 6678, email: lucia@site.uottawa.ca | |||||||||||||||||||||||||||||
OFFICE HOURS: | Office: SITE 5-027
Tuesdays 13:00-14:00, Thursdays 11:45-12:45 |
|||||||||||||||||||||||||||||
LECTURES: | Room: Vanier 469 (may change); Time: Tuesdays 9:00-12:00 | |||||||||||||||||||||||||||||
|
||||||||||||||||||||||||||||||
TEXTBOOK and Extra material: | D. Kreher and D. Stinson, "Combinatorial Algorithms: generation, enumeration
and search", CRC Press, 1998.
Available at: the University of Ottawa Bookstore ($132.55). |
|||||||||||||||||||||||||||||
COURSE
OBJECTIVES: |
Combinatorial problems arise in many areas of computer science, engineering
and mathematics. Combinatorial structures such as graphs and set systems
are used to model many problems in computing.
In this course, we will study combinatorial algorithms to solve the following types of problem: In the first part of the course, students will learn a wide range of techniques to solve these problems. In the second part, they will learn more advanced techniques as well as work on a project related to their research interests. |
|||||||||||||||||||||||||||||
COURSE OUTLINE: |
|
|||||||||||||||||||||||||||||
|
||||||||||||||||||||||||||||||
MARKING SCHEME: | 45% Assignments (3 @ 15% each)
05% Project proposal (up to 1 page) 40% Project (10-15 pages) 10% Presentation (20 minute talk) |
|||||||||||||||||||||||||||||
|
||||||||||||||||||||||||||||||
IMPORTANT
DATES: |
Schedule of assignments, projects and due dates:
Dates from the Academic
Calendar:
|
|||||||||||||||||||||||||||||
|