| CS 451 P - Design and Analysis of Algorit | |
|---|---|
| Full title: | Design and Analysis of Algorithms |
| CRN: | 20004 |
| 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) |
| Crosslist group: | GT |
| Instructor: | Juyen Janet Hung (Juyen.Hung@enmu.edu) |
| Seating | ||||||||
|---|---|---|---|---|---|---|---|---|
| Current | Waitlist | Crosslist | ||||||
| Max | Curr | Avail | Max | Curr | Avail | Max | Curr | Avail |
| 20 | 13 | 7 | 20 | 0 | 20 | 30 | 20 | 10 |
| Grading | |
|---|---|
| Grade mode: | Normal (A,B,C,D,F,I,W) |
| Course dates | |
|---|---|
| Starts: | January 18, 2016 |
| End: | May 13, 2016 |
| Weeks: | 16 |
| Census date: | February 5, 2016 |
| Registration dates: | November 1, 2015 - January 25, 2016 |
| Last day to drop: | January 25, 2016 |
| Last day to withdraw: | June 10, 2016 |
| Meeting dates and times | ||||||||
|---|---|---|---|---|---|---|---|---|
| Days | Time | Location | ||||||
| M | W | F | 12:00pm - 12:50pm | University Computer Center 108 | ||||
| Crosslisted courses | |||
|---|---|---|---|
| Crosslist group | CRN | Course | Title |
| GT | 22083 | CS 451 P | Design and Analysis of Algorit |
| Course Pre-requisites | |||||
|---|---|---|---|---|---|
| ( | Test | Test score | Course | ) | Connector |
| ( | CS 357 P | ) | |||