Course Listings

Computer Science

CS 351 Analysis of Algorithms (4)

In this course students will study methods to analyze algorithms for their correctness and run time efficiency as well as general design and analysis techniques. Topics include: asymptotic analysis, searching and sorting algorithms, divide and conquer techniques, greedy algorithms, dynamic programming, graph algorithms, efficient data structures, and NP-completeness.

  • General Education Requirement Fulfillment: Mathematical Sciences
  • Prerequisite: CS 152 and MATH 251 
  • Offering: Spring
  • Instructor: Staff

Back to Top