|
CS/SE
Course Assessment |
 |
| |
Search: |
|
|
| |
|
|
Course
Numbers |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
CS 4336 |
| |
| |
| |
| |
| |
| |
CS 4386 |
| |
| |
| |
| |
| |
| |
|
Class
Learning Objectives
CS 4349 Advanced Algorithm Design and Analysis
Ability to use general asymptotic notations
Ability to solve recurrences
Ability to perform general analysis and proof of correctness
of algorithms
Ability to design, analyze and where applicable prove correctness
or
optimality of algorithms using:
- Divide-and-Conquer techniques
- Greedy techniques
- Dynamic Programming techniques
Ability to perform analysis and proof of correctness
of graph algorithms
|
|
|
|
|
|