Jump to Menu

• Undergraduate Spring 2013
• Computer Science
• THEORY OF ALGORITHMS

THEORY OF ALGORITHMS

2013 Spring Term

Computer Science 433

This course is a survey of algorithms needed for searching, sorting, pattern matching, analyzing graphs, and a variety of other problems of discrete mathematics. Analysis of algorithm efficiency and space/time tradeoffs are discussed.

Other Requirements: PREREQ: (MCS 231 OR COMPSCI 223) OR (MATH 280 AND EITHER COMPSCI 172 OR COMPSCI 174)

Class Schedule

There are no sections offered for this course and term that meet your criteria.