Homeworks (15%) (best four out of five)
Exam #1 (40%)
Exam #2 (45%)
Introduction to Automata Theory, Languages, and Computation, 3rd Edition by Hopcroft, Motwani, and Ullman
Introduction to the Theory of Computation 3rd ed. by Sipser. Foundations of Computer Science by Aho and Ullman.
Datastructures and algorithms, Discrete Math.
Homework must be submitted via gradescope by the specified due dates.
Please include your name and UNI on the first page of the homework assignment.
You must write your solutions in your own words by yourself.
You can consult the instructor, the TAs, or your fellow students for help but
you must acknowledge any sources you use other than yourself on your answers.
Please use piazza to discuss and ask questions about the homeworks.
No late homeworks will be accepted.
Students are expected to adhere to the Academic Honesty policy of the Computer Science Department; this policy can be found in full here.
Violation of any portion of these policies will result in a penalty to be assessed at the instructor's discretion. This may include receiving a zero grade for the assignment in question and a failing grade for the whole course, even for the first infraction.