CS231: Fundamental Algorithms

Spring 2016



Welcome to CS231!

Computer Science 231 is an introduction to the design and analysis of fundamental algorithms in computer science. General techniques covered in the course include divide-and-conquer algorithms, dynamic programming, and greediness. Topics for the course include sorting, searching, graph algorithms, big-data algorithms, and NP-completeness.
Prerequisites: CS230 and MATH225
Distribution: Mathematical Modeling

Course Overview

Instructor: Christine Bassem
Office Hours: Tuesday 10:00am-12:30pm, and 1:30pm-2:30pm; Thursday and Friday 10:00am-12:30pm;

Class Meeting: Tuesdays and Fridays, 8:30am-9:40pm in SCI-E111

SI Hours: Monday 4:30pm-5:30pm and Thursday 7:30pm-8:30pm in SCI-E111

Drop-In Hours: Location: SCI-MicroFocus
Tuesday 7pm-8pm (Elizabeth)
Wednesday 3:30pm-4:40pm (Naomi)
Wednesday 8pm-9pm (Hye Sun)
Sunday 7pm-8pm (Hye Sun)
Sunday 8pm-9pm (Elizabeth)
Monday 7pm-9pm (Sappha)



The text for the course is the third edition of Introduction to Algorithms, written by Thomas Cormen, Charles Leiserson, Ronald Rivest, and Clifford Stein, and published by MIT Press, Cambridge, Massachusetts.



CS231 course materials will be available on the course website as PDF files, which can be viewed and printed using the freely available Adobe Acrobat Reader program.