Class Number: 1985
Description: Hours: Three hours lecture per week
Prerequisite: MATH 300
Description: Computer-oriented study of semi-numerical and non-numerical algorithms. Topics include: sorting, tree searching, generation of combinatorial structures, algorithm proof techniques, best algorithms, programming complexity, and string matching. Some computer programming experience required.
| Days | Time | Date Range | Location | Instructor |
|---|---|---|---|---|
| MW | 03:00 PM - 04:15 PM | 01/18/2014 - 05/16/2014 | Bell Tower 1372 | Ronald Rieger |
Status: Open
Session: Regular Academic Session
Units: 3.00
Class Components: Lecture
Career: Undergraduate
Start Date: 01/18/2014
End Date: 05/16/2014
Grading: Letter Grade
Class Availability
Information below is 24 hours old.Enrollment Total: 13
Available Seats: 9
Wait List Capacity: 10
Wait List Total: 0
Textbook / Other Materials
Textbook Status: Required
ISBN: 9780262033848
Title: Introduction To Algorithms
Author: Cormen, T/Leiserson, C/Rivest,
Publish: The MIT Press
More textbook information including prices
Enrollment Information
- Upper Division
Notes
- Prerequisite course required. Consult CSUCI Catalog
- This course has an associated class MATH 399 Lab. Please register for Math 399 section 4 (Class Nbr 1989) or Math 399 section 9 (Class Nbr 1994). Students unable to register for the Lab assigned time may register for Math 399 section 10 (Class Nbr 1995).