CS 601 - Advanced Algorithms

Units: 3
Design, analysis, and implementation of algorithms; asymptotic notation and efficiency classes; recurrence relations; advanced searching and sorting techniques; string matching; heaps and priority queues; linked structures; balanced and threaded trees; graph algorithms; heuristics; intractable problems; other advanced techniques. Programming projects.

Prerequisites: CS 401 and CS 413; or M.S. Computer Science major.
Credit Restrictions: Open to M.S. or B.S. Computer Science majors only.
Possible Instructional Methods: Entirely On-ground.
Grading: A-F grading only.
Student Learning Outcomes - Upon successful completion of this course students will be able to:

Apply prior knowledge of standard data structures to select an appropriate representation method.
Design and develop advanced algorithms to perform intricate tasks.
Create complex and correct computer programs. compare and critique the time efficiency, space efficiency, and resource demands of novel algorithms.
Analyze the complexities of various computational problems in different domains.