02-713 Algorithms & Data Structures (for Scientists)

Spring 2014

Course Information:

Course Description: Introduction to design and analysis of algorithms and data structures. Where appropriate, emphasis is placed on techniques that are useful for the analysis of scientific data. Topics include dynamic programming, linear programming, network flows, local and heuristic search, and randomization. NP-completeness and approximation algorithms may also be covered. Data structures discussed will include balanced trees, priority queues, and string data structures. Minimal previous algorithmic knowledge is assumed. Classwork will include programming assignments, but strong programming skills are not required.

Instructor: Carl Kingsford
Associate Professor, Ray and Stephanie Lane Center for Computational Biology, School of Computer Science, Carnegie Mellon University.

Office: GHC 7705
Office Hours: Fridays, 11-12

TA: David Farrow, dfarrow@andrew, Office: GHC 7411; Office Hours: W 11-noon; F 12:30-1:30

TA: Devin Sullivan, devsullivan@gmail, Office: GHC 7411; Office Hours: M 2-3, Tu 11:30-12:30

Grader: Kaiyuan Tang, kaiyuant@andrew, no office hours, but feel free to email with questions.

TA: Emre Sefer, esefer@cs, Office: GHC 7411, Tu 1:30-2:30, Th 10:45-11:45

To email all the course staff: 02-713staff@lists.andrew.cmu.edu --- this is the best email address to use for questions, etc.

Course Time and Location: MWF 9:30-10:20am; DH A302. The course is cross-listed as 02-513.

Estimated Coursework: Coursework will consist of near weekly homeworks that will include algorithm design and analysis problems and some programming assignments, 2 midterms, and a final.

Textbook: Algorithm Design by Jon Kleinberg and Éva Tardos, ISBN 0-321-29535-8.

Announcements & Assignments