CSC 282: Design and Analysis of Efficient Algorithms

CRN:
28530
Credit Hours:
4.0
Previous Offerings:

How does one design programs and ascertain their efficiency? Divide-and-conquer techniques, string processing, graph algorithms, mathematical algorithms. Advanced data structures such as balanced tree schemes. Introduction to NP-completeness and intractable combinatorial search, optimization, and decision problems.

CRN Course Course Title Term Credits Status
28530 CSC 282 DESIGN & ANALYSIS OF EFFICIENT ALGORITHMS Fall 2012 4.0 Closed
Schedule: Day Begin End Building Room
  TR 1105 1220 CSB 209
Enrollment: Sec Enroll Sec Cap Updated
  57 45 11/23/2011