Nevşehir Hacı Bektaş Veli University Course Catalogue
|
|||||
| Year/Semester of Study | 3 / Spring Semester | ||||
| Level of Course | 1st Cycle Degree Programme | ||||
| Type of Course | Compulsory | ||||
| Department | DEPARTMENT OF COMPUTER ENGINEERING | ||||
| Pre-requisities and Co-requisites | None | ||||
| Mode of Delivery | Face to Face | ||||
| Teaching Period | 14 Weeks | ||||
| Name of Lecturer | SEMA ATASEVER (sema@nevsehir.edu.tr) | ||||
| Name of Lecturer(s) | EBUBEKİR KAYA, NUH AZGINOĞLU, | ||||
| Language of Instruction | Turkish | ||||
| Work Placement(s) | None | ||||
| Objectives of the Course | |||||
| The aim of this course is to teach the students basic knowledge of language theory and automata . | |||||
| Learning Outcomes | PO | MME | |
| The students who succeeded in this course: | |||
| LO-1 | Can knows the basic concepts of Automata Theory, Computation Theory and Formal Languages. |
PO-4 Students gain the ability to apply knowledge of mathematics, science and engineering. PO-5 Students gain the ability to define, model, formulate and solve general engineering problems. PO-7 Students gain the ability to identify, define, formulate and solve problems specific to Computer Engineering. |
Examination |
| LO-2 | Can solve questions on abstract machines such as finite state machines, pushdown machines and Turing machines. |
PO-4 Students gain the ability to apply knowledge of mathematics, science and engineering. PO-5 Students gain the ability to define, model, formulate and solve general engineering problems. PO-7 Students gain the ability to identify, define, formulate and solve problems specific to Computer Engineering. |
Examination |
| LO-3 | Can make formal languages with their regular expressions and formal grammars. |
PO-4 Students gain the ability to apply knowledge of mathematics, science and engineering. PO-5 Students gain the ability to define, model, formulate and solve general engineering problems. PO-7 Students gain the ability to identify, define, formulate and solve problems specific to Computer Engineering. |
Examination |
| LO-4 | Can understands the abstract models of the computation process. |
PO-4 Students gain the ability to apply knowledge of mathematics, science and engineering. PO-5 Students gain the ability to define, model, formulate and solve general engineering problems. PO-7 Students gain the ability to identify, define, formulate and solve problems specific to Computer Engineering. |
Examination |
| PO: Programme Outcomes MME:Method of measurement & Evaluation |
|||
| Course Contents | ||
| Formal languages, grammars, regular expressions and automata, syntax analysis and grammar analysis, finite state machine concepts and methods, calculability, decision making and complexity theory. | ||
| Weekly Course Content | ||
| Week | Subject | Learning Activities and Teaching Methods |
| 1 | Formal Languages | Lecture / Question - Answer, problem solving |
| 2 | Grammar, Chomsky Grammar | Lecture / Question - Answer, problem solving |
| 3 | Grammar and automata | Lecture / Question - Answer, problem solving |
| 4 | Regular expressions | Lecture / Question - Answer, problem solving |
| 5 | Deterministic Finite Automat, DFA | Lecture / Question - Answer, problem solving |
| 6 | Nondeterministic Finite Automat, NFA | Lecture / Question - Answer, problem solving |
| 7 | Nondeterministic Finite Automat, NFA | Lecture / Question - Answer, problem solving |
| 8 | mid-term exam | |
| 9 | Equivalence | Lecture / Question - Answer, problem solving |
| 10 | Equivalence | Lecture / Question - Answer, problem solving |
| 11 | Pushdown Automats | Lecture / Question - Answer, problem solving |
| 12 | Features of regular languages | Lecture / Question - Answer, problem solving |
| 13 | Features of regular languages | Lecture / Question - Answer, problem solving |
| 14 | Decision making and calculation mechanisms | Lecture / Question - Answer, problem solving |
| 15 | Decision making and calculation mechanisms | Lecture / Question - Answer, problem solving |
| 16 | final exam | |
| Recommend Course Book / Supplementary Book/Reading | ||
| 1 | Ana kaynak: Introduction to Automata Theory, Languages and Computation, John E. Hopcroft, R. M., J. D. U., ISBN 0321476174 | |
| 2 | Yardımcı kaynaklar: Özdevinirler (Otomatlar) Kuramı ve Biçimsel Diller, A. Ünal Yarımağan, 2004. | |
| Required Course instruments and materials | ||
| Auxiliary textbook, projection, computer. | ||
| Assessment Methods | |||
| Type of Assessment | Week | Hours | Weight(%) |
| mid-term exam | 8 | 1 | 40 |
| Other assessment methods | |||
| 1.Oral Examination | |||
| 2.Quiz | |||
| 3.Laboratory exam | |||
| 4.Presentation | |||
| 5.Report | |||
| 6.Workshop | |||
| 7.Performance Project | |||
| 8.Term Paper | |||
| 9.Project | |||
| final exam | 16 | 1 | 60 |
| Student Work Load | |||
| Type of Work | Weekly Hours | Number of Weeks | Work Load |
| Weekly Course Hours (Theoretical+Practice) | 3 | 14 | 42 |
| Outside Class | |||
| a) Reading | 7 | 4 | 28 |
| b) Search in internet/Library | 7 | 4 | 28 |
| c) Performance Project | 0 | ||
| d) Prepare a workshop/Presentation/Report | 8 | 1 | 8 |
| e) Term paper/Project | 0 | ||
| Oral Examination | 0 | ||
| Quiz | 0 | ||
| Laboratory exam | 0 | ||
| Own study for mid-term exam | 6 | 1 | 6 |
| mid-term exam | 1 | 1 | 1 |
| Own study for final exam | 6 | 1 | 6 |
| final exam | 1 | 1 | 1 |
| 0 | |||
| 0 | |||
| Total work load; | 120 | ||