CSCI 256: Algorithm Design and Analysis

Fall 2019

Home | Course Schedule | Assignments | Course Policies | Resources | CS Dept

Assignment Expectations and Instructions

There will be weekly problem sets (which may include occasional small programs). Planned problem set release and the due dates are listed on the course schedule, the links to actual assignments will be posted on the schedule as well. Any adjustments to the due dates will be announced in class. Please read this page in its entirety for information about what is expected from you with respect to the problem sets.

You are expected to answer all questions, except for those labeled "optional." A good attempt at a problem, stating your approach and where you got stuck, is much better (both grade-wise and for learning) than leaving it blank. Most problems will usually require either a proof or a counter-example.

Written Proofs. The presentation style of your proofs should be modeled on the proofs given in the textbook. The proofs we will do during lectures, will usually be interactive and focused more on providing intuition than serving as a model for written proofs. Visualizations (graphs, diagrams, etc) are encouraged and are an effective methods of clarifying a concept. However, they generally do not themselves constitute a proof.

Preparation and Submission. You must follow the instructions below for preparing and submitting your problem sets.



Why handwritten problem sets are not accepted. A large fraction of handwritten solutions, especially including mathematical content as in this course, are difficult (sometimes impossible) to read, which can dramatically increase the amount of time needed to grade them. Secondly, handwritten problem sets make it difficult to implement anonymous grading as handwriting can often reveal the student's identity. By submitting typeset assignment, without student information, through Gradescope, the TAs and instructor will be unlikely to know whose work they are grading.

Sample Solutions. Sample solutions to problem sets will be provided through GLOW and represent a particular approach to solving a problem; it may not be the only (or even the best) approach. Typically there are several ways to solve a problem and creativity is encouraged, unless the problem states that a specific approach must be used (for example, "Design a greedy algorithm to ..." would require that the solution be a greedy algorithm).




Copyright 2012 | Department of Computer Science :: 47 Lab Campus Drive :: Williamstown, MA 01267
413.597.3218 :: requestinfo@cs.williams.edu