جامعة العلوم اإلسالمية العالمية دائرة االعتماد وضمان الجودة مخطط المادة الدراسية Fundamental of Programming Language 0602321 Course Name/اسم المادة 3 48 Credit Hours/)الساعات المعتمدة (نظرية وعملية Actual Credit Hours /)الساعات الفعلية (نظرية وعملية Prerequisites / المتطلبات المتزامنة/ المتطلبات السابقة 0602211 Operation Researches Bachelor Course No /رقم المادة Program Name /اسم البرنامج Program No /رقم البرنامج The world Islamic secience & Education University Information Technolgy Computer Science 2 First 2016/2017 Bachelor English 2012 / every year University Name /اسم الجامعة .1 .2 .3 .4 .5 .6 .7 College Name /الكلية .8 .9 Course Level / مستوى المادة.10 Semester/Academic Year/ الفصل الدراسي/ العام الجامعي.11 Degree / الدرجة العلمية للبرنامج.12 Other Departments األقساام األرارى المراترفة تاي سادريا الماادة.13 Department Name /القسم sharing the course Teaching language / لغة التدريا.14 ساااريا مراجعااة ماطااد المااادة/ ساااريا اساات داط ماطااد المااادة الدراسااية.15 Last Syllabus Update /الدراسية :Coordinator /منسق المادة .16 Dr Ali Al-Ibrahim :Name /االسم 304 :Office Number /رقم المكتب 8-10+ 11-01+ 9:30-11:Office Hours/ الساعات المكتبية 2363 :Phone Number /رقم الهاتف [email protected] :E-mail /البريد اإللكتروني :Instructors: /مدرسو المادة .17 Dr Ali Al-Ibrahim :Name /االسم 304 :Office Number /رقم المكتب 8-10+ 11-01+ 9:30-11:Office Hours/ الساعات المكتبية 2363 :Phone Number /رقم الهاتف [email protected] :E-mail /البريد اإللكتروني : Course Description/وصف المادة .18 Theory of computation is a course dedicates to teach the student the meaning of computing. What we can do with a computer, and how it can do and why some problems are computable and some other problems are not. Theory of computation through a set of abstract machines. Introduction to basic concepts and languages, recursive definition and regular expression, finite automata and transition graphs, Kleene’s theorem and non-determinism, regular languages and decide ability, Context-free grammar and Chomsky normal form, pushdown automata and context-free languages, parsing, Turing machines and Chomsky hierarchy. :Course Goals & Objectives /أهداف تدريس المادة ونتائجها .19 To introduce students the basic concepts in theoretical computer science, and the formal relationships among machines, languages and grammars. Course Outcomes Knowledge: 1 Explain the basic concepts of deterministic and non-deterministic finite automata, regular language, context-free language, Turing machines, Church’s thesis, halting problem, computability and complexity 2 Describe the formal relationships among machines, languages and grammars Professional Skill : 3 Perceive the power and limitation of a computer 4 Solve the problems using formal language Attitude”. 5 Develop a view on the importance of computational theory :Course Content and Schedule /محتوى المادة الدراسية والجدول الزمني المراجع Referenc es أساليب التقييم Assessme nt policies نتاجات التعلم المتحققة Outputs المدرس Lecturer األسبوع week's تفاصيل Topic الموضوع Details .20 الموضوع Topics Chapter 0 Question -compilation + Quiz theory Dr Ali Alibrahim W1 compilation theory . -Introduction to automata, Chapter 0 Question -Complexity + Quiz theory Dr Ali and Alibrahim W2 Complexity theory and computation theory. -Complexity theory and computation theory. Dr Ali Alibrahim W3 -Sets, -Relations, -Functions, -Detailed and fast review of some of computation theory Chapter 0 Question + Quiz -Sets, -Relations, -Functions, the mathematical notions and terminology like Chapter 0 Question + Quiz Chapter 0 Question -Complexity + Quiz theory Dr Ali -Graphs, Al-Strings and ibrahim language And proofing method Dr Ali + Quiz Chapter 1 Question + Homewo rk -Graphs, -Strings and language And proofing method. -Detailed and fast review of some of the mathematical notions and terminology like W5 Complexity theory and computation theory. -Complexity theory and computation theory. and Al- computation theory Chapter 1 Question W4 ibrahim Dr Ali Al- W6 Ibrahim Deterministic Dr Ali Al- W6 Finite Automata ibrahim DFA, NonDeterministic Finite Automata DFA, First Exam Regular Finite Automata language that includes DFA, finite automata - Deterministic Dr Ali Al- W7 ibrahim NonDeterminist ic Finite Automata NDFA, Regular language that includes finite automata Chapter 1 Question General Deterministic Finite Automata GDFA, Dr Ali Al- W8 ibrahim General Regular Deterministic language Finite Automata that includes GDFA, finite automata Chapter 1 Question - Regular + Quiz languge and Dr Ali AlIbrahim -Regular languge and regular regular W9 Regular language ,Nonregular languge Expresion Chapter 2 Question - content free + Quiz grammar Expresion Dr Ali AlIbrahim W10 - content free grammar W11 Chapter 2 Quiz +Questio n PushDown Automata (PDA) Chapter 3 Quzis Chapter 4 Chapter 5 Quiz +1. time complexity Question and space complexity Turing machine Dr Ali AlIbrahim W11+ W12 Dr Ali W13+ W14 Dr Ali PushDown Automata (PDA) Turing machine Context free languages Second Exam Context free languages Turing machine W15 1. time complexity Decidability, and reducibility space Complexity complexity theory: W16 Final Exam :Activities and Strategies /النشاطات واالستراتيجيات التدريسية Class lectures, lecture notes, homework assignments are designed to achieve the course objectives. Lecture notes will be available before each exam. It will contain homework assignments and important instructions. You should read the assigned chapters before class, complete assignments on time. Ask questions. You are responsible for all material covered in the class. .21 : Assessment Policies and Course Requirements /أساليب التقييم ومتطلبات المادة .22 Grading Component Points Date First Exam 20 % See the Website Second Exam Assignments, quizzes, attendance and class activities Final Exam 20 % 10% See the Website See the Website 50 % 100% See the Website TOTAL : Course Polcies / السياسات المتبعة بالمادة .23 Lecture notes will be available before each exam. It will contain homework assignments and important instructions. You should read the assigned chapters before class, complete assignments on time. Ask questions. :Required Devices and Tools /المعدات واألجهزة المطلوبة.24 Datashow + WhiteBorad : References/المراجع .25 Introduction to the theory of computation Introduction to the theory of computation Michael Sipser Ali Al-Ibrahim Course Technology –GENGAGE Learning 2006 2016 2d ISBN-10:0-619-21764-2 1St edition ISBN-1047 /3/2015 :Additional Notes/معلومات إضافية Dr Ali Al-Ibrahim _______________ Dr Ali Al-Ibrahim ____________ ______________________ ____________ ______________________ .26 :Coordinator /اسم منسق المادة :Signature/التوقيع : Syllabus committee head/مقرر لجنة الخطة : Signature/التوقيع :Head of department /رئيس القســـم : Signature/التوقيع __ : Syllabus committee head (Faculty)/)مقرر لجنة الخطة ( الكلية ______________________ : Signature/التوقيع ______________________ :Dean /العميد ______________________ : Signature/التوقيع رئيس القسم مساعد العميد لضمان الجودة ملف المادة دائرة االعتماد وضمان الجودة :نسخة إلى -
© Copyright 2025 Paperzz