Course	Section	Credits	Instructor	Dates	Status	Call Number
CS 477	1002	3 (3 max credits)	Bein Wolfgang	Aug. 26, 2024 to Dec. 7, 2024	Open	82825

Description

Analysis of the time and space complexity of algorithms. Techniques for efficient algorithm design and effect of structure choice on efficiency. Fast algorithms for problems such as set, graph and matrix manipulations, pattern matching, sorting, and storage organization. Exponential time problems and introduction to NP-completeness. This course is crosslisted with CS 677. Credit at the 600-level requires additional work.

Prerequisites

Notes

This is an Internet class; refer to Canvas instructions at https://unlv.instructure.com.

This data is for informational purposes only. Please see http://my.unlv.edu for a full catalog and more information.