Return to the CS 332 home page.
|
Professor Roger Kraft Office: Classroom Office Building (CLO), Room 368 Office phone: 989-2696 Office hours: 11:00-12:00, TR and 1:00-2:00, MW, and by appointment. E-mail: roger@calumet.purdue.edu
Text: The Algorithm Design Manual, by Steven S. Skiena, Telos/Springer-Verlag, 1998.
This course is an introduction to algorithms. We will learn what algorithms are and why we should study them, the basics of analyzing algorithms, and basic techniques for implementing algorithms. We will also look at some of the most common and fundamental algorithms used in Computer Science. The goal of this course is to cover most of Part I of the textbook (Chapters 1 through 6) and a little bit of Part II. Your grade for this course will be based on 8 homework assignments and two exams in the following manner:
60% homework assignments,
20% exam 1,
20% exam 2.
Tentative dates for the two exams are
Exam 1 Wednesday, October 23.
Exam 2 Final exam week.
Each of the homework assignments will have a due date. To receive full credit for an assignment, it must be turned in by the due date. Assignments handed in late will be marked off 10% of the total points for each calendar day late up to a maximum of 50%. If an assignment is more than one week late, then I reserve the right not to accept it for credit. When you complete an assignment you will e-mail me your solution. In this course web site there are detailed instructions on how you are to turn in your assignments. You will be expected to follow the instructions. Also in this web site is information on the criteria used to grade your programming assignments.
You should turn in your own work for each homework assignment. Here is what that means: You may talk with your classmates about the course material and the ideas behind each homework assignment (and, in fact, it is a very good idea to do that) but you should solve the problem on your own and write your own solution. Turning in someone else's solution (or even a modified version of someone else's solution) is a breach of academic integrity. Similarly, giving a copy of your solution to someone else in the class is also a breach of academic integrity. If you need help with a homework assignment, come and ask me. You can ask me as many questions as you want! Please do not hesitate to ask me questions after class, in my office, in an e-mail message, over the phone, etc. In this web site you will find more information about this course. There are links to online information about algorithms, information about course reading assignments, and, very importantly, your homework assignments and their due dates will be posted on one of the web pages. The computer programs that you need to do all of your programming assignments are on computers in the Mathematics Computer Labs in CLO 363 and CLO 365. In compliance with the American With Disabilities Act (ADA), all qualified students enrolled in this course are entitled to "reasonable accommodations." It is the student's responsibility to inform me of any special needs before the end of the second week of classes. Ethics are an integral part of being a student and a professional. Academic integrity is the hallmark of this University. Therefore, Purdue University does not tolerate academic dishonesty in any form. If a student breaches integrity, the student risks sanctions in both the academic and conduct arenas. Academic dishonesty includes, but is not limited to, the unauthorized use of other's intellectual property (plagiarism), and lying to an instructor or any University employee. Such actions will result in a failing grade on the assignment with the strong possibility of referral to the Office of the Dean of Students for a conduct sanction (see Purdue University's student handbook). |