Welcome to Comp 160's official Webpage. In here you will find lots of information related to the course.
General information (on this page):
When and where is class?
Who is teaching?
Who are your TAs?
Whom should you contact?
How to write proofs
Textbook, prerequisites, topics
Tips on doing well
Grading (and an important note)
How to submit homework
Tufts policies, and the consequences of academic dishonesty
Schedule: Detailed schedule of all events related to the course.
Reading: Organized by topic; class notes, links, videos and textbook references.
The in-class exams and the final exam will include questions similar to those included on homework
assignments and will draw on material covered in lecture and/or in the
reading. No collaboration or devices are allowed on examinations.
We have office hours From Monday to Friday and Sundays (full breakdown of office hours is available in the schedule page).
Any cancellations, one-time location changes or additional hours will be posted in Piazza. Whenever possible, a note will also be written on the whiteboards in the collaboration room.
Whom to contact, and when:
A great source of information is this website. First make sure the answer to your question isn't already in here (e.g., when is the exam, when are office hours, etc)
If you still have questions, we can be reached in the following ways:
One page syllabus
We summarized the most important information of this webpage into a 1 page PDF. You can download it in this link. Make sure to print it and carry it around with you.
How to write proofs
We also did a short summary containing the key points on how to write proofs. You can download it in this link. In addition to our guide, there are tons of similar guides in the web. We encourage you to look around for those resources whenever you have some time.
[CLRS] T. H. Cormen, C. L. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms (3nd edition). MIT Press, 2009.
More info at MIT press.
Although not textbook is required, it is strongly encouraged that you get access to a copy. Two copies have been permanently reserved in the Tisch library for students to access. Note: the book is massive and contains more content that what can be covered in a single course. The exact list of topics by lecture is available in the schedule page.
[KT] J. Kleinberg, E. Tardos. Algorithm Design, Addison-Wesley, 2005.
[DPV] S. Dasgupta, C.H. Papadimitriou, and U.V. Vazirani. Algorithms, McGraw-Hill, 2006.
[S] S. Skiena, The Algorithm Design Manual, (2nd edition) Springer, 2010.
[BVG] S. Baase and A. Van Gelder, Computer Algorithms, 3rd edition, Addison-Wesley, Reading, MA, 2000.
Tips for doing well in this course:
Students are expected to attend class and recitation regularly and to complete regular reading assignments. we will not check for attendance nor it will have any direct influence your grade. You are welcome to use the slides and lecture recording of the previous instructor (Prof. Greg Aloupis), but please note that this material is for reference only. Students are responsible for knowing what was taught during this semester, which will include the instructors variations. The course will have topics that have not been recorded and those topics will come in the exam. In other words, please come to class. Graded course work will include regular homework sets, three partial exams, and one final examination.
Each week you will be given an assignment to practice the material discussed in class. Individual completion and regular submission of the homework with full attribution of sources is a prerequisite for passing this course.
NOTE: Groups of people may work together at the outset, discussing and strategizing how to solve problems, and various other sources may be consulted, subject to the following conditions:
Your final grade will be based on:
Final grade = 20%(Homework) + 3x20%(each of the three midterms) + 20%(Final exam)
Note: do not assume that the numerical score you receive on homework or exams directly corresponds to a particular letter grade. Your score is just a number that lets us figure out who is doing better or worse than the median, so don't panic if you think you scored low. An evaluation of your performance will be given after the first exam. As an example, homework scores have often averaged around 85% where exam scores have often had a median between 60% and 65%, and an 85% is excellent.
How to submit homework and receive grades
On academic integrity
Students and instructors of this course are to respect the following:
The in-class exams and the final exam will include questions similar to those included on homework assignments and will draw on material covered in lecture and/or in the reading. No collaboration or devices are allowed on examinations.