Students taking this course should be familiar with topics in a standard computer science course covering discrete math and logic.
|office:||525 Bryan Hall|
|office hours:||MW 3:00–4:00 PM|
Online version apparently available here
|What||When||Weight for final grade|
|Exams||Three noncummulative exams will be given in class, approximately as indicated in the syllabus.||Each is worth 25%|
Almost every week, 10 questions will be published.
Four of those questions are your homework, and their solutions are due at the end of the class
when you turn in your quiz (see below).
Homework will be examined and recorded during grading, and some comments may be made, but you get full credit for a homework assignment simply by submitting something (reasonable).
A solution for the homework problems will be published.
You may collaborate in solving the homework problems, but to receive credit, the written solution must be your own.
|Average of homeworks is worth 3%|
|Quizzes||On the date a homework assignment is due, one of the 6 questions not given as homework will be randomly chosen for an in-class, closed-book quiz.||Average of quizzes, after lowest-scored quiz is dropped, is worth 20%|
||This is worth up to 2%|
Anyone found cheating will on any graded assignment will receive an F for this course; other action may also be taken.
Exam given on regular languages
Exam given on unrestricted languages and undecidability
Exam given on context-free langauges
We will probably not get past this point, but just in case...