Algorithms (CS-0160)

Fall 2024 · 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) — Marty Allen
• 01-LEC (Lecture) — Vladimir Podolskii
• RA-RCT (Recitation) — Vladimir Podolskii
• RB-RCT (Recitation) — Vladimir Podolskii
• RC-RCT (Recitation) — Vladimir Podolskii
• RD-RCT (Recitation) — Vladimir Podolskii
• RE-RCT (Recitation) — Vladimir Podolskii
• RF-RCT (Recitation) — Vladimir Podolskii
• RG-RCT (Recitation) — Vladimir Podolskii