Introduction to Algorithm Analysis and Design
Introduces methods for algorithm design, paradigms such as divide and conquer, greedy, and dynamic programming, and techniques for algorithm analysis, such as asymptotic notations, estimates and recursions. Topics include sorting, searching, scheduling, string matching, graph algorithms, computational geometry, and more.
None presently available.
CSE 191, CSE 250, MTH 142 MTH 142, CSE 250
| Semester | Section | Title | Instructor | Credit Hours | Enrolled |
|---|---|---|---|---|---|
| Fall 2013 | LR | Intro To Algorithms | Dr. Atri Rudra | 4 | 90/110 |
| Summer 2013 | LR | Intro To Algorithms | Jesse Hartloff | 4 | 9/40 |
| Fall 2012 | LR | Intro To Algorithms | Dr. Atri Rudra | 4 | 85/100 |
| Fall 2011 | LR | Intro To Algorithms | Dr. Atri Rudra | 4 | 81/100 |
| Fall 2010 | LR | Intro To Algorithms | Dr. Atri Rudra | 4 | 90/100 |
| Fall 2009 | LR | Intro To Algorithms | Dr. Atri Rudra | 4 | 54/90 |
| Spring 2009 | LR | Intro To Algorithms | Dr. Russ Miller | 4 | 71/75 |