CSC 282: Design and Analysis of Efficient Algorithms

CRN:
29591
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
29591 CSC 282 DESIGN & ANALYSIS OF EFFICIENT ALGORITHMS Fall 2013 4.0 Open
Schedule: Day Begin End Building Room
  TR 1105 1220 MEL 221
Enrollment: Sec Enroll Sec Cap Updated
  46 60 11/28/2012