MATH 354 - Analysis of Algorithms
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.
Meeting Information
| Days | Times | Room | Meeting Dates | Instructor |
|---|---|---|---|---|
| MW | 3:00 PM - 4:15 PM | Bell Tower 1372 | 8/22/2015 - 12/21/2015 | Ronald Rieger |
Status: Open
Class Number: 1645
Session: Regular Academic Session
Units: 3.00
Class Components: Lecture
Career: Undergraduate
Dates: 8/22/2015 - 12/21/2015
Grading: Letter Grade
Class Availability
Information below is 24 hours old.
Enrollment Total: 20
Available Seats: 2
Wait List Capacity: 10
Wait List Total: 0
Textbook / Other Materials
Status: RequiredISBN: 9780262033848
Title: Introduction To Algorithms
Publisher: The MIT Press
Author: Cormen, T/Leiserson, C/Rivest,
More textbook information including prices
Enrollment Information
- Upper Division
- Course Fee $12