CSE 355 Fall 2016 
Introduction to Theoretical Computer Science

CSE 355 is an introduction to formal language theory and automata; Turing machines, decidability/undecidability, recursive function theory, and introduction to complexity theory. This class is a first introduction to the theoretical concepts of Computer Science. It covers basic mathematical concepts, the concept of formal languages, and the theoretical machines that recognize them. The class also covers Turing machines and the problems of decidability and computability.
Course
Information:
CSE 355:  Introduction to Theoretical Computer Science  
http://www.public.asu.edu/~ccolbou/src/cse355f16.html
Class Meeting Time M W F 8:35-9:25 a.m. 
LSA 191
Instructor 
 
 
Office Hours (start 08/19)
Charlie Colbourn
Office  Brickyard 444 
Charles.Colbourn@asu.edu
Mondays 1:00-2:00
Fridays 10:00-11:00 from 19 August - 16 September
Fridays 7:15-8:15 from 23 September - 02 December
TA/Recitation Leader 1 
 
 
 
 
Office Hours (start 08/22)
 
 
 
Recitations (start 08/29)
 
 
 
Randy Compton
Office  Centerpoint Tutoring Center 114 
RANDY.Compton@asu.edu
  • Tuesday 5:30-6:30 p.m.
  • Wednesday 2:00-3:00 p.m.
  • Thursday 1:30-2:30 p.m.
  • Monday 10:45-11:35 a.m.
  • Tuesday 4:35-5:25 p.m.
  • Wednesday 10:45-11:35 a.m.
  • Thursday 7:30-8:20 a.m.
  • Thursday 4:35-5:25 p.m.
TA/Recitation Leader 2
 
 
 
 
Office Hours (start 08/22)
 
 
 
Recitations (start 08/29)
 
 
 
Ryan Dougherty
Office  Centerpoint Tutoring Center 114 
Ryan.Dougherty@asu.edu
  • Tuesday 10:00-11:00 a.m.
  • Wednesday 12:30-1:30 p.m. (except 10/19) in BYAC 190 starting 11/09
  • Wednesday 19 October, 2:00-3:00 p.m.
  • Thursday 12:00-1:00 p.m. in BYAC 240 starting 11/10
  • Monday 9:40-10:30 a.m.
  • Tuesday 7:30-8:20 a.m.
  • Wednesday 9:40-10:30 a.m.
  • Friday 9:40-10:30 a.m.
  • Friday 10:45-11:35 a.m.
Undergraduate TA JJ Robertson
JJ.Robertson@asu.edu
Help Sessions
  • Wednesday 31 August, 12:00-1:00 p.m., CPCOM 103
  • Wednesday 07 September, 12:00-1:00 p.m., CPCOM 103
  • Monday 19 September, 12:00-1:00 p.m., CPCOM 103
  • Monday 26 September, 12:00-1:00 p.m., CPCOM 103
  • Monday 17 October, 12:00-1:00 p.m., CPCOM 103
  • Monday 24 October, 12:00-1:00 p.m., CPCOM 103
  • Monday 07 November, 12:00-1:00 p.m., CPCOM 103
  • Monday 21 November, 12:00-1:00 p.m., CPCOM 103
  • Wednesday 30 November, 12:00-1:00 p.m., EDC 117
  • Friday 02 December, 12:00-1:00 p.m., EDC 117
Contacts Direct questions as follows:
  • concerning help for homework assignments to either recitation leader, copying the instructor.
  • concerning grading of homework assignments to your recitation leader.
  • concerning recitation sections to your recitation leader.

    If you want to attend a recitation section other than the one in which you are registered, this will be allowed if, and only if, space permits. If the room becomes overfull, all students who are not registered in the recitation section must leave. Homework assignments, once graded, will be returned at the section indicated on the front page of the homework.

  • concerning extra help sessions to the undergraduate TA, copying the recitation leaders.
  • concerning the midterm tests, the final exam, and general course organization to the instructor.
Prerequisites Students are expected to have background in Advanced data structures and algorithms (CSE 310), Mathematical foundations (MAT 243).
Special Needs If you are entitled to extra accommodation for any reason (such as a disability), we make every reasonable attempt to accommodate you. However, it is your responsibility to discuss this with the instructor at the beginning of the course. 
Academic Honesty Work in this course, unless explicitly stated in writing to the contrary, is to be an effort by the individual student. It is not acceptable to use work other than your own without full attribution and acknowledgment. While you are welcome to discuss problems with others, it is not acceptable to discuss solutions with them.

Depending on the severity of the infraction, penalties may include a grade of zero on the offending item, a grade of zero on the offending item and a reduction of the final grade by one full letter grade, a failing grade in the course with an indication of academic dishonesty. Such penalties might result in a requirement to withdraw from the university.

If in doubt about anything related to academic integrity, see the instructor.

Protocol for Lecture Lectures start promptly at 8:35. Announcements will be made, then questions answered, and then the lecture material presented. Therefore late arrival will mean that (1) you may miss important announcements about homeworks, recitations, readings, and the like; (2) you may be late submitting a homework and receive no credit for work that you have done; and (3) you will certainly disrupt the class and make it more difficult for your fellow students to listen and learn. Please think about your fellow students, and ensure that they have the opportunity to profit from the lecture, whether or not you wish to. If you must arrive late, enter quietly and do not disrupt the lecture. If you must leave early, leave quietly and do not disrupt the lecture.
TextBooks:
Required Text Michael Sipser, Introduction to the Theory of Computation, Third Edition, Cengage Learning, 2012, (ISBN-13: 978-1133187790).