MATH 354 - Analysis of Algorithms
Show Details for Open Courses Only
Description
Hours: Three hours lecture per week Prerequisite: MATH 300 and some computer programming experience 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.
Units: 3.00
Grading: Letter Grade
| Section | Class # | Type | Days | Time | Location | Instructor | Course Details [Key] |
|---|---|---|---|---|---|---|---|
| 01 | 1325 | LEC | MW | 12:00 PM - 1:15 PM | Sierra Hall 1422 | Michael Soltys-Kulinicz |
|
Key for Course Detail Icons
= Course Open - = Course Closed
= Course Details - = Textbook Info
= General Education
= Extended University
= Service-Learning
= Blended
= Online
= No Cost Course Materials