Page-1 Course Handout of Theory of Computation (CS 302) Oo NU NIIT UNIVERSITY COURSE HANDOUT Session: 2022-2023 ‘Sub Session: Semester II (Jan-Jun) Course Name: Theory of Computation (CS 302) LITIPIC: 3/1014 Course Incharge: Mr. Ayan Nandy Course Faculty: Mr. Ayan Nandy ( [email protected] | Mobile No N/A ) Registered Batches: B.Tech. - CSE 2017 , CSE 2019 , CSE 2021 ise- Cs 2020 Course Description In this course, the following topics will be covered - Finite Automata (deterministic and nondeterministc), regular operations. Rogular Expression, Equivalence of DFA, NFA and RES, closure properties. Non regular languages and pumping lemma, Minimization of states of DFAs, Myhill-Nerode Theorem. CFGs, Chomsky Normal Form, Non CFLs and pumping lemma for CFLs, PDAs, Equivalence of PDA and CFG. Properties of CFLs, DCFLs, Cocke—Younger-Kasami algorithm for Context Free Grammars. Turing Machines and its variants. Configuration graph, closure properties of decidable and Turing-recognizable languages, decidablity, Diagonalization Proof. Undecidabilty, Halting Problem and its undecidabiliy. Introduction to ‘complexity theory, time complexity, P and NP, SAT, Poly-time Reducblty, NP-completeness, Cook-Levin Theorem, Space Complexity, PSPACE, TQBF, L and NL, NLis equal to co-NL. [SNo. |Description GOT [Understand the key notions of computation through problem solving C02 [Understand finite automata, regular grammars, and regular expression representations of regular languages CO3_ [Determine fa language is context-free ‘CO4 [Explain the concept of undecidabilty ‘COS _|List examples of undecidable problems 06 |Gather a fair idea of important complexity classes lke P, NP, PSPACE, L, NL, BPP, IP Course outcome mapping with Programme Outcomes: ‘GO | POT | PO2 | POS | POA | POS | POG | POT | POS | POD [PO10[PO11|PO12, cory H{H|H|Mi|M/e{[e{[c{[mM|{[tl/tl[™ coz, H | H|H|M|M{/LE{[LeE[Lt[mM|[Ltf[tf[™ cosy H | H}H[Mi|M/c{[e{[c{[mM|[it[tl[m coop | H|A|MimMm{[cfeotolm|cletlm™Page -2 Course Handout of Theory of Computation (CS 302) Lecture Plan Syllabus Details Hours required to | Course Outcome ‘complete 1 _ Introduction to Theory of Computation 1 coi 2_ [Deterministic Finite Automata 2 GOT, CO2 3 [Regular Languages and Closure Properties 7 C01, CO2 [Non Regular Languages and Pumping Lemma 2 G01, COZ 8 [Generalized Pumping Lemma 7 COT, Coz 6 _| Non Deterministic Finite Automata 3 C01, CO2 7__|Non-Deterministic Finite Automata with epsiion transitions 1 Or, COZ @ _ [Regular Expressions 2 604, Coz 9 [Closure properties of Regular Languages 2 COT, CO 10 _[Dacision Problems conceming Regular Languages 1 601, COZ 11. [Myhill Nerode Theorem 3 601, o2 42, | DFA Minimization 1 C01, GO? 13 [Introduction to Context free Grammars 1 COT, Oz, COs 14_ [Examples of Context free Grammars, parse trees 1 COT, C02, COS 15, [Regular Languages are Context Free 1 COT, G02, COS 16 [Chomsky Normal Form 3 COT, COZ, COS 17_| Pumping Lemma for Context Free Languages: 2 601, C02, 603 418 [Closure Properties of OFLs 1 C01, G02, COS 19 [Decision Algorithms for CFLs 1 C01, COZ, COS 20_ [Push Down Automata 1 601, 602, C03 21 _[Iniroduction to Turing Machines 3 G01, C02, CO4 22_[Mullitape Turing machine and Non-Determinisic Turing Machine 7 COT, CO2, COs 23_[Diagonalization and Existence of languages not recursively enumerable 7 C01, C02, COA, Cos. 24 [Recursive languages, Halting Problem and its undecidabiliy| 2 C01, C02, CO4, cos. 25 [Introduction to Computational Complexity 1 ‘601, C02, C05, cos, 26 [NP Completeness (C04, CO2, COS, cos, 27 |PSPACE Completeness, L, NL, BPP, IP 7 COT, CO2, COS, cos. Total lecture required aa Number of lectures may vary. Book Details Text Books ‘TBI. Michael Sipser, Introduction to Theory of Computation, 2nd edition, Thomson Course Technology, 2006. ISBN: 0534950973,Page -3 Course Handout of Theory of Computation (CS 302) Reference Books RBI. Apostolos Doxiacis, Christos Papadimitriou, Logicamix: An Epic Search for Truth, Bloomsbury Publishing, 2009, ISBN: 9782311102321 RB2, Douglas Hofstadter, Gadel, Escher, Bach: an Etemal Golden Braid, Basic Books, ISBN 9780465026562, Online course work/ Massive Open Online Course/ Open source web material hitps:/ocw-mit.edufcourses/electrical-engineering-and-computer-science/é-080-great-ideas-in-theoretical-computer-science- spring-2008/ hntps:ifblog.computationalcomplexity.org/2004/06,impagiazzos-five-worlds.hml hitips:ild. acm orgidoi/10.1145/258633.258500 hitp:thomepages.cwi.ril rlewottipubl/philasophy/phthesis pat hips: acm. orgidoi/10.1145/76959.76371 htps:fblog.computationalcomplexity.orgi2009/04Vletter html hitp:tfo.cs.ilinois.eduteaching/497/"3-crcuits pdf hitps:oow.mit.eduthigh-schoothumanitios-and.social-scloncasigodel-oschor-bach! hip:shww. peoplo.vou.edu ido)ethaiyGEBINotostindox him! hitp:shvwufelderbooks.com/papersigodel htm! Evaluation Scheme (Theory! Practical Evaluation Component Exam Month [Exam Duration | _ Mode of Examination [Weighted Marks (in Hrs) lou Apa 7 Pen Paper 10.00 Mid Semester! February 1 Pon Paper 20.00 Mid Semester March 15 Pen Paper 20.00 [ComprehensivalEnd Term Exam May 3 Pon Paper 7000 lAtendance Not Applicable NotAppicable Tot Apoicabie 70.00 Mode of Tutorial Problem Sets willbe uploaded in the Learning Portal every weekend. Students will work on those problems and discuss thelr doubts during the Tutorial sessions. t of Tentative Tutorial Problems from the book by Sipser and other resources will be discussed. Problem sets will be uploaded to the Jeaming portal and the doubts will be discussed during the Tutorial sessions. Course outcome mapping with evaluation component: co Mid ]_Wid | Quiz cot] oH H H [NA co2| H U NA cos] Mt v H | NAPage 4 Course Handout of Theory of Computation (CS 302) cos] v TNA Make up Policy ‘Students who are likely to miss a component of evaluation due to any genuine reason may be given a make-up for that ‘component by the Course In-Charge, The students are required to approach the Course In-Charge immediately for the same. before the conduct of the evaluation component. tis the responsibilty ofthe student to approach the Course In-Charge. The Course In-Charge will not allow makeup, if student approaches 7 days after the evaluation component, There will be no ‘makaup for the quizzes, Plagiarism We are committed to uphold the standards of academic integrity and honesty. Plagiarism in any form is unacceptable and wil be treated seriously (Student Handbook R 49), If during an open book examination, a student answers a question which was not asked to the particular student put to some other student in the class, then the student might pe awarded zero marks for the examination Grading Policy Marks obtained in all the components of evaluation shall be totaled and the final marks shall be converted inthe letter grades, as per University norms. The grading is relative and normally, its centered around the average of a class. Mid-Semester ¢grading will be announced after the completion of about 50% of the evaluation components (Student Handbook R 40). There 's no marks for attendance. But the class participation ofthe students in the tutorial sessions will be observed and based on the responses of the students in the chatbox for the online class, the student can awarded marks to be topped up to the (Quizt and Quiz 2 marks. University Attendance Policy Students are requested to go through the Student Handbook for better understanding of the attendance policy. Students is ‘advised to regularly check hisher attendance on ERP. In case of any discrepancy in attendance record, student should report Conly through e-mailfwriten communication (no oral communication will be entertained) to the Course In-Charge in the same ‘week itself, otherwise request willbe not considered (Student Handbook R 37 and NU Attendance policy). Consultation Hours Online Office Hours(OOH) will be announced after the time table is published by the Academic Office.