CS-4104 (CRN 83037)
This course emphasizes the understanding of data structures and algorithms from an analytical perspective rather than from an implementation standpoint. The concepts developed allow discussion of the efficiency of an algorithm and the comparison of two or more algorithms with respect to space and run-time requirements. Analytical methods are used to describe theoretical bounds as well as practical ones. In general, this course addresses the constraints that affect problem solvability.
Instructor: Dr. Adrian Sandu
Office: 2222 KnowledgeWorks II Building
Office hours: By appointment.
“Algorithm Design” by Jon Kleinberg and Eva Tardos. Addison-Wesley, 2006, ISBN 0-321- 29535-8.
For detailed information please consult the syllabus (PDF)
Please check the list of reading topics and assignments.