This site uses cookies. By continuing to use this site, closing this banner, or clicking "I Agree", you agree to the use of cookies.
Read our cookies policy and privacy statement for more information.
Stand with UkraineDonate
- Home
- Nevada
- University of Nevada-Las Vegas
- Course info
- cs-477 - analysis-of-algorithms
University of Nevada-Las Vegas Course Info
Las Vegas, Nevada•
3 reviews
Course Info
Search for courses by clicking on letters of the alphabet or by using a search bar. Explore course description, number of credits required and course sequences to satisfy graduation requirements.
CS 477
Analysis of Algorithms
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
Units: 3.0
Prerequisites:
MATH 351 - Discrete Mathematics II
Min Grade: C
Min Grade: C
and
CS 302 - Data Structures
Min Grade: C
Min Grade: C