MATH 354 - Analysis of Algorithms
Show Details for Open Courses Only
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.
Units: 3.00
Grading: Letter Grade
| Session | Section | Class # | Type | Days | Time | Location | Instructor | Course Details [Key] |
|---|---|---|---|---|---|---|---|---|
| 1 | 01 | 1949 | LEC | ARR | Online | Michael Soltys |
|
|
| 1 | 01 | W | 6:00 PM - 7:00 PM | Online | Michael Soltys |
|
Key for Course Detail Icons
= Course Open - = Course Closed
= Course Details 
= Textbook Info
= General Education
= Extended University
= Service-Learning
= In Person Course
= Asynchronous Online Course
= Synchronous Online Course
= Synchronous/Asynchronous Course
= No Cost Course Materials
= Low Cost Course Materials