| CS 451 P - Design & Analysis of Algorithm | |
|---|---|
| Full title: | Design and Analysis of Algorithms |
| CRN: | 20008 |
| Course description: | Principles and concepts for design and analysis of correct and efficient algorithms, including greedy algorithms, divide and conquer methods, dynamic programming. Time and space complexity of algorithms, incuding amortized analysis. Prerequisite: CS 357. (Even S) |
| Instructor: | Juyen Janet Hung (Juyen.Hung@enmu.edu) |
| Seating | |||||
|---|---|---|---|---|---|
| Current | Waitlist | ||||
| Max | Curr | Avail | Max | Curr | Avail |
| 20 | 5 | 15 | 20 | 0 | 20 |
| Grading | |
|---|---|
| Grade mode: | Normal (A,B,C,D,F,I,W) |
| Course dates | |
|---|---|
| Starts: | January 13, 2014 |
| End: | May 9, 2014 |
| Weeks: | 16 |
| Census date: | January 31, 2014 |
| Registration dates: | November 10, 2013 - January 20, 2014 |
| Last day to drop: | January 20, 2014 |
| Last day to withdraw: | April 11, 2014 |
| Meeting dates and times | ||||||||
|---|---|---|---|---|---|---|---|---|
| Days | Time | Location | ||||||
| M | W | F | 09:00am - 09:50am | University Computer Center 107 | ||||
| Course Pre-requisites | |||||
|---|---|---|---|---|---|
| ( | Test | Test score | Course | ) | Connector |
| ( | CS 357 P | ) | |||