Listed in: Computer Science, as COSC-311
John E. Rager (Sections 01 and 02)
This course addresses the design and analysis of computer algorithms. Topics include: set algorithms such as sorting and searching, graph algorithms, string algorithms, and matrix algorithms. Algorithm design paradigms, including the divide-and-conquer, dynamic programming, and greedy paradigms, will be emphasized. The course will end with a discussion of the theory of NP-completeness and its implications.
Requisite: COSC 112 and COSC 211. Fall semester: Professor Rager.
Section 01
M 10:00 AM - 10:50 AM KECC 200
W 10:00 AM - 10:50 AM KECC 200
Section 01
F 10:00 AM - 10:50 AM KECC 200
Section 02
M 12:00 PM - 12:50 PM SCCE A131
W 12:00 PM - 12:50 PM SCCE A131
F 12:00 PM - 12:50 PM SCCE A131
This is preliminary information about books for this course. Please contact your instructor or the Academic Coordinator for the department, before attempting to purchase these books.
Section(s) | ISBN | Title | Publisher | Author(s) | Comment | Book Store | Price |
---|---|---|---|---|---|---|---|
All | Savvich, Victor | TBD |