Explain the RSA method for public-key cryptography and illustrate it by carrying out appropriate computations. State, prove and apply several graph-theoretic theorems and algorithms to problems involving colorings, paths, cycles and circuits, shortest paths, minimum weight spanning tree, and other graph properties. Students are expected to have developed basic mathematical writing skills in M 187, and to refine those skills further in this course. Problems given on take-home exams are generally similar to homework problems, requiring critical thinking, careful exposition, and considerable time. Students are graded on clarity and presentation as well as mathematical correctness.
Problems given on in-class exams are less complex, reflecting the limited time available.
Standards for presentation are not as stringent, and problems often are given in multiple-choice or short answer format. Assessment of students' learning through in-class participation usually does not factor into their grades, but it does provide both the students and the instructor with ongoing, real time feedback as to whether the objectives are being attained. The following table is based on a typical semester schedule-60 class meetings of 50 minutes each. The actual amount of time spent on each topic will vary slightly from semester to semester and instructor to instructor. 8 Exams 4 Text Discrete and Foundational Mathematics , Steve Grantham, unpublished manuscript in progress.