CSCI0302A-S11
Algorithms and Complexity
Algorithms and Complexity
This course focuses on the development of correct and efficient algorithmic solutions to computational problems, and on the underlying data structures to support these algorithms. Topics include computational complexity, analysis of algorithms, proof of algorithm correctness, advanced data structures such as balanced search trees, and also important algorithmic techniques including greedy and dynamic programming. The course complements the treatment of NP-completeness in CSCI 0301. (CSCI 0102 and CSCI 0201) 3 hrs. lect./disc.
This course focuses on the development of correct and efficient algorithmic solutions to computational problems, and on the underlying data structures to support these algorithms. Topics include computational complexity, analysis of algorithms, proof of algorithm correctness, advanced data structures such as balanced search trees, and also important algorithmic techniques including greedy and dynamic programming. The course complements the treatment of NP-completeness in CSCI 0301. (CSCI 0102 and CSCI 0201) 3 hrs. lect./disc.
- Term:
- Spring 2011
- Location:
- McCardell Bicentennial Hall 438(MBH 438)
- Schedule:
- 11:15am-12:05pm on Monday, Wednesday, Friday (Feb 7, 2011 to May 9, 2011)
- Type:
- Lecture
- Instructors:
- Matthew Dickerson
- Subject:
- Computer Science
- Department:
- Computer Science
- Division:
- Natural Sciences
- Requirements Fulfilled:
- DED
- Levels:
- Undergraduate
- Availability:
- View availability, prerequisites, and other requirements.
- Course Reference Number (CRN):
- 20495
- Subject Code:
- CSCI
- Course Number:
- 0302
- Section Identifier:
- A