Class Number: 2150
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 | 06:00 PM - 07:15 PM | 01/20/2018 - 05/25/2018 | Bell Tower 1372 | Ronald Rieger |
Status: Closed
Session: Regular Academic Session
Units: 3.00
Class Components: Lecture
Career: Undergraduate
Start Date: 01/20/2018
End Date: 05/25/2018
Grading: Letter Grade
Class Availability
Information below is 24 hours old.Enrollment Total: 22
Available Seats: 0
Wait List Capacity: 15
Wait List Total: 0
Textbook / Other Materials
Textbook Status: Required
ISBN: 9780262533058
Title: Intro to Algorithms (INTL ED)
Author: Cormen
Publish: MIT Press
Textbook Status: Required
ISBN: 9780262258104
Title: Introduction to Algorithms
Author: Cormen
Publish: MIT Press
More textbook information including prices
Enrollment Information
- Upper Division
- Course Fee $12