COT 5407 - Introduction to Algorithms

Fall 2010

Course Times

Section 1: Tue and Thu 11:00 - 12:15 PM in GL-139.
Section RH1: FEEDS course, delivered online

Instructor

Office Hours

You are free to stop by my office ECS-353 any time you can find me. My office hours represent a time when I am (more or less) guaranteed to be available. This semester this is Tuesday and Thursday 9:30 - 10:45 AM, and after 1:45 PM on Thursdays only. My office phone is FIU-2036.

Course grading

Grading will be based on homework assignments, a midterm, and a final exam. The midterm and final exam will be in-class, and all students, including FEEDS students must attend the on campus exam. Any exceptions must be discussed with the instructor, and approved in advance.

Catalog Description

Design of efficient data structures and algorithms; analysis of algorithms and asymptotic time complexity; graph, string, and geometric algorithms; NP-completeness.

Prerequisite

CS graduate student

Objectives

Students will learn techniques for designing efficient algorithms, for elementary analysis of algorithms, for proving lower bounds, and for proving intractability.

Syllabus

Recurrence Relations and Analysis of Algorithms
Incremental and Divide-and-Conquer Algorithms
Sorting and Order Statistics
Lower Bound Arguments
Basic data structures: trees, hash tables, priority queues, union/find
Graphs & Graph Algorithms
Dynamic Programming & Greedy Algorithms
NP-Completeness

Textbook:

Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein, Introduction to Algorithms, Third Edition, (MIT Press, 2009).

Additional Policies for FEEDS Students

Students enrolled in the FEEDS section should read and undertand the FEEDS policies. Information on the blackboard accounts will be forthcoming once the accounts available for use.