CS 385 Algorithms
Run time
Calculate the asymptotic running time of standard algorithms.
BS
CS
J
tradeoffs
BS
CyS
J
tradeoffs
Big O
Explain the meaning of big Oh, Theta, and Omega
notations and use them to reason about the performance of
diverse algorithms.
BS
CS
A
apply
BS
CyS
A
apply
Master Theorem
Use the Master Theorem to prove asymptotic assumptions.
BS
CS
A
apply
BS
CyS
A
apply
Graph algorithms
Implement standard algorithms using graphs and
weighted graphs in C++ (e.g. DFS, BFS, MST, topological sort).
BS
CS
I
currency
BS
CyS
I
currency
Sorting algorithms
Compare and analyze basic and advanced sorting algorithms.
BS
CS
I
currency
BS
CyS
I
currency
Search trees
Implement advanced search trees such as B-tree, AVL
tree, 2-3 tree and red-black tree.
BS
CS
I
currency
BS
CyS
I
currency
Numerical algorithms
Implement numerical algorithms such as the sieve of
Erastosthenes, Gaussian
elimination, binary exponentiation, Horner's method, and the simplex method.
BS
CS
I
currency
BS
CyS
I
currency
Apply design techniques
Apply standard algorithm design techniques such as
the greedy technique, dynamic programming, hashing, space/time
trade-offs, reduction, backtracking, and branch-and-bound.
BS
CS
C
design
BS
CyS
C
design
Testing
Design and implement a test plan for each assignment
BS
CS
C
design
BS
CyS
C
design