MWF 9:00 AM
Study of the computability and complexity of computer problems, beginning with a review of mathematical concepts and the discussion of the automata theory, including finite automata, push-down automata and Turing machines.
Minimum grade of C in CMPS 2133 and MATH 2333
Assignments will be made as scheduled and are expected to be completed by the specified due date. Students in this course must demonstrate their competency in fundamentals math skills through homework assignments and tests.
Grades will be given to the assignments handed in on time. Late assignments will be accepted until one class past the due date. However, they will have their maximum grade reduced by twenty points. Any assignment turned in after that period or not done will be graded zero points.
Students are expected to attend all meetings of the classes in which they are enrolled. Attendance is rewarded by participation points in the grading criteria.
All students should refer to the current MSU Students Handbook and Activities Calendar for university policies related to class attendance, academic dishonesty, students responsibilities, rights and activities.
Disability needs: Instructor must be informed if you are a student with a disability and need accommodations for this class.
Cell phones, etc.: Use of any electronic device is not allowed in the classroom. Exceptions must be approved by the instructor.
Student drops: If you wish to drop this course you must first contact your instructor. All students-initiated drops must be processed by March 21, 2011.
Assistance: Please contact your instructor for extra help during this course. This includes class material clarification, expected absences from class due to any personal problem, etc.
Grades will not be posted! Grading system will be discussed in class.
Tests: 25 % (each)
Final Exam: 20 %
Assignments: 25 %
Class Participation: 5 %
Final grading letter: 90 to 100 pts = A, 80 to 89.99 pts = B, 70 to 79.99 pts = C, 60 to 69.99 pts = D, other = F