CMPS 2200 Introduction to Algorithms
Fall 12

[ Home | Policies | Schedule | Slides, pictures | Homework | Resources ]

Home

Class Description:

This course will survey the design and analysis of algorithms. We will study several basic algorithmic paradigms (e.g. divide-and-conquer, dynamic programming, the greedy approach and randomization), their application to core problems in graph theory and optimization, as well as analysis of time and space complexity. Our focus will be on understanding these paradigms and studying the algorithmic problems that can be solved using that particular paradigm with respect to particular application areas.

For each of the topics above, we will consider a number of different application areas (e.g. divide-and-conquer algorithms for scientific computing, sorting, etc.). At the end of this course, students should be able to:


Prerequisites:

You must have completed CMPS 1500, CMPS 1600 prior to enrolling, and MATH 2170 is a co-requisite.

Class webpage:

http://www.cs.tulane.edu/courses/cmps2200/

Time & Place:

Lectures: MW 3:00pm - 4:15pm, GI 400D
Labs: T 2:00pm - 3:15pm, GI 400D

Textbooks:

Required textbook: Algorithms by Dasgupta, Papadimitriou, Vazirani
(A free preliminary version of the textbook is available
electronically.)

Optional textbook for reference: Introduction to Algorithms, 3rd Edition; Cormen, Leiserson, Rivest, and Stein; MIT Press.

Instructor:

Carola Wenk
Stanley Thomas, 303F
E-mail: cwenk  -at-   tulane  -dot-   edu
Phone: 504-865-5805
Office hours: MW 4:30pm - 5:30pm, and by appointment

Teaching Assistant:

Jordan Martin
E-mail: jmartin5  -at-   tulane  -dot-   edu
Office hours: M 11am-noon, and by appointment


Last modified by Carola Wenk,   cwenk  -at-   tulane  -dot-   edu,