This syllabus is to be used as a guideline only. The information provided is a summary of topics to be covered in the class.
Information contained in this document such as assignments, grading scales, due dates, office hours, required books and materials may be from
a previous semester and are subject to change. Please refer to your instructor for the most recent version of the syllabus.
CSE355 Introduction to Theoretical Computer Science
Syllabus – Fall 2021
Class Time: Mon/Wed 12:00pm ~ 1:15pm
Classroom: WGHL 101
Instructor
Dr. Xuerong (Sherry) Feng
Office: Brickyard 512 (5th floor)
Email:
URL: http://www.public.asu.edu/~xfeng13
Office Hour
Mon. Wed.: 11:00am ~ 11:50am (at Coor 150 left most, Pod D or E)
Fri.: 2:00pm ~ 3:00pm (online https://asu.zoom.us/j/5299807411 )
Textbook
Introduction to the theory of computation, Michael Sipser, Thomson Course Technology, 3rd
edition, ISBN-13: 978-1133187790
• A 2nd or 1st edition is okay. But be aware that homework problems and pages might be
different between the different editions.
• Extra lecture handouts will be provided through Canvas.
Catalog Description
Introduces formal language theory and automata, Turing machines, decidability/undecidability,
recursive function theory, and complexity theory.
1
1 of 6
, Prerequisites
Computer Systems Engineering BSE or Computer Science BS major; CSE 310 with C or better or
CSE graduate student
Major Topics Covered
This course provides a first introduction to the theoretical concepts of Computer Science. The focus
of the course is the study of abstract computing devices without targeting a specific programming
language and/or computing platform. In particular, we will study:
• finite automata, which model computing machines with finite fixed memory, and the class
of regular languages, which is used for pattern matching languages;
• pushdown automata and context-free grammars that facilitate declarative specifications of
language syntax;
• the universal computational model of Turing machines, and the inherent limits of what
can be solved on a computer (undecidability); and, finally,
• time complexity theory, which helps us measure the time used to solve a problem
Course Web Site
All course documents, i.e. lecture slides, quiz solutions, etc., are available on Canvas at
https://myasucourses.asu.edu/. All students who are registered in CSE355 course should be able to
access the course material through this site. If you experience any difficulties, please let me know
as soon as possible. It is your responsibility to check the latest announcement and print your
assignments from the Canvas as soon as it is posted.
Note: Announcements in the class take precedence over printed material.
Grading & Exam Dates
• Your grade will be based on the following schema.
Item # of Items Point Value Percentage
towards your
Final Grade
Exams 3 100 65%
Assignments 6 100 25%
Recitation 13 20 10%
Quizzes/Attendance 7 10 5%
Total 105%
• Grading breakdown (+/- System)
A+ A B+ B C+ C D E
2
2 of 6