Prerequisites and Reading
Information
-
Instructor: Amarda
Shehu amarda\AT\cs.gmu.edu
Place and Time: Innovation Hall 131, W 4:30-7:10 pm
Office Hours: ENGR #4422, W 2:30-4:30 pm
Prerequisites
-
CS 310 (Data Structures) and CS 330 (Formal Methods & Models).
Calculus (MATH 113, 114, 213) and MATH 125 (Discrete Math).
Programming in a high-level language that supports recursion (e.g. PL/I, Pascal, C, C++, Lisp, Java).
Reading
-
Required Reading: Introduction to Algorithms by T. H. Cormen, C. E.
Leiserson, R. L. Rivest, and C. Stein, The McGraw-Hill Companies, 2nd
Edition (2001). Recommended Reading: Algorithms by S. Dasgupta, C.H.
Papadimitriou, and U.V. Vazirani, The McGraw-Hill Companies (2008). The
book is available at http://www.cs.berkeley.edu/~vazirani/algorithms.html.