| University :Damietta University | 
| Faculty :Faculty of Science | 
| Department :الرياضيات | 
|  | 
| 1- 1- Course data :- | 
|  | | Code: | 425ر |  | Course title: | Theory of Computers |  | Year/Level: | رابعة رياضيات وعلوم حاسب |  | Program Title: |  |  | Specialization: |  |  | Teaching Hours: | Theoretical: | 2 | Tutorial: |  | Practical: | 4 | 
 | 
| 2- 2- Course aims :- | 
|  | Have the basic skills and knowledge (Mathematics and Computer Science, problem solving skills, analytical skills, communication skills and flexibility) necessary for a successful career in Mathematics/Computer Science.Are able to apply knowledge of Mathematics and Computer Science fundamentals, including programming, computer and data structures and computer networks. 
 | 
| 3- 3- Course Learning Outcomes :- | 
|  |  | 
| 4- 4- Course contents :- | 
|  | | No | Topics | Week No. | 
|---|
 | 1 | Introduction to computer theory |  |  | 2 | Automata |  |  | 3 | Recursive definition of Languages |  |  | 4 | Regular expressions |  |  | 5 | Finite automata |  |  | 6 | Transition Graphs |  |  | 7 | Kleene’s theorem |  |  | 8 | Tree automaton |  |  | 9 | Turing  machine |  |  | 10 | Geometric automaton |  | 
 | 
| 
 | 
| 5- 5- Teaching and learning methods  :- | 
|  | | S | Method | 
|---|
 |  | Lecture and practical | 
 | 
| 
 | 
| 6- 6- Teaching and learning methods of disables  :- | 
|  | لايوجد
 | 
| 
 | 
| 7- 7- Student assessment  :- | 
|  | - Student assessment methods | 
|  |  | 
|  | - Timing | 
|  | | No | Method | Week No. | 
|---|
 | 1 | لايوجد | لايوجد | 
 | 
|  | - Degree | 
|  | | No | Method | Degree | 
|---|
 | 1 | Mid_term examination | 0 |  | 2 | Final_term examination | 45 |  | 3 | Oral examination | 10 |  | 4 | Practical examination | 45 |  | 5 | Semester work | 0 |  | 6 | Other types of asessment | 100 |  | Total | 100% | 
 | 
| 
 | 
| 8- 8- List of books and references | 
|  |  | 
| 
 | 
| 9- 9- Matrix of knowledge and skills of the course | 
|  | | S | Content | Study week | 
|---|
 |  | Introduction to computer theory |  |  |  | Automata |  |  |  | Recursive definition of Languages |  |  |  | Regular expressions |  |  |  | Finite automata |  |  |  | Transition Graphs |  |  |  | Kleene’s theorem |  |  |  | Tree automaton |  |  |  | Turing  machine |  |  |  | Geometric automaton |  | 
 | 
| 
 | 
| Course Coordinator(s):  - | 
|  | محمد مهدى فرج بدر
 | 
| Head of department:  - | 
|  | محمد أحمد أنور محمد الشهاوى |