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 |
|---|---|---|---|---|
| TTH | 4:30 PM - 5:45 PM | Sierra Hall 1411 | 8/20/2022 - 12/10/2022 | Ronald Rieger |
Status: Open
Class Number: 1742
Session: Regular Academic Session
Units: 3.00
Class Components: Lecture
Career: Undergraduate
Dates: 8/20/2022 - 12/10/2022
Grading: Letter Grade
Class Availability
Information below is 24 hours old.
Enrollment Total: 39
Available Seats: 1
Wait List Capacity: 10
Wait List Total: 0
Textbook / Other Materials
Status: RequiredISBN: 9780262046305
Title: Intro to Algorithms
Publisher: MIT Press order from Random Ho
Author: Cormen
More textbook information including prices
Enrollment Information
- Upper Division
- Course Fee $12
- Includes any In Person Meeting