Printer-friendly version

Syllabus, Summer 2008 CSci 4041: Algorithms and Data Structures

Instructor: Carl Sturtivant, carl@cs.umn.edu

Textbook: Cormen, Leiserson & Rivest "Intoduction to Algorithms", Second Edition, McGraw-Hill

Read this document very carefully, as it defines what is required to perform effectively in this class. Course content very approximately in temporal order:

Mathematics from section 1 of the text will be assumed where necessary (via the prerequisite of csci2011). Sections of the book listed below should be read in conjunction with the class. As the class proceeds it should be clear which sections have just been covered in order, and therefore which are about to be covered. The course content is precisely defined by the sections listed below. Sorting & Selection Chapters 1, 6, 7, 8 Data Structures for Disjoint Sets Section 21.3 Dynamic Programming Chapter 15 Greedy Algorithms Sections 16.1, 16.2, 16.3 Elementary Graph Algorithms Sections 22.1, 22.2, 22.3, 22.4 Minimum Spanning Trees Chapter 23 Single Source Shortest Paths Sections 24.1, 24.2, 24.3 All Pairs Shortest Paths Sections 25.1, 25.2 Hash Tables Chapter 11 Binary Search Trees Chapter 12

Evaluation: The following rules will be strictly enforced. Evaluation will consist of homeworks (7), and a final exam. Homeworks are a vital part of the learning process: persons who do not submit reasonable attempts at all seven homeworks will receive an F for the course. Due dates for all assignments are strict: all homeworks must be received in the class in which they are due in order to receive credit. Keep a copy of each of your submissions as evidence that you have indeed submitted each assignment. Do not ever put your assignment under the instructors office door: this is a certain way to receive zero points for an assignment. Grading is absolute (i.e. not on a curve). The overall grade will be based upon: 9% for each homework, and 37% for the final. A minimum of 60% is necessary for an S or C- grade. Grading will be as follows: 95.0% or above yields an A, 90.0% an A-, 85% = B+, 80% = B, 75% = B-, 70% = C+, 65% = C, 60% = C-, 55% = D+, 50% = D, and less than 50% yields an F. Percentages are not rounded when using this scheme, because this would be tantamount to moving all of the grade boundaries down by 0.5%. Grading is performed by the TA. If you have a question about grading, address it to the TA in the first instance. Only if something wholely unreasonable has occurred will the instructor intervene. And this has not yet proved necessary. Furthermore, there is a limit of 7 days from the date an assignment is returned in recitation for grading problems to be dealt with, whether or not you are present to receive your returned work. After that period, such will not be considered. The sole exception to this rule is the final examination. Incompletes (or make up exams) will in general not be given. These options will be considered only when a provably serious family or personal emergency arises, proof is presented, and the student has already completed all but a small portion of the work. Scholastic conduct must be acceptable. Specifically, you must do your homeworks, and examinations yourself, on your own.