About CS3000
This is an introductory undergraduate course in algorithms. Every computer program can be viewed as an implementation of an algorithm for solving a particular computational problem. The focus of this course is on learning algorithm design techniques for solving the underlying computational problems. We will also look at how algorithms translate to programs, but our emphasis will be on the algorithm design and analysis. In this class, we will:
- Work on a range of computational problems that arise in diverse applications
- Learn how to formulate problems precisely from somewhat informal descriptions
- Learn algorithmic design techniques used to solve the problems
- Learn proof techniques critical for reasoning about algorithms
- Learn analysis techniques critical to determine the efficiency of algorithms
| Topics |
|
| Syllabus | CS3000 Syllabus (Summer 2026) |
Course Staff and Office Hours
Instructor Office Hours begin Wednesday, May 6th.
Dr. Laney Strange (she/her), Instructor
| laneys@northeastern.edu | |
| Web | https://northeastern.edu/home/laney |
| Office Hours | M 1:00-2:30pm (ME 051), W 3:30-5pm (Zoom)
If my office hours don't work for you, send me an email and we'll find another time. |
Dr. Akshar Varma (he/him), Instructor
| ak.varma@northeastern.edu |
Alex Gonzalez (he/him), Academic Coordinator
| a.gonzalez@northeastern.edu |
Lecture Schedule
CS3000 lectures introduce key concepts and dive into examples and applications. Lectures are in-person and attendance is expected. We don't want or expect anyone to come to class when they're sick, though, so we'll post notes after class every day, which you can use to catch up on any missed material.
| CS3000 - Sec 1 (Strange) | MTWR 9:50-11:30am
WVG 102 |
| CS3000 - Sec 2 (Varma) | MTWR 11:40am-1:20pm
WVG 106 |
| CS3001 - Sec 2 (Recitation) | TR 11:40am-12:45pm
SL 031 |
| CS3001 - Sec 3 (Recitation) | TR 1:30-2:35pm
RI 253 |
| CS3001 - Sec 4 (Recitation) | TR 3:20-4:25pm
KA 309 |