Algorithms, Winter 2025

Course Description and Learning Objectives

This is a course which teaches the basics of design and analysis of algorithms. Simply put, an algorithm is a step-by-step procedure to solve a problem, and forms the bedrock of computer science. The learning objectives of this course are:

• describe an algorithm precisely and succinctly  
• analyze the correctness and efficiency (running times) of algorithms 
• learn some basic algorithmic techniques and some classic algorithms for fundamental problems
• use the above knowledge to adapt them for solving different problems
• design new algorithms

From a computer science perspective, the above objectives will make a student better problem solvers and programmers. Although the course is primarily theoretical, there are avenues for programming where students can hone their coding skills. 

Logistics

• Prerequisites: COSC 30 or equivalent. See this.
• Lectures: 9L hour (M-W-F, 8:50 - 9:55,  X-hour on Th, 9:05-9:55) 
• Class Venue:  Cummings 100 (Spanos Auditorium)
• Discussions: via Ed Discussion Links to an external site.
• Work Submissions:  (mostly) Gradescope Links to an external site.
• Textbook:  Lecture notes and plenty of practice problems (with solutions) will be posted. No particular textbook needed, but these are good:
  • Erickson: Algorithms (this is freely available here: https://jeffe.cs.illinois.edu/teaching/algorithms/ )
  • Dasgupta, Papadimitriou, Vazirani: Algorithms
  • Roughgarden: Algorithms Illuminated
  • Cormen, Leiserson, Rivest, Stein: Introduction to Algorithms 
  • Kleinberg, Tardos: Algorithm Design
    
• Read these:  
  • Best Practices 
  • Honor Principle vis-a-vis COSC 31, W25
  • Policies
  • Instruction Staff, Office Hours, & Problem Solving Sessions

Evaluation

(tl;dr) weekly problem sets (45%) and three "in-class" exams (55%), with lots of extra credit options. Details: see  Deliverables and Evaluation

Consent to Record

Accessibility Needs

Students requesting disability-related accommodations and services for this course are required to register with Student Accessibility Services (SAS; Apply for Services webpage; student.accessibility.services@dartmouth.edu; 1-603-646-9900) and to request that an accommodation email be sent to me in advance of the need for an accommodation. Then, students should schedule a follow-up meeting with me to determine relevant details such as what role SAS or its Testing Center may play in accommodation implementation. This process works best for everyone when completed as early in the quarter as possible. If students have questions about whether they are eligible for accommodations or have concerns about the implementation of their accommodations, they should contact the SAS office. All inquiries and discussions will remain confidential.

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 before the end of the second week of the term to discuss appropriate accommodations.