COMP 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 |
|---|---|---|---|---|
| W | 6:00 PM - 7:00 PM | Online | 1/20/2024 - 5/17/2024 | Michael Soltys |
| ARR | Online | 1/20/2024 - 5/17/2024 | Michael Soltys |
Status: Closed
Class Number: 1830
Session: Regular Academic Session
Units: 3.00
Class Components: Lecture
Career: Undergraduate
Dates: 1/20/2024 - 5/17/2024
Grading: Letter Grade
Class Availability
Information below is 24 hours old.
Enrollment Total: 35
Available Seats: 0
Wait List Capacity: 10
Wait List Total: 5
Enrollment Information
- Upper Division
- On Line
- Course Fee $12
- Synch/Asynch online