CS 477

Analysis of Algorithms

3credits
About this course

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.

All available terms

26 terms

Avg. GPA
3.30
Grades
1,285

Other grades

W1.6%
More course details

University of Nevada, Las Vegas

CS 477 at UNLV: average GPA 3.30 across 1,285 students. Grade distribution by term. Analysis of the time and space complexity of algorithms. Techniques for…

Average GPA: 3.30

Grade distribution records: 1,285 students across 26 terms.

Grade distribution

GradeStudentsPercent
A41532.3%
A-20816.2%
B+19715.3%
B19815.4%
B-886.8%
C+483.7%
C645.0%
C-50.4%
D+30.2%
D131.0%
F251.9%
W211.6%

Based on 1,285 student grade records across 26 terms and 5 professors.

Instructors

Related courses

The course page is taking longer to load. This summary is still available.

We could not load the full course details. This summary is still available.

Still loading. This can take a moment on a slow connection.

Loading My Class Grades