Algorithms (CS-0160)

Fall 2026 · CS 0160 · Tufts University · 4 credits · Undergraduate

Introduction to the study of algorithms. Strategies such as divide-and-conquer, greedy methods, and dynamic programming. Graph algorithms, sorting, searching, integer arithmetic, hashing, and NP-complete problems. High demand (see "course notes" for signup procedure).

Course codes: CS-0160, CS 0160, CS0160, CS-160, CS 160, CS160

• M1-LEC (Lecture) — Andrew Winslow
• 01-LEC (Lecture) — Karen Edwards
• 02-LEC (Lecture) — Karen Edwards
• RA-RCT (Recitation) — Karen Edwards
• RB-RCT (Recitation) — Karen Edwards
• RC-RCT (Recitation) — Karen Edwards
• RD-RCT (Recitation) — Karen Edwards
• RE-RCT (Recitation) — Karen Edwards
• RF-RCT (Recitation) — Karen Edwards
• RG-RCT (Recitation) — Karen Edwards
• RW-RCT (Recitation) — Karen Edwards