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

Info current as 5/1/2024
Days Times Room Meeting Dates Instructor
TTH  4:30 PM  -  5:45 PM  DEL NORTE 1535 8/24/2019 - 12/20/2019 Ryan McIntyre

Status: Closed
Class Number: 2830
Session: Regular Academic Session
Units: 3.00
Class Components: Lecture
Career: Undergraduate
Dates: 8/24/2019 - 12/20/2019
Grading: Letter Grade

Class Availability

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

Textbook / Other Materials

Status: Required
ISBN: 9789813235922
Title: An Introduction to the Analysis of Algorithms
Publisher: World Scientific Pub Co., Inco
Author: Soltys

Status: Required
ISBN: 9789813235908
Title: Intro to the Analysis of Algorithms
Publisher: World Scientific Pub Co., Inco
Author: Soltys

More textbook information including prices

Enrollment Information

  • Upper Division
  • Course Fee $12