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 | 2149 | LEC | W | 06:00 PM - 07:00 PM | Online | Michael Soltys |
|
| 1 | 01 | 2149 | LEC | ARR | Online | Michael Soltys |
|
|
| 1 | 02 | 2484 | LEC | M | 06:00 PM - 09:00 PM | Sierra Hall 1222 | Ronald Rieger |
|
Key for Course Detail Icons
| = Course Open |
= Course Closed |
= Course Details |
 = Textbook Info |
 = General Education |
 = Extended University |
 = Service Learning |
= In Person |
 = Asynchronous Online |
 = Synchronous Online |
= Synchronous/Asynchronous |
 = Blended |
 = No Cost Course Materials |
 = Low Cost Course Materials |