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.
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.

*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

TA/Recitation Leader 2

Office Hours
(start 08/22)

Recitations
(start 08/29)

Ryan Dougherty

Office Centerpoint Tutoring Center 114

Ryan.Dougherty@asu.edu

** in BYAC 190 starting 11/09** ** in BYAC 240 starting 11/10**

Undergraduate TA
JJ Robertson

JJ.Robertson@asu.edu
Help Sessions

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.
**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. *

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.