CSCI 256: Spring 2021
Algorithm Design and Analysis
Home | Course Schedule | Assignments | Course Policies | Resources | CS Dept
Assignment Expectations and Instructions
There will be weekly problem sets. 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.
Advice on Problem Sets.
I have put together general advice on how to succeed on the problem sets, along with specific advice on writing and analyzing algorithms
and grading expectations, in this handout. Please read it careful and ask me if you have any questions or concerns.
Preparation and Submission. You must follow the instructions below for preparing and submitting your problem sets.
Copyright 2012 | Department of Computer Science :: 47 Lab Campus Drive :: Williamstown, MA 01267 | ||
413.597.3218 :: requestinfo@cs.williams.edu |