CSC 354: Algorithms Analysis and Theory of Computation
Spring 2006
Instructor:
Lori Carter
849-2342
Office
Hours:
M 2:30-4:00
T Th
8:30-10:00 & 1:00-2:30
F 10:30-12:00
Text:
Neapolitan and Naimipour, Foundations of Algorithms, Third Edition
Course
Objectives:
This course is presents approaches to designing
algorithms, complexity analysis of algorithms and computational
complexity. Theoretical issues such as
intractability, and categories of P, NP, NP-complete
will be explored. A background in finite
math and data structures is assumed.
Course
Organization:
Lectures: Cover the highlights of chapters assigned –
not a substitute for reading.
Homework: Algorithm analysis and design is best learned
through discussion. Please feel free to discuss homework problems, but only
verbally. Do not share written
solutions, and turn in individual assignments. Homework will be assigned daily,
but it is due approximately weekly. Questions will be answered on homework
problems at the beginning of the next class period after it is assigned. After
that the problem will not be addressed in class. Homework will be turned in at
the beginning of class the day it is due. Late
homework is not accepted.
Exams: Three exams will be given in class. Students missing an exam for a school function
may arrange to take the exam in advance.
Material covered may include lectures, reading, homework or labs. Exams
are currently scheduled for February 3, March 1, and April 7.
Labs: Labs
will be held at the scheduled time with the exception of the first week of the
semester. No labs will be held during
the first week. Unless otherwise
indicated, lab projects will be completed individually. Assignments will generally be given during
the Wednesday lab, and if not completed may be finished and demoed in the
Friday lab. Grading will be by
demonstration, oral questioning and lab write-ups.
Final Exam: Cumulative exam covering
lectures, homework and reading. The
Final is scheduled for Monday at 1:00.
Attendance:
As stated in the school catalog, “ Whenever
the number of accumulated absences in a class, for any cause, exceeds ten
percent of classes, the faculty member sends a written report to the Associate
Provost for Academic Administration which may result in de-enrollment. If more than 20% is reported as missed, the
student will automatically be de-enrolled. If the date of de-enrollment is past
the last date to withdraw from a class, the student will be assigned a grade of
“F” or “NC”.
Grading: Expected Schedule:
Exams: 30% Exam 1 (chapt 1, appdx A,B) Feb 3
Homework: 15% Exam 2 (chapt 2,3) Mar 1
Labs: 25% Exam 3 (chapt 4,5,6) April 7
Final: 30% Final (all) May 8
Extra Credit: On Saturday, April 8, we are hosting the 2nd Annual
CS/IS Undergraduate Research Conference. Two
percentage points will be added to the area of your choice if you attend the
conference. 3-4 percentage points will
be added if you participate (poster, assistant, etc.)
Final
grades will be determined as follows:
100-93% A
90-92% A-
87-89% B+
83-86% B
80-82% B-
77-79% C+
73-76% C
70-72% C-
67-69% D+
63-66% D
60-62% D-
0-59% F
Academic
Accommodations:
All students are expected to meet the standards for
this course as set by the instructor. However, students with learning
disabilities who may need accommodations should discuss options with the