COT 5407 - Introduction to Algorithms
Fall 2012
Course Times
- Section RVC: delivered online
Instructor
Prof. Mark Allen Weiss
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 2:00 - 3:15 AM,
though I am around most days.
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
must attend the on campus exam.
Any exceptions must be discussed with the instructor, and approved in advance.
The timing will be determined in a manner that avoids conflicts with other classes.
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).