CS157:   Design and Analysis of Algorithms
Grading Structure

The final grade is determined as follows: .25 P + .3 Midterm + .4 Final + .05 Bonus

  • P= problem sets and homeworks, Bonus= instructors' assessment of student's learning; rewards such qualities as active in-class participation, insightful remarks, and significant progress during the semester.
  • Homeworks: About every other week. You must do all the problems in the homework. The homework is due Tuesday before class: You should turn in a paper copy in the handin bin (CIT 271). No late assignments will be accepted without prior consent from the instructor. Collaboration: You may talk to other students about the homework, however you may not take anything away from these conversations and the writeup must be done entirely on your own.
  • Large Problem sets: About every other week. For each problem set, you must do one problem in the set but you must understand all problem solutions. For each problem set, there will be a work session.
    Before the work session, you prepare the solution to one of the 4 problems (as assigned here for the first session). During the work session, you explain your solution to a group of fellow students who have not worked on that problem; you also listen to and criticize their solutions for the other problems. After the work session, you write up your final solution to your problem (and only your problem). This latter part is non-collaborative. We expect your final solution to be clear, precise, and concise, and the style of your writeup will be an central criterion for the grading. (Alternatively, you may choose to not come to the work session, in which case you must turn in solutions to all the problems in the problem set.) All problem sets must be handed in electronically using cs157handin, and a paper copy must be dropped in the handin bin (CIT 271). The electronic handin must include both a pdf and the source for the pdf (preferably tex). Your handins could be posted anonymously to the web site as examples. The problem sets are due Tuesdays before class, unless otherwise mentioned. No late assignments will be accepted without prior consent from the instructor.

  • The Midterm Exam will be an in-class exam. The Final Exam will be a take-home exam.

  • In-class presentation: students are encouraged to volunteer to give in-class presentations, about 10 minutes long, on applications of problems, techiques or results related to class material, applied to other areas of computer science.