Enrollment and waitlist data for current and upcoming courses refresh every 10 minutes; all other information as of 6:00 AM.
| 02/04 - 05/24 | ||||||
| M | T | W | Th | F | Sa | Su |
12:15 pm |
12:15 pm |
12:15 pm |
||||
Subject: Computer & Info Sci (UG) (CISC)
CRN: 22365
Lecture
St Paul: O'Shaughnessy Science Hall 429
Requirements Met:
Writing in the Discipline
Introduction to the design and analysis of algorithms. Course topics include the following algorithm design paradigms: divide and conquer, graph algorithms, dynamic programming, and greedy algorithms. The course will also give an introduction to computational complexity, including NP-completeness and the P versus NP problem. Prerequisites: MATH 128 and, a C- or better in CISC 231
4 Credits