CS 161: Design and Analysis of Algorithms (Winter 2017)

Submission Instructions and Policies

• All assignments are posted on Fridays, and are due the next Friday at 3pm.
• All assignments must be submitted electronically as a PDF file using Gradescope (access code: 9R2NW9).
• All assignments should be typed using LaTeX, LyX, Microsoft Word, or a similar editor. For first time LaTeX users, see the resources section. Scanned handwritten assignments are not accepted.
• Each student is allowed to discuss the assignment (verbally) with at most two other students. Each student should write (in your own words) and submit your own solution. When you submit the assignment, you should indicate with whom you have discussed the solutions.
• You are allowed to use textbooks, resources that are listed on this page, and other reading material that you find on the Internet. If you use results from the textbooks or resources listed on this page, make sure to cite the results you are using properly. If you are using other resources, you have to prove any statement that you use (and still, make sure to cite the source properly).
• You are not allowed to look for the answers for any of the homework assignments (online or otherwise). If you accidentally find a solution for a question, do not read it (if it is not too late), and indicate that clearly on your assignment (including where you found the solution).
• Please follow the honor code.
• Each student has two late submission passes. Each pass allows the student to submit an assignment on Sunday at 3pm (instead of Friday). Late submission passes cannot be split between assignments or used twice for the same assignment. Please note that late assignments may need to be submitted as a separate assignment in Gradescope (as the submission of the original assignment may be closed).

Regrade Policy

• For each assignment, regrade requests will open on Gradescope on Wednesday (after the grades have been published) and close on Sunday.
• Please provide a detailed explanation for your regrade request.
• Note that we may regrade any part of the assignment, and the new grade may be greater than, equal to, or less than the original grade.

Recitations

We hold recitation sections in order to review some of the material and solve additional exercises with the students in smaller groups. The sections are optional but highly recommended. The schedule (including locations) of the recitation sections appears in the office hours calendar. Each section covers the material of the previous week except for Friday sections that cover the material of the same week.

Exercises

• Recitation 1 (week 1)
  Solutions

Resources

Textbooks

The main textbook we use is:
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein, Introduction to Algorithms, 3rd Edition, MIT Press
The book is available online through the Stanford library.

We will also occasionally use:
Jon Kleinberg, Éva Tardos, Algorithm Design, Pearson/Addison-Wesley
Sanjoy Dasgupta, Christos Papadimitriou, Umesh Vazirani, Algorithms, McGraw-Hill Education

LaTeX Resources

We strongly recommend typesetting solutions to the homework assignments using LaTeX. LaTeX provides a convenient way to produce high-quality documents and it is the standard used for typesetting computer science papers.

Guide: An introduction to LaTeX can be found here. Other guides can be found at howtoTeX and Wikibooks.

Online environments: If you do not wish to install LaTeX, ShareLaTeX and Overleaf are online environments that compile previews of your documents as you type and allow you to share documents with collaborators (this feature won't be useful in this course, though). As a Stanford student, you get a free Overleaf Pro account.

LyX: LyX is a version of LaTeX with graphical interface.

Finding mathematical symbols: The introduction mentioned above contains a table of mathematical symbols in LaTeX. Alternatively, consider Detexify.