Introduction
This class is intended to give you the theoretical foundation necessary to effectively research topics in computer science. Selected topics include automata theory and formal languages, predicate logic, computability, and complexity theory. The prerequisites for this class include discrete structures, linear algebra, and probability/statistics, or consent of the Graduate Advisor.
Textbook
H.R. Lewis and C.H. Papadimitriou, ``Elements of the Theory of Computation'', Prentice-Hall, 1981.
Additional References
Grades
Class assignments consist of homework problems and programming assignments. Each assignment must be submitted by the beginning of class on the published date. No late assignments will be accepted or graded.
All class work, including weekly homeworks, programs, and exams, are to be designed and completed on your own. Clarification of material covered in class may be discussed with your classmates or with the TA or myself, but any discussion of the homework, the programs, the solutions or any part of the code with anybody other than the TA or instructor constitutes academic dishonesty. Students found guilty of dishonesty will be subject to penalties that may include suspension from the university.
All homework assignments should be sent by electronic
mail to cs5305-turnin@cse.uta.edu. The assignments will be graded
by the TA and the grades will be sent to you by electronic mail.
All handouts this semester - this syllabus, homework assignments, and other
materials - will be available through the class home page at
http://www-cse.uta.edu/
cook/tcs/tcs.html. If you cannot regularly
access this address, let me know immediately and I will send you assignments
over email. Any code that I supply throughout the semester will also be
accessible through the home page.
| Homework | 30% |
| Exam 1 | 20% |
| Exam 2 | 20% |
| Final Exam | 30% |