Introduction to Computer Science Theory, 4003-380-03, 20091

Course Description

Course Outcomes

1. Students should demonstrate an understanding of basic concepts in formal language theory, grammars, automata theory, computability theory, and complexity theory.
2. Students should be able to relate practical problems to languages, automata, computability, and complexity.
3. Students should demonstrate an increased level of mathematical sophistication.
4. Students should demonstrate an understanding of and be able to apply mathematical and formal techniques for solving problems in computer science.

Course Web Page

Instructor

Office hours:

• Monday 10-12pm,
• Thursday 3-3:45pm,
• Friday 3-4pm,
• and by appointment.

Theory tutoring center:

Lectures

Required Book

Other Materials

Prerequisites

• Algorithms and data structures at the level of an introductory programming sequence.
• Discrete Mathematics. You should have taken a course in discrete mathematics covering
  • fundamentals of logic
  • sets
  • relations
  • equivalence relations
  • functions
  • simple combinatorics
  You should be competent in constructing proofs involving sets, relations, and functions, using various techniques such as mathematical induction.

To refresh your memory on discrete math, read (and do some of the exercises of) Sections 1.1, 1.2, 1.3, 1.4, 2.1, 2.2, 2.3 of the course book.

The Work

Discrete Math Quiz

Homework Assignments

Unless it is specifically stated otherwise, you may work on and submit your homework in groups of 1 or 2. If you choose to work as a group of 2, both of you should contribute significantly to the solution for every question. You should submit only one copy of the homework with both your names on it. All authors have to be able to explain all solutions. Whether you submit on your own or with a partner, discussing homework with your fellow students is encouraged. However, after such discussions, all notes must be discarded, blackboards erased, and every group must write up their solutions in private without further consultations with your classmates or any written material other than your class notes, materials handed out in class, the textbook or this webpage. For every problem discussed with other students, state their names and briefly sketch the extent of your discussions (e.g. "solved together", or "clarified problem statement"). You are not allowed to look up the answers to your homeworks.

Your homework submissions must be submitted by Friday, 4pm sharp. You have the following submission options:

• Upload it to mycourses, as txt or pdf-file. No other formats will be accepted.
• Give it to me in class or during office hours.
• Bring it to the mentoring center on Friday between 3:45pm and 4pm and give it to the theory tutor.

I will stop answering homework questions at 10am the day it is due. (This means that you can send an e-mail with a homework question by Friday 10am and I will answer it as soon as possible, I will do my best to send my answer before 1pm.)

Midterm Exam

Final Exam

Exams can not be made up except for real emergencies in which case proper documentation (like a doctor's note) will be required. If at all possible, you should contact me prior to the exam. Oversleeping, cars that don't start etc. do not constitute a valid excuse.

Evaluation

• 40% Homeworks and the best of
  • 30% Midterm and 30% Final Exam or
  • 25% Midterm and 35% Final Exam

Tutoring

Disputing Your Grade

Academic Honesty