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

Info current as 5/15/2024
Days Times Room Meeting Dates Instructor
MW  6:00 PM  -  7:15 PM  Bell Tower 1372 1/20/2018 - 5/25/2018 Ronald Rieger

Status: Closed
Class Number: 2150
Session: Regular Academic Session
Units: 3.00
Class Components: Lecture
Career: Undergraduate
Dates: 1/20/2018 - 5/25/2018
Grading: Letter Grade

Class Availability

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

Textbook / Other Materials

Status: Required
ISBN: 9780262533058
Title: Intro to Algorithms (INTL ED)
Publisher: MIT Press
Author: Cormen

Status: Required
ISBN: 9780262258104
Title: Introduction to Algorithms
Publisher: MIT Press
Author: Cormen

More textbook information including prices

Enrollment Information

  • Upper Division
  • Course Fee $12