HomeTeachingAbout MePublicationsContact Me

Course Syllabus

Jordan University of Science & Technology
Faculty of Computer & Information Technology
Department of Computer Science
Year: 2007/2008

Course Information
Course Title Theory of Computation
Course Number 282
Prerequisites C++ & Discrete Math
Course Website www.just.edu.jo/~towaiq/CS282
Instructors Dr. Mohammad Al-Towaiq
Office Location Department Office
Office Phone 23661
Office Hours Every day from10:15-11:15 am OR  by appointment
E-mail towaiq@just.edu.jo

 

Text Book


Title

Peter Linz, "An Introduction to Formal Languages and Automata", 3rd ed, Jones and Bartlett, 2001.
References
  • Introduction to Languages and the Theory of Computation, John Martin, 3 rd Ed., Mc Graw Hill, 2003.
  • Elements of the Theory of Computation, H. Lewis and C. Papadimitrios, 2nd Edition, 1998 by Prentice Hall, Inc
  • Introduction to Computer Theory, Daniel Cohen, 2 nd Ed., 1997 by John Wiley & Sons, Inc.
  • Introduction to Automata Theory, Languages, and Computation, 2 nd , Addison Wesley Higher Education, 2001.
  • • An Introduction to Formal Languages and Automata, Peter Linz, 3 rd Ed., Jones and Bartlett, 2001.

Assessment Policy

Assessment Type Expected Due Date Weight
First Exam
Week 5 or 6 (TBA)
20%
Second Exam
Week 11 or 12 (TBA)
20%
Final Exam
TBA
40%
Project TBA 10%
Quizzes and HWs (10)
Every Sunday
10%

Teaching & Learning Methods

  • Class lectures, exams, and quizzes are designed to achieve the course objectives.
  • You should read the assigned chapters before class and participate in class and do whatever it takes for you to grasp this material. Ask questions. Ask lots of questions.
  • You are responsible for all material covered in the class.
  • Please communicate any concerns or issues as soon as practical either in class, by phone or by Email.
  • The web page is a primary communication vehicle. Lecture notes will be available before each class.

Course Objectives

    To understand mathematical proofs, concepts, notations, and techniques of the theories of Automata, Formal Languages, and Turing machines. By the end of this course in computing theory, students will be able to:
  • use regular expressions effectively,
  • recognize problems that can't be solved by regular expressions,
  • design and create parsers and pattern recognition routines,
  • recognize feasible and intractable problems, and understand the equivalence of grammars, languages, and automata.

Course Content

Chapter 1
Chapter 2
Chapter 3
Chapter 4
Chapter 5
Chapter 6
Chapter 7
Chapter 9
Chapter 11
Review of Mathematical Preliminaries
Finite Automata
Regular Languages and Regular Grammars
Properties of Regular Languages
Context-Free Languages
Simplification of Context-Free Grammars
Pushdown Automata & CFL
Turing Machines and variations
The Chomsky Hierarchy
1 week
2 week
3 week
1 week
2 week
1 week
2 week
2 week
1 week

Additional Notes

Exams
  • The format for the exams is generally (but NOT always) as follows:  analysis, and design.
  • Grades will not be given out via e-mail.
  • No unexcused missed exams will be accepted. All exams are closed-book exams.
  • The final covers all the material in the course.
Quizzes
  • Quizzes (5-10 minutes) will be given on most Sundays at the end of the lecture. Typically they will involve simple questions that are designed to test the understanding of the material discussed in the preceding lecture.
  • There will be 4 Quizzes. The highest 3 quizzes grade will be counted. 
Makeup Exams
  • Let the instructor know about your makeup exam before 3 days prior to the scheduled exam time.
  • Makeup exam should not be given unless there is a valid excuse.
Drop Date Last day to drop the course is before the twelve (12 th ) week of the current semester.
Cheating
  • Cheating or copying from neighbor on exam, quiz, or homework is an illegal and unethical activity.
  • Standard JUST policy will be applied.
  • All graded assignments must be your own work (your own words).
Attendance
  • Excellent attendance is expected.
  • JUST policy requires the faculty member to assign ZERO grade (35) if a student misses more than 10% of the classes that are not excused
  • Sign-in sheets will be circulated.
  • If you miss class, it is your responsibility to find out about any announcements or assignments you may have missed.
Workload Average work-load student should expect to spend is 6 hours/week.
Graded Exams Instructor should return exam papers graded to students during the week after the exam date.
Participation
  • Participation in, and contribution to class discussions will affect your final grade positively. Raise your hand if you have any question.
  • Making any kind of disruption and (side talks) in the class will affect you negatively.
Finally Smoking is prohibited in all in-door places.

Top

Lecture Notes

No lecture notes available until now.

Top

 

First Exam

No info available until now.

Top

 

Second Exam

No info available until now.

Top

 

 

 
Official Site of Dr. Mohammad Al-Towaiq
Department of Computer Science - Jordan University of Science and Technology
Copyright © 2007 - All rights reserved