WEB PAGE: |
||||||||||||||||||||||||||||||
PROFESSOR: |
Lucia Moura, tel: 562-5800 ext. 6678, email: lucia@site.uottawa.ca |
|||||||||||||||||||||||||||||
OFFICE HOURS: |
Office: SITE 5-027 Tuesdays 1:30-2:30 |
|||||||||||||||||||||||||||||
LECTURES: |
Tuesdays 11:30-1:00 (LMX 215) |
|||||||||||||||||||||||||||||
TEXTBOOKS: |
Textbook: [KS] D. Kreher and D. Stinson, "Combinatorial Algorithms: generation, enumeration and search", CRC Press, 1998. Available to buy at the University of Ottawa Bookstore. Reference book: [KO] P. Kaski and P. Ostergard, Classification algorithms for codes and designs, Springer, 2006. Paper copy available at Carleton University library. OttawaU electronic resources: go to "connect to Springer resource" for individual chapter's pdf" |
|||||||||||||||||||||||||||||
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: find at least one example of a structure of a particular type (this also includes Optimization s a special case). 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 University of Ottawa Academic Calendar: |
|
||||||||||||||||||||||||||||
|