Statistics
SE 155
Introduction to the Design and Analysis of Algorithms
-
0 Reviews
Algorithm design techniques: dynamic programming, greedy algorithms, Euclidean and extended Euclidean algorithms, Discrete and Fast Fourier transforms. Analysis of algorithms, intractable problems and NP-completeness. Additional topics selected from: selection algorithms and adversary arguments, approximation algorithms, parallel algorithms, and randomized algorithms.
Prerequisite(s): CS 146 (with a grade of “C-” or better); Allowed Majors: Computer Science or Applied and Computational Mathematics; or instructor consent.
3 unit(s) Units
-
Average Grade
-
Would Take Again
Rating Distribution
Grade Distribution
- Schedule(s)
- Review(s)
--- -, ----
---
Quality
0
Ease
0
Grade: -
•
Take again: -
Lorem ipsum dolor sit amet, consectetur adipiscing elit. Nullam nec purus nec libero ultricies lacinia. Nullam nec purus nec libero ultricies lacinia.
OVERALL
-
--- -, ----
---
Quality
0
Ease
0
Grade: -
•
Take again: -
Lorem ipsum dolor sit amet, consectetur adipiscing elit. Nullam nec purus nec libero ultricies lacinia. Nullam nec purus nec libero ultricies lacinia.
OVERALL
-
--- -, ----
---
Quality
0
Ease
0
Grade: -
•
Take again: -
Lorem ipsum dolor sit amet, consectetur adipiscing elit. Nullam nec purus nec libero ultricies lacinia. Nullam nec purus nec libero ultricies lacinia.
OVERALL
-