CS35: Data Structures and Algorithms
Spring 2026

Introduction

This course continues the broad introduction to computer science begun in CS21, providing a general background for further study in the field. By concentrating on data structures and algorithms, you will obtain the basic building blocks by which all large software projects are built. These topics are central to every sub-discipline in computer science, and also connect to central concepts across the sciences. Topics to be covered include object-oriented programming in C++, advanced data structures (such as priority queues, trees, hash tables, and graphs), advanced algorithms, as well as software design and verification. At the end of this course, you will have obtained the ability to successfully analyze problems in the discipline. You will also take your first steps towards developing the skills necessary to synthesize and evaluate the most fundamental questions in the field.

Course Basics

Schedule
Lecture (Lila Fontes): Tue., Thu. 9:55am - 11:10am, Martin 213
Lab A (Lila Fontes and Charles Kazer) Thursday 1:05pm - 2:35pm, Martin 327
Lab B (Lila Fontes and Charles Kazer) Friday 2:00pm-3:30pm, Martin 327

Contact Information
Professor: Lila Fontes
Email: fontes at cs.swarthmore.edu
Office: Martin 210
Lecturer: Charles Kazer
Email: ckazer at cs.swarthmore.edu
Office: Martin 330