![]() |
CS 8993 Algorithms
Syllabus
|
|---|
Course Description:
Lecture:
Monday Wednesday 3:30 - 4:45, Simrall 106 (Section 1), Vicksburg Engineering (Section 301) Instructor:
Susan Bridges,
bridges@cse.msstate.edu Textbook: Prerequisites: CS 4833/6833 Introduction to Analysis of Algorithms or equivalent.
Grading:
Homework:
Each homework assignment will consist of 4 or 5 questions. A homework set will be due each Wednesday except the first Wednesday and during weeks in which there is an hour exam. You must submit solutions to all homework problems. Only one question will be graded in detail each week.
Homework should be written neatly, preferably on engineering paper in pencil. Students in the Vicksburg section may submit their homework by FAX (662-325-8997) or may scan the homework if it handwritten and submit an electronic version by email (bridges@cse.msstate.edu). It is not necessary to type the homework since it will almost always involve many mathematical symbols. Homework will not be accepted late unless prior arrangements have been made or when there is an unforseen emergency.
Programming Assignments:
Programming assignments may be completed in any of the following languages: C, C++, Fortran, Java, Visual Basic. If there is some other language you would like to use, you will need to check with Dr. Bridges prior to completing the assignment in that language. You will be required to submit source code and directions for compiling your program. It will be compiled and run as part of the grading. A report will be required for each programming assignment. A substantial percentage of the grade on the assignment will come from the report so it is important that you allow sufficient time to complete the report. Programming assignments will not be accepted late except under unusual circumstances.
Attendance:
Students are expected to attend all classes. If you must be absent, you should notify the instructor ahead of time if possible. More than 3 unexcused absences will result in a reduction of one letter grade in the course. Students who are auditing the course must attend all lectures. An audit will not be awarded if a student has more than 3 unexcused absences.
Academic honesty policy:
Students may work with other students to solve homework problems. The examination questions will often be similar to homework problems and will require students to understand the solutions to homework problems.
Examinations and programming assignments are individual. Cheating on an exam will result
in an F for the exam as well as possible university disciplinary measures.
The programming assignments are individual projects.
Students may consult with other students only concerning general discussions of approaches. In no case should you use code from another student. You may ask other students to assist you with a debugging problem, but the code that you generate must be your code (and reflect your understanding of the algorithm) and not that of other students. If you have difficulty understanding an assignment or need help with debugging, I will be happy to assist you if asked in a timely fashion.
Cheating on the programming assignments will result in a grade of F for the assignment as
well as possible university disciplinary measures
See the Computer
Science Departmental Policy Regarding Professional Conduct. The University Policy Regarding Academic Honesty applies to all MSU students.
Add/drop policy: See the
Mississippi
State University Add/Drop Policy
Cormen, T. H., C. E. Leiserson, R. L. Rivest, and Clifford Stein. 2003. Introduction to Algorithms, Second Edition, New York, NY:
McGraw-Hill Book Company.
Additional References:
Garey, Michael and David S.
Johnson. 1979. Computers and intractability: A guide to the theory
of NP-completeness. New York, NY: W. H. Freeman and Company.
Harel, David. 1987. Algorithmics: The spirit of computing. Reading MA: Addison-Wesley Publishing Company,
Inc.
Horowitz, Ellis, Sartaj Sahni, and
Sanguthevar Rajasekaran. 1997 Computer algorithms/C++. New York,
NY: Computer Science Press.
Manber, Udi. 1989. Introduction
to algorithms: A creative approach. Reading, MA: Addison-Wesley Publishing
Company.
Miller, Russ, and Laurence Boxer. 2000.
Algorithms sequential and parallel: A unified approach, Upper Saddle
River, NJ: Prentice Hall.
Sedgewick, Robert and Philippe Flajolet.
1996. An introduction to the analysis of algorithms. Reading, MA:
Addison-Wesley Publishing Company.
Grading is on a 10 point scale.