CS 413 - Analysis of Algorithms

Units: 3
Asymptotic notation, analysis framework, and efficiency classes, recurrence relations, algorithmic design methodology, searching and sorting algorithms, string matching, heaps and priority queues, doubly-linked and circularly-linked lists; trees and balancing; graph algorithms including breath-first and depth-first search, and hashing.

Prerequisites: CS/MATH 211 and CS 301.
Equivalent Quarter Course: CS 4245
Possible Instructional Methods: Entirely On-ground, Entirely On-line, Hybrid (every section of this course may be taught both online and on-ground).
Grading: A-F grading only.