CSE548
| Course | CSE548 |
|---|---|
| Title | Analysis of Algorithms |
| Credits | 3 - credits |
| Course Coordinator | |
| Description |
Techniques for designing efficient algorithms, including choice of data structures, recursion, branch and bound, divide and conquer, and dynamic programming. Complexity analysis of searching, sorting, matrix multiplication, and graph algorithms. Standard NP-complete problems and polynomial transformation techniques. This course is offered as both AMS 542 and CSE 548. |
| Course Outcomes | |
| Textbook | |
| Major Topics Covered in Course | |
| Laboratory | |
| Course Webpage |
|