Date: Tue, 26 Nov 1996 18:46:55 GMT Server: NCSA/1.5.2 Last-modified: Tue, 26 Nov 1996 15:22:16 GMT Content-type: text/html Content-length: 4982 CSC/ECE 505 title page

CSC(ECE) 505: Design and Analysis of Algorithms

Official course description from NCSU Graduate Catalog

Instructor: Rex A. Dwyer, Associate Professor, Computer Science

Teaching Assistant: TBA

Meeting Time and Place: Tues/Thurs 11:20-12:35, Withers Hall 210-A

Prerequisites: Data structures (CSC 311). Discrete Math (CSC 222) is strongly recommended.

Official WWW page: http://www.csc.ncsu.edu/eos/info/csc505_info/www/index.html

Class broadcast e-mail list: csc505-001@csc.ncsu.edu

Address for anonymous comments: csc505-001-comments@csc.ncsu.edu

Textbook: Cormen, Leiserson, and Rivest, Introduction to Computer Algorithms, McGraw-Hill, 1990. Errata for the textbook, instructor's notes for selected topics, and other materials are on reserve in D.H. Hill Library and/or accessible from the class WWW page.

Grading:

Drop Date: October 25. All changes in course status must be handled through the registrar.

Problem Sets: Homework problem sets will be assigned on a regular basis. The problems are generally pencil-and-paper problems, although it is not inappropriate to apply computing resources. Model solutions will be made available on specified due dates. The principal incentive for doing homework (aside from intellectual curiosity!) is to be prepared for exams; no explicit credit will be given for homework. (If available TA resources permit, some problem sets will be collected and selected problems will be read and commented upon.) Since no grades are assigned, you are free to work together; however, it is important at exam time that you be able to write up solutions in your own words. One approach might be to meet with other students to discuss and perhaps solve problems, then reconstruct the solution later without using notes.

Approximate Schedule:



dwyer@csc.ncsu.edu Rex Dwyer
updated 8/20/96