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 | Sierra Hall 2344 | 8/27/2016 - 12/23/2016 | Michael Soltys |
Status: Closed
Class Number: 1509
Session: Regular Academic Session
Units: 3.00
Class Components: Lecture
Career: Undergraduate
Dates: 8/27/2016 - 12/23/2016
Grading: Letter Grade
Class Availability
Information below is 24 hours old.
Enrollment Total: 26
Available Seats: 0
Wait List Capacity: 10
Wait List Total: 0
Textbook / Other Materials
Status: RequiredISBN: 9789814401159
Title: Intro to the Analysis of Algorithms
Publisher: World Scientific Pub Co., Inco
Author: Soltys
More textbook information including prices
Enrollment Information
- Upper Division
- Course Fee $12