WEB PAGE: | http://www.site.uottawa.ca/~lucia/courses/5165-10/ | |||||||||||||||||||||
PROFESSOR: | Lucia Moura tel: 562-5800 ext. 6678 email: lucia@site.uottawa.ca |
|||||||||||||||||||||
OFFICE HOURS: | Office: SITE 5-027 Wednesdays 1:30-2:30, Fridays 2:30-3:30 or by appointment. |
|||||||||||||||||||||
LECTURES: | Wednesdays 10:00-1:00 (TBT 311) | |||||||||||||||||||||
|
||||||||||||||||||||||
TEXTBOOK: |
Textbook: [KS] D. Kreher and D. Stinson, "Combinatorial Algorithms: generation, enumeration and search", CRC Press, 1998. (The textbook is required)
Reference book: |
|||||||||||||||||||||
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: Generation: construct all combinatorial structures of a particular type. Enumeration: compute the number of different combinatorial structures of a particular type. Search/Optimization: find at least one example of a structure of a particular type; optimization can be viewed as a special case of search. 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 report (10-15 pages) 10% Project Talk (20 minute) |
|||||||||||||||||||||
|
||||||||||||||||||||||
IMPORTANT DATES: |
Dates from the University of Ottawa Academic Calendar: |