CS4123 Theory of Computation. B97
Prof. Carolina Ruiz
Department of Computer Science
Worcester Polytechnic Institute
Mo, Tu, Th, Fr 2:30 - 3:20 p.m.
Prof. Carolina Ruiz
Office: FL 232
Phone Number: (508) 831-5640
| Tu. || 1:30 || - || 2:30 pm
| Fr. || 3:30 || - || 4:30 pm, or by appointment
Room: FL 243
| Mo || 10:00 || - || 11:00 am
| Tu || 11:00 || - || 12:00 m
| We || 2:00 || - || 3:00 pm
| Th || 1:00 || - || 2:00 pm
Messages sent to firstname.lastname@example.org reach both the instructor and the
CS 3133 Foundations of Computer Science.
| Exam 1
| Exam 2
| Class Participation
|| Extra Points
Your final grade will reflect your own work and achievements
during the course. Any type of cheating will be penalized with an
NR grade for the course and will be reported to the WPI Judicial Board.
Academic Honesty Policy.)
There will be a total of 2 exams. Each exam will cover the
material presented in class since the beginning of the term.
In particular, the final exam is cumulative.
Exam 1 is scheduled for Tuesday Nov. 25 and Exam 2 is scheduled for
Thursday Dec. 18.
Both will be in-class, closed-book, individual exams.
Homework will be assigned every Monday and will be due
at the beginning of the following Monday's class.
Solutions to the homework will be made available soon after
homework is collected,
so no late homework will be accepted.
You are encouraged to discuss the homework with your classmates,
but you should develop and write your own solutions.
Quizzes will be given at the beginning of every Tuesday class.
Each quiz will cover the material of the previous week.
Additional pop quizzes may be given as well.
Students are expected to attend class and to read the material assigned to each
class in advance. Class participation will add extra points to
CLASS MAILING LIST
The mailing list for this class is: email@example.com
You MUST subscribe to the mailing list by sending the following
one-line email message to firstname.lastname@example.org:
- Messages sent to email@example.com go to the entire class, and
- messages sent to firstname.lastname@example.org go to the lecturer and the TA only.
CLASS WEB PAGES
The web pages for this class are located at:
Announcements will be posted on the web pages and/or
the class mailing list, and so you are urged to check your email and
the class web pages frequently.
ADDITIONAL SUGGESTED REFERENCES
The following additional references complement and/or supplement
the material contained in the required textbook.
H.R. Lewis and C.H. Papadimitriou, ``Elements of the Theory of Computation''.
Second edition. Prentice Hall, 1998.
M.R. Garey and D.S. Johnson, ``Computers and Intractability: A Guide to
the Theory of NP-Completeness''. W.H. Freeman, 1979.
J.E. Hopcroft and J.D. Ullman, ``Introduction to Automata Theory,
Languages, and Computation''. Addison Wesley, 1979.
T.H. Cormen, C.E. Leiserson, R.L. Rivest,
``Introduction to Algorithms''. McGraw-Hill, 1989.
H. Rogers, ``Theory of Recursive Functions and Effective
Computability''. The MIT Press, 1987.
Small changes to this syllabus may be made during the course
of the term.