COMP 354 - Analysis of Algorithms

Show Details for Open Courses Only

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.

Units: 3.00
Grading: Letter Grade

Info has been updated in the last 30 minutes
Session Section Class # Type Days Time Location Instructor Course Details [Key]
1 01 1948 LEC ARR Online Michael Soltys Course Closed Class Details
1 01 W  6:00 PM  -  7:00 PM  Online Michael Soltys Course Closed Class Details

Key for Course Detail Icons

  • Course open= Course Open
  • course closed= Course Closed
  • course details= Course Details
  • textbook info= Textbook Info
  • General Education Class= General Education
  • Extended University Class= Extended University
  • Service Learning Class= Service-Learning
  • In Person Course= In Person Course
  • Asynchronous Online Course= Asynchronous Online Course
  • Synchronous Online Course= Synchronous Online Course
  • Synchronous/Asynchronous Course= Synchronous/Asynchronous Course
  • No Cost Course Materials= No Cost Course Materials
  • Low Cost Course Materials= Low Cost Course Materials