DESCRIPTION

(3 semester credit hours) The study of efficient algorithms for various computational problems. Algorithm design techniques. Sorting, manipulation of data structures, graphs, matrix multiplication, and pattern matching. Complexity of algorithms, lower bounds, NP completeness.

Prerequisites: CS 5333 and CS 5343.

COURSE INFORMATION

[Syllabus]

Instructor of record: Dr. Benjamin Raichel

Teaching Assistant of record: William T. Doan

COURSE RELEVANCE

The study of algorithms is in itself well-motivated and profound. A keen eye for algorithms will always find an avenue for opportunity. Not only will this course instill in its students a rigor and precision in their thinking, it will also reveal the techniques used by researchers on the frontier of computer science. If nothing else, this course will expand the minds of students to critical thinking skills useful in any interview and to any industrial role.

NOTES

Some notes have been included for this course. They follow Dr. Raichel's prescribed course topics, but there are certain areas where the notes herein deviate, namely in presentation, example choice, and the addition of other topics. These notes are meant to enrich the course and are offered to the student for their intellectual curiosity.

Of course, every effort will be made to maintain them. However, as is natural, certain events may arise and take away time. Dictational discretion is taken and student consideration of this is highly appreciated.

[Notes]

pwd: /~wtd/TEACHING/grad_algos.html