Course Information
Created: September 22, 2010
Last modified:
Instructor
Office Hours
- 1:00-2:00pm Tuesday
- 2.00-3.00pm Wednesday
TA
- Anuj Gupta: Anuj will help by grading the homework.
Lectures:
-
Lecture: Period 10A (TR 10:00-11:50)
-
X-hour: Wednesday 3:00-3:50pm
-
Room: 212 Sudikoff
Prerequisite
-
CS 25 or equivalent recommended
Referece Texts
The following books are for general reference only
and are not required.
A lot of material covered in the lectures
is not found in the books.
So it is extremely important not to miss any lectures, including x-hours.
-
The Art of Multiprocessor Programming by Maurice Herlihy and Nir Shavit.
ISBN: 0123705916.
-
Synchronization Algorithms and Concurrent Programming by
Gadi Taubenfeld. ISBN: 0131972596.
Publisher: Pearson / Prentice Hall
-
Distributed Computing:
Fundamentals, Simulations, and Advanced Topics,
Second Edition,
by Hagit Attiya and Jennifer Welch.
Published by John Wiley and Sons, Inc.
ISBN 0-471-45324-2
-
Distributed Algorithms
by Nancy Lynch.
Publisher: Morgan Kaufmann Publishers, San Mateo, CA, 1996.
Work
- Written assignments, approximately once a week.
(Homework is assigned on Thursdays and will be due
at the beginning of class the following Thursday.)
-
Takehome final exam (you will have 24 hours to work on it).
-
I might add a third component that involves programming.
Grading
When determining your letter grade for the course,
Homework, including any programming, counts for 70% and the final exam counts for 30%.
Sometimes I assign extra credit problems, which I encourage everyone to try.
I keep track of your performance on extra credit separately from
your score on the regular homework problems,
and take the performance on extra credit into account only
when deciding whether to award an exceptional grade
(namely, A for undergraduates and HP for graduate students).
I expect graduate students to get at least 70% in the course to get P for their grade.
Honor Code
As I explain below, you can collaborate with others in certain ways for homework,
but absolutely no collaboration is allowed for the takehome final exam.
- Homework:
Some problems might be challenging and it is often helpful to discuss them with others.
Feel free to form study groups.
The idea, however, is for everyone to understand the problems and experience
working through the solutions,
and so you should not simply "give" a solution to a classmate.
In particular, each student should write up his or her own homework solutions
and should not read or copy the solutions of others.
For each problem, if you worked on that problem with anyone
(including the professor), you should write down
their names at the start of the solution to that problem.
If you receive any help on homework during office hours, we require that
you don't take any notes during such help sessions.
The idea is that you should understand what we discuss and be able to reconstruct the solution
later on your own.
- Exam:
The rules are different for the final exam: all discussions are prohibited;
you may not discuss the problems with your classmates, professor, or anyone else.
You may not consult with sources other than your class notes and the reference texts;
and you may not consult any electronic sources, including the internet.
-
Dartmouth's Academic Honor Principle applies to this course.
- Please ask me if you have any questions about the honor code as it applies to CS 85/185.
Better safe than sorry.
Disabilities
Students with disabilities enrolled in this course and who may need disability-related accommodations
should make an appointment and see me by October 1. All discussions will be confidential, although
Dartmouth's Student Accessibility Services office may be consulted
to discuss appropriate accommodations.
Religious Observances
Some students may wish to take part in religious observances that occur during this academic term.
If you have a religious observance that conflicts with your participation in the course,
please meet with me by October 1 to discuss appropriate accommodations.
Switch to:
Concurrent Algorithms Home Page
prasad@cs.dartmouth.edu