|Office:||333 Heller Hall|
|Office Hours:||Tu, Th 9:30-11, W 11-1 and by appointment|
|Lectures:||Tu, Th 8-9:15 a.m. in MWAH 175, and W 10-10:50 a.m. in Humanities 490|
|Course Web Site:||http://www.d.umn.edu/~ddunham/cs3512s15|
|Teaching Assistant:||Sakethram Karumuri|
|Consulting Hours:||M, Th 10-11am in MWAH 177, and Th noon-1pm in HH 314|
Bulletin description: Sets, relations, functions. Recursive definitions of functions and sets. Proof methods, including mathematical and structural induction, diagonalization. Program correctness, asymptotic time/space complexity. Formal language theory, including regular languages and expressions, deterministic/nondeterministic finite automata, Kleene's Theorem.
Calc I, CS 1521, or equivalent. 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:
This course introduces the underlying theory of computer science. The topics come from mathematics, logic, and computer science itself. In this spirit, the course emphasizes standard methods for expressing and establishing mathematically and logically precise claims. We introduce many well-known, widely-used definitions and carefully consider what follows from them.
The material in this course is used in the following Advanced Elective courses: CS 4821 (Computer Security), CS 5511 (Theory of Computation), CS 5521 (Advanced Data Structures), CS 5541 (Artificial Intelligence), CS 5571 (Principles of Programming Language), CS 5641 (Compiler Design), CS 5741 (Object-Oriented Design), CS 5751 (Introduction to Machine Learning), and CS 5761 (Introduction to Natural Language Processing).
The following is a rough outline of the material from the text that I hope to cover in the course. Chapter 1 (proofs, sets, structures), Chapter 2 (functions, countability), Chapter 3 (inductive and recursive definitions, grammars), Chapter 4 (relations, inductive proof), Chapter 5 (analyzing algorithms, rates of growth), Chapter 11 (regular languages, finite automata), and parts of Chapters 12 (CFL's and PDA's), 13 (Turing machines, Church-Turing Thesis), and 14 (Computability).
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 Department of Human Resources & Equal Opportunity 255 DAdB, (http://www.d.umn.edu/umdoeo), phone: (218) 726-6827, email: firstname.lastname@example.org.
Students with Disabilities:
It is the policy and practice of the University of Minnesota Duluth to create inclusive learning environments for all students, including students with disabilities. If there are aspects of this course that result in barriers to your inclusion or your ability to meet course requirements - such as time limited exams, inaccessible web content, or the use of non-captioned videos - please notify the instructor as soon as possible. You are also encouraged to contact the Office of Disability Resources, 258 Kirby Student Center, to discuss and arrange reasonable accommodations. Please call 218-726-6130 or visit the DR website at (http://www.d.umn.edu/access) for more information.
Mental Health Statement:
As a student you may experience a range of issues that can cause barriers to learning, such as strained relationships, increased anxiety, alcohol/drug problems, feeling down, difficulty concentrating and/or lack of motivation. These mental health concerns or stressful events may lead to diminished academic performance or reduce a student's ability to participate in daily activities. University of Minnesota services are available to assist you with addressing these and other concerns you may be experiencing. You can learn more about the broad range of confidential mental health services available on campus via the UMD Health Service Counseling website at http://www.d.umn.edu/hlthserv/counseling/.
Student Academic Integrity Policy Academic dishonesty tarnishes UMD's reputation and discredits the accomplishments of students. UMD is committed to providing students every possible opportunity to grow in mind and spirit. This pledge can only be redeemed in an environment of trust, honesty, and fairness. As a result, academic dishonesty is regarded as a serious offense by all members of the academic community. In keeping with this ideal, this course will adhere to UMD's Student Academic Integrity Policy, which can be found at http://www.d.umn.edu/conduct/ This policy sanctions students engaging in academic dishonesty with penalties up to and including expulsion from the university for repeat offenders.
Student Conduct The instructor will enforce and students are expected to follow the University's Student Conduct Code ( http://www.d.umn.edu/conduct/ ). Appropriate classroom conduct promotes an environment of academic achievement and integrity. Disruptive classroom behavior that substantially or repeatedly interrupts either the instructor's ability to teach, or student learning, is prohibited. Disruptive behavior includes inappropriate use of technology in the classroom. Examples include ringing cell phones, text-messaging, watching videos, playing computer games, doing email, or surfing the Internet on your computer instead of note-taking or other instructor-sanctioned activities.
James L. Hein,
Discrete Structures, Logic, and Computability, Third Edition,
2010, Jones and Bartlett.
It is not directly required that you attend class, however: You are responsible for reading assigned text material and for material covered in class, including:
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.
The assignments will consist of written homework. The homework should adhere to the Written Homework Format.
Examinations and Grading:
There will be two midterm exams, worth 100 points each, and a final exam worth 200 points.
|Exam||Points||Date and Time|
|Midterm Exam 1||100 points||Thursday, February 26, 8-9:15 am in MWAH 175|
|Midterm Exam 2||100 points||Thursday, April 9, 8-9:15 am in MWAH 175|
|Final Exam||200 points||Wednesday, May 13, 8-9:55 am in MWAH 175|
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. 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. The UMD Final Examination Policy web page explains the UMD policy about having more than two final exams on a single day, among other things.
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 grading policy 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.
Scores will be maintained on eGradebook
Grading Procedures: Final grades are based on total points distributed approximately as follows: