المرفقات
المحاضرات
الإسم تفاصيل أخرى
Introduction

Introduction to the course contents

Chapter 0

Mathematical Background

Chapter 1

Finite State Machine

Chapter 02

Context-Free Languages

Chapter 03

Turing Machines

Chapter 04

Decidability

Chapter 07

Computational Complexity

الخطة الدراسية
2401 عال  -  النظرية الحسابية
عدد الوحدات عدد الساعات
نظري عملي
3 3 0
وصف المقرر

This course is an introduction to the theory of computational complexity and standard complexity classes. Topics include languages, finite and nondeterministic finite automata, Context-free grammar, Turing machines, computability, computational complexity, formal logic, and computational logic.

المتطلبات

CS1111

الكتاب

Introduction to the Theory of Computation " -ISBN-10:0534950973, ISBN-13:978-0534950973

المؤلفين

Michael Sipser

المحاضرين

Dr. Mohammad Alhawarat

Abdelrahman Alaraj

احتساب الدرجات
الأهداف
الهدف التقييم
   1 .  Describe different computational models including finite automata, regular expressions, context free grammars, and Turing machines. Exams
   2 .  Analyze real problems and formulating it as a language. Exams
   3 .  Use several computational models efficiently for solving problems formally. Exams
   4 .  Classify computer problems according to computability and complexity. Exams
   5 .  Understand computer algorithms’ complexity and cost factors. Exams
   6 .  Design efficient solution algorithms for computer problems through proper understanding of algorithms’ complexities Exams
الموضوعات
الأسبوع الوصف - القراءة  
1-15

Introduction

Regular Languages

Context-Free Languages

The Church-Turing Thesis

Decidability

Time Complexity


القراءة:

Introduction to the Theory of Computation ", Michael Sipser