MATH 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

Status: Closed
Class Number: 2125
Session: Regular Academic Session
Units: 3.00
Class Components: Lecture
Career: Undergraduate
Dates: 1/17/2025 - 5/16/2025
Grading: Letter Grade

Class Availability

Information below is 24 hours old.
Enrollment Total: 30
Available Seats: 0
Wait List Capacity: 15
Wait List Total: 8

Enrollment Information

• Upper Division
• Course Fee $12
• Synch/Asynch online

Notes