Instructor:	Doug Dunham
Email:	ddunham@d.umn.edu
Web Site:	http://www.d.umn.edu/~ddunham
Office:	311 Heller Hall
Phone:	726-7510
Office Hours:	M, W 3-4, Tu 2-4, F 1-1:50, and by appointment
Lectures:	Tu, Th 9:30-10:45 a.m. in SCC 120
Course Web Site:	http://www.d.umn.edu/~ddunham/cs3511f06

Teaching Assistant:	Bin Lan
Email:	lanxx019@d.umn.edu
Web Site:	http://www.d.umn.edu/~lanxx019/
Phone:	To Be Announced
Consulting Hours in HH 306:	Mon., Thurs. 7-8 p.m.
Consulting Hours in MWAH 177:	Fri. 11am-noon

Bulletin Description:
Review of recursion and induction: mathematical induction, recursive definitions of sets, structural induction. Further study of analysis of programs: asymptotic analysis and correctness proofs. Introduction to formal languages: finite automata, regular expressions, context-free grammars. May include additional topics, such as graphs and trees.

Prerequisites:
Prerequisite: Math 3355 or #, or the equivalent if you are a transfer student.
Important note: The computer science bachelor's degree program at UMD is accredited by CAC (the Computing Accreditation Commission). One of the CAC requirements is that all students must satisfy the prerequisites in order to be admitted to a course, so if you have not passed the prerequisite courses, you must drop this course (if you have any questions about this, please see the instructor after the lecture or during office hours).

Course Objectives and Content:

The following is a rough outline of the material that I hope to cover in the course. We will start with a brief review of logic, proofs, sets, and functions, followed by a deeper review of algorithms, growth of functions, asymptotic analysis, and some number theory. There will then be a discussion of matrices and their use in computer science. This will be followed by a more thorough review of mathematical induction, recursion, and proof of program correctness. Then we will cover languages and grammars, finite-state machines, language recognition, and Turing machines. If there is time left, we may discuss more number theory or graph and tree algorithms.

Equal Opportunity:
The University of Minnesota is committed to the policy that all persons shall have equal access to its programs, facilities, and employment without regard to race, color, creed, religion, national origin, sex, age, marital status, disability, public assistance status, veteran status, or sexual orientation. As instructor, I am committed to upholding University of Minnesota's equal opportunity policy. I encourage you to talk to me in private about any concerns you have related to equal opportunity in the classroom. To inquire further about the University's policy on equal opportunity, contact the Office of Equal Opportunity, 269-273 DAdB, (http://www.d.umn.edu/equaloo), phone: (218) 726-6827 or (218) 726-6849, email: equaloo@d.umn.edu.

Students with Disabilities:
If you have any disability (either permanent or temporary) that might affect your ability to perform in this class, please inform me at the start of the quarter. I may adapt methods, materials, or testing so that you can participate equitably. To learn about the services that UMD provides to students with disabilities, contact the Disability Services and Resources Office, 236 Kirby Student Center, (http://www.d.umn.edu/access), phone: (218) 726-8217 or TTY (218) 726-7380, email: access@d.umn.edu or contact the Office of Equal Opportunity, 269-273 DAdB, (http://www.d.umn.edu/equaloo), phone: (218) 726-6827, email: equaloo@d.umn.edu.

Text:

• Required: Rosen, Kenneth H., Discrete Mathematics and Its Applications, Sixth Edition, 2006, McGraw-Hill, Boston, MA, ISBN: 0-07-288008-2. Web site: http://www.mhhe.com/rosen (click on Sixth Edition).
• Recommended: Rosen, Kenneth H., Student Solutions Guide for "Discrete Mathematics and Its Applications, Sixth Edition," 2006, McGraw-Hill, Boston, MA, ISBN: 0-07-310779-4.

Attendance: It is not directly required that you attend class, however:

1. Half a point will be awarded for attendance at each class meeting.
2. You are responsible for reading assigned text material and for material covered in classm including:
   1. doing the reading assignments from the text
   2. the material covered in the lectures
   3. obtaining assignments and handouts
   4. turning in programming assignments and homework

If you are unable to attend a class meeting, it is your responsibility to obtain class notes, assignments, and extra copies of handouts from your study partner. Note: assignments are due at the beginning of class on the due date (unless otherwise specified) -- they will be docked 25% per day if turned in late.

Assignments:
The assignments will consist of written solutions to exercises from the text, and a few instructor-designed exercises. The should adhere to the Written Homework Format.

Getting Help with Assignments:
If you need help with an assignment, here is a list of resources, which you should make use of in the following order:

1. course materials, such as the text, Student Solutions Guide, and notes
2. your study partner (I encourage each student to get a study partner -- groups of 2 work best).
3. The TA during consulting hours in HH 314 and MWAY 187
4. the instructor

Examinations and Grading:

There will be two midterm exams, worth 100 points each, and a final exam worth 200 points. These exams are closed book. The final exam will be comprehensive. Exams will not be given early, and makeups must be justified by dire circumstances described to the instructor before the time of the exam.

In particular, the final exam will not be given early; makeup exams in case of the "no 3 exams on one day" policy, will only be given after that time (the section Final Examination Conflicts on the Final Examination Policy web page explains the UMD policy about having more than two final exams on a single day). Do not make travel plans to leave UMD before you have taken the final exam.

Exam Schedule:

It is Department of Computer Science policy not to return final exams, however they are kept and you can look at your exam in the instructor's office.

Scores and total points will be maintained by the TA on the TA's web site. At the end of the semester, scores, total points, and grades will be posted on the "Grades" page of the class web site:
http://www.d.umn.edu/~ddunham/cs3511f06/grades
using the last digits of your student id number. If you wish to have your scores posted using a number other than the last digits of your student id, you may email your request to the instructor.

Grading Procedures: Final grades are based on total points distributed approximately as follows:

• Homework assignments (approx. 200 points)
• Attendance (approx. 15 points)
• Two Midterm Exams (100 points each)
• Final Examination (200 points)

• The A- cutoff is 90%
• The B- cutoff is 80%
• The C- cutoff is 70%
• The D cutoff is 60%
• Below 60% is an F

Note: The grade of I (incomplete) can be given only when (a) the student has performed satisfactorily during most of the semester, and (b)the student is unable to finish the semester's work on time for reasons beyond his or her control. Students will not be assigned an incomplete solely for the purpose of avoiding a poor grade. According to UMD policy:
( http://www.d.umn.edu/catalogs/current/umd/gen/grades.html )
the temporary grade I (incomplete) is assigned only when a student has made an agreement with the instructor to complete the course requirements before the instructor submits final grades for a semester.