QUESTIONARY: student feedback csi5165, Winter 2009, Prof Lucia Moura

student name:
contact email:

approximate probability of taking this course [0,1]: _______
(say pick 1 if it is sure, 0.5 if still chosing between this and one other course, etc)

Program of Study (circle)
discipline:  CSI  MATH  ECE  other:____________
level:  MSc   PhD  other: ___________________ (UOttawa) or (Carleton)

areas of specialization (research interest and/or thesis topic):




STUDENT INTEREST IN THIS COURSE:

motivation to take this course (this may be simply "an extra CSI/discrete math course
to enrich my degree"; but in case of special interests for you or your research, please, specify):




rate interest/relevance for you in the various courses topics, if you can are with present knowledge
(scale of 1-5 where 1 is lowest and 5 is highest, U is unknown)

  1  2  3  4  5  U    [G] generating elementary combinatorial objects  (sets, permut., gray codes...)

  1  2  3  4  5  U    [B] exhaustive generation (backtracking and branch-and-bound)

  1  2  3  4  5  U    [H]heuristic search (hill climbing, simulated annealing, tabu search, etc)

  1  2  3  4  5  U    [I] Isomorphism computations and isomorph-free exhaustive generation 
                               * comparing if objects are isomorph (similar under simmetries)                                
                               * exhaustive generation getting rid of isomorphic objects.


STUDENT BACKGROUND:

undergraduate degree (e.g. Bachelors in computer science):

previous grad degrees (if applicable) (e.g. Masters in applied mathematics):

Previous knowledge: (use back of the page if needed)
This course uses computer science and (discrete) math background.
if you don't hold a degree in either of these disciplines, I'd like to know more about
your knowledge/courses taken (programming, data structures, design and analysis of algorithms,
theoretical computer science, combinatorics, discrete math, graph theory, combinatorial 
optimization, etc). If you have taken lots of courses in computer science, combinatorics
and discrete math, you don't need to enumerate all.