2013-2014

Course Listings

Computer Science

CS 343 Analysis of Algorithms (1)

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.

  • Prerequisite: CS 241 and MATH 163 or MATH 251 (may be taken concurrently)
  • Offering: Spring
  • Instructor: Staff

Jump to a Discipline

Jump to a Discipline's
Learning Outcomes

Jump to a Specific Course