Time:
TR 09:30-10:45
Place:
Tapy Hall 220
Instructor:
Bernard M.E. Moret.
Email:
moret@cs.unm.edu
Office:
FEC 335 (ext. 75699)
Office Hours:
TBA
Text:
Motwani, R., and P. Raghavan. Randomized Algorithms.
Cambridge University Press, 1995 (required).
Grading:
Graded homework assignments (about 8). In general, a student's
performance towards the end of the semester is considered more important,
especially if it shows improvement over earlier work.
Policies:
Assignment deadlines are strict: late homework will automatically receive
a grade of zero, unless reasonable cause can be shown (which is easy
for one, possible for two, and very hard for three or more!); no make-up.
Usual university policies for withdrawals, incompletes, academic honesty,
etc.