University of Minnesota
Algorithms & Data Structures

Syllabus, Fall 2019
CSci 4041: Algorithms and Data Structures

Instructor: Dr. Carl Sturtivant,

Textbook: Cormen, Leiserson & Rivest
"Intoduction to Algorithms", Third Edition,

Read this document very carefully, as it defines what is required to perform effectively in this class. You will be assumed to have read and understood this syllabus: ignorance is not an excuse. If later in the semester you realize for example, that you can't attend the final exam, this will be your fault and no makeup exam will be supplied. Avoid attempting to make yourself an exception.

Course content very approximately in temporal order:

Mathematics from the appendix to the text will be assumed
where necessary (via the prerequisite of CSci 2011).

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 2, 6, 7, §8.1, 9

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), a midterm exam and a final exam. Examinations are open book and notes, however no electronic devices are permitted. 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. A late submission while receiving no points will nevertheless satisfy this requirement.

Due dates for all assignments are strict: all homeworks must be received by gradescope during the day 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 instructor's 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: 8% for each homework, 6% for the midterm and 30% for the final. In addition, 8% of the course will be recorded for scholastic conduct. A student who does not breach the rules of scholastic conduct (see below) will receive the full 8%. 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 TAs.
If you have a question about grading, address it to the TAs in the first instance. Only if something wholely unreasonable has occurred will the instructor intervene.

there is a limit of 10 days from when an assignment's grade is asserted to have been posted online 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. This includes the error of failure to post your grade online by the TAs, so check your grades online frequently to ensure they have been recorded. Do not assume that because you have a grade written on something returned to you, that it has been recorded: the grade posted online is the one that will be used to compute your performance in the class. The sole exception to the 10 day rule is the final examination.

Incompletes will in general not be given. An incomplete will be considered only when a provably serious family or personal emergency arises during the end part of the course, proof is presented, and the student has already completed all but a small portion of the work.

Make-up Exams will in general not be given. Verify at the start of the semester that you can attend all exams at the stated dates and times, and if you cannot do so, then withdraw from the course. A make up exam will be considered only when a provably serious family or personal emergency arises during the relevant part of the course, and proof is presented. All make-up exams will be oral examinations conducted by the instructor.

Scholastic conduct must be acceptable. Specifically, you must do your homeworks, and examinations yourself, on your own. Do not search for homework related information on the World Wide Web. Plagiarism in the widest sense is forbidden. Generate your own solutions.