CSE 355 Spring 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/cse355s16.html
Class Meeting Time T Th 7:30-8:45 a.m. 
NEEB 105
Instructor 
 
 
Office Hours
Charlie Colbourn
Office  Brickyard 444 
Charles.Colbourn@asu.edu
Thurs 9:00-10:00 a.m., Fri 10:15-11:15 a.m.
TA 
 
 
Office Hours
Dylan Lusi
Office  Centerpoint Tutoring Center 114 
dlusi@asu.edu
  • Monday 1:30-2:30 p.m.
  • Tuesday 1:00-2:00 p.m.
  • Wednesday 1:30-2:30 p.m.
  • Thursday 12:30-1:30 p.m.
Recitation Leader
 
 
Recitations
 
 
 
Ryan Dougherty
ryan.dougherty@asu.edu
  • Monday 3:00-4:00 p.m. BYAC110
  • Tuesday 10:00-11:00 a.m. PEBE211
  • Wednesday 6:00-7:00 p.m. BYAC270
  • Thursday 2:00-3:00 p.m. PEBE211
  • Friday 1:00-2:00 p.m. CDS15
Undergraduate TA JJ Robertson
jj.robertson@asu.edu
Help Sessions
  • Friday 22 January, 7:30-8:30 a.m., BYAC 150
  • Friday 29 January, 7:30-8:30 a.m., BYAC 150
  • Monday 01 February, 9:00-10:00 a.m., BYAC260
  • Wednesday 17 February, 1:30-2:30 p.m., BYAC240
  • Monday 29 February, 12:00-1:00 p.m., BYAC 270 (midterm prep)
  • Wednesday 16 March, 1:30-2:30 p.m., BYAC 240
  • Monday 28 March, 12:00-1:00 p.m., BYAC240
  • Monday 18 April, 12:00-1:00 p.m., BYAC240
  • Wednesday, 27 April, 9:00-10:00 a.m., LSE 106 (review for final)
  • Thursday, 28 April, 12:20-1:15 p.m., COOR 199 (review for final)
Contacts Direct questions as follows:
  • concerning help for homework assignments to the TA, copying the instructor.
  • concerning grading of homework assignments to the TA.
  • concerning recitation sections to the recitation leader.
  • concerning extra help sessions to the undergraduate TA, copying the recitation leader.
  • concerning the midterm test, 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 7:30. 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 or 2013.