Computer Science
| CS3383 | Algorithm Design and Analysis | 4 ch (3C 1T) |
|---|---|---|
This course examines the characteristics of algorithms that lead to efficient computer solutions for discrete problems. A variety of different algorithm classes and design techniques, including divide and conquer, greedy, dynamic programming, and backtracking, are introduced and compared. Algorithmic strategies and computational techniques used for distributed systems and intelligent systems are are also examined. Prerequisites: CS 2333 , ( CS 2383 or CS 3323 ), and ( STAT 2593 or STAT 3083 ). Note: Credit is only given for one of CS 3383, CS 3913 and CS 3933 . | ||
