{"id":17598,"date":"2020-09-10T03:37:53","date_gmt":"2020-09-10T03:37:53","guid":{"rendered":"https:\/\/www.inspirenignite.com\/mh\/it602-theory-of-computing-syllabus-for-it-6th-sem-2017-dbatu\/"},"modified":"2020-09-10T03:37:53","modified_gmt":"2020-09-10T03:37:53","slug":"it602-theory-of-computing-syllabus-for-it-6th-sem-2017-dbatu","status":"publish","type":"post","link":"https:\/\/www.inspirenignite.com\/mh\/it602-theory-of-computing-syllabus-for-it-6th-sem-2017-dbatu\/","title":{"rendered":"IT602: Theory of Computing Syllabus for IT 6th Sem 2017 DBATU"},"content":{"rendered":"<p align=\"justify\">Theory of Computing detailed syllabus scheme for B.Tech Information Technology (IT), 2017 onwards has been taken from the <a href=\"https:\/\/dbatu.ac.in\/syllabus-and-course-structure-for-b-tech-programs\/\" style=\"color: inherit\" target=\"_blank\" rel=\"noopener\">DBATU<\/a> official website and presented for the Bachelor of Technology students. For Subject Code, Course Title, Lecutres, Tutorials, Practice, Credits, and other information, do visit full semester subjects post given below. <\/p>\n<p align=\"justify\">For all other DBATU Syllabus for Information Technology 6th Sem 2017, do visit <a href=\"..\/dbatu-syllabus-for-information-technology-6th-sem-2017\">IT 6th Sem 2017 Onwards Scheme<\/a>. The detailed syllabus scheme for theory of computing is as follows.<\/p>\n<h2 align=\"center\">Theory of Computing Syllabus for Information Technology (IT) 3rd Year 6th Sem 2017 DBATU<\/h2>\n<p>  <title>Theory of Computing<\/title><\/p>\n<h4>Course Objectives:<\/h4>\n<p id=\"istudy\" style=\"text-align:center\">For the complete syllabus, results, class timetable, and many other features kindly download the <a href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy\" target=\"_blank\" rel=\"noopener\">iStudy App<\/a><br \/><b> It is a lightweight, easy to use, no images, and no pdf platform to make students&#8217;s lives easier.<\/b><br \/><a href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy&amp;pcampaignid=pcampaignidMKT-Other-global-all-co-prtnr-py-PartBadge-Mar2515-1\" target=\"_blank\" rel=\"noopener\"><img decoding=\"async\" src=\"https:\/\/play.google.com\/intl\/en_us\/badges\/static\/images\/badges\/en_badge_web_generic.png\" alt=\"Get it on Google Play\" style=\"height:65px\"><\/a>.  <\/p>\n<h4>Course Outcomes:<\/h4>\n<p>  After learning the course the students should be able:<\/p>\n<ol>\n<li>Design Finite State Machine, Pushdown Automata, and Turing Machine.<\/li>\n<li>Explain the Decidability or Undecidability of various problems<\/li>\n<\/ol>\n<h4>Unit I<\/h4>\n<p>  Fundamentals: Strings, Alphabet, Language, Operations, Finite state machine, Definitions, Finite automaton model, Acceptance of strings and languages, Deterministic finite automaton and Non deterministic finite automaton, Transition diagrams, Language recognizers.<\/p>\n<h4>Unit II<\/h4>\n<p id=\"istudy\" style=\"text-align:center\">For the complete syllabus, results, class timetable, and many other features kindly download the <a href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy\" target=\"_blank\" rel=\"noopener\">iStudy App<\/a><br \/><b> It is a lightweight, easy to use, no images, and no pdf platform to make students&#8217;s lives easier.<\/b><br \/><a href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy&amp;pcampaignid=pcampaignidMKT-Other-global-all-co-prtnr-py-PartBadge-Mar2515-1\" target=\"_blank\" rel=\"noopener\"><img decoding=\"async\" src=\"https:\/\/play.google.com\/intl\/en_us\/badges\/static\/images\/badges\/en_badge_web_generic.png\" alt=\"Get it on Google Play\" style=\"height:65px\"><\/a>.  <\/p>\n<h4>Unit III<\/h4>\n<p>  Grammar Introduction- Types of Grammar &#8211; Context Free Grammars and Languages- Derivations and Languages &#8211; Ambiguity- Relationship between derivation and derivation trees &#8211; Simplification of CFG -Elimination of Useless symbols &#8211; Unit productions &#8211; Null productions &#8211; Greiback Normal form &#8211; Chomsky normal form &#8211; Problems related to CNF and GNF<\/p>\n<h4>Unit IV<\/h4>\n<p>  Pushdown Automata- Definitions &#8211; Moves &#8211; Instantaneous descriptions &#8211; Deterministic pushdown automata -Equivalence of Pushdown automata and CFL &#8211; pumping lemma for CFL &#8211; problems based on pumping Lemma.<\/p>\n<h4>Unit V<\/h4>\n<p id=\"istudy\" style=\"text-align:center\">For the complete syllabus, results, class timetable, and many other features kindly download the <a href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy\" target=\"_blank\" rel=\"noopener\">iStudy App<\/a><br \/><b> It is a lightweight, easy to use, no images, and no pdf platform to make students&#8217;s lives easier.<\/b><br \/><a href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy&amp;pcampaignid=pcampaignidMKT-Other-global-all-co-prtnr-py-PartBadge-Mar2515-1\" target=\"_blank\" rel=\"noopener\"><img decoding=\"async\" src=\"https:\/\/play.google.com\/intl\/en_us\/badges\/static\/images\/badges\/en_badge_web_generic.png\" alt=\"Get it on Google Play\" style=\"height:65px\"><\/a>.  <\/p>\n<h4>Unit VI<\/h4>\n<p>  Unsolvable Problems and Computable Functions &#8211; Primitive recursive functions &#8211; Recursive and recursively enumerable languages &#8211; Universal Turing machine. MEASURING AND CLASSIFYING COMPLEXITY: Tractable and Intractable problems- Tractable and possibly intractable problems &#8211; P and NP completeness &#8211; Polynomial time reductions.<\/p>\n<h4>Text Books:<\/h4>\n<ol>\n<li>Hopcroft J. E., Motwani R. and Ullman J. D., Introduction to Automata Theory, Languages and Computations, Second Edition, Pearson Education, 2008.<\/li>\n<li>John C Martin, Introduction to Languages and the Theory of Computation, Tata McGraw Hill Publishing Company, New Delhi, Third Edition, 2007.<\/li>\n<\/ol>\n<h4>Reference Book:<\/h4>\n<ol>\n<li>Mishra K L. P. and Chandrasekaran N, Theory of Computer Science &#8211; Automata, Languages and Computation, Third Edition, Prentice Hall of India, 2004.<\/li>\n<li>Harry R. Lewis and Christos H. Papadimitriou, Elements of the Theory of Computation, Second Edition, Prentice Hall of India, Pearson Education, New Delhi, 2003.<\/li>\n<li>Peter Linz, An Introduction to Formal Language and Automata, 3rd edition, Narosa Publishers, New Delhi, 2002.<\/li>\n<li>Kamala Krithivasan and Rama R., Introduction to Formal Languages, Automata Theory and Computation, Pearson Education, 2009.<\/li>\n<\/ol>\n<p align=\"justify\">For detail syllabus of all other subjects of Information Technology (IT) 6th Sem 2017 regulation, visit <a href=\"..\/category\/dbatu\/6th-sem-dbatu\">IT 6th Sem Subjects<\/a> syllabus for 2017 regulation.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Theory of Computing detailed syllabus scheme for B.Tech Information Technology (IT), 2017 onwards has been taken from the DBATU official website and presented for the Bachelor of Technology students. For [&hellip;]<\/p>\n","protected":false},"author":2351,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_bbp_topic_count":0,"_bbp_reply_count":0,"_bbp_total_topic_count":0,"_bbp_total_reply_count":0,"_bbp_voice_count":0,"_bbp_anonymous_reply_count":0,"_bbp_topic_count_hidden":0,"_bbp_reply_count_hidden":0,"_bbp_forum_subforum_count":0,"footnotes":""},"categories":[98,109],"tags":[],"class_list":["post-17598","post","type-post","status-publish","format-standard","hentry","category-6th-sem-dbatu","category-it-dbatu"],"_links":{"self":[{"href":"https:\/\/www.inspirenignite.com\/mh\/wp-json\/wp\/v2\/posts\/17598","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.inspirenignite.com\/mh\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.inspirenignite.com\/mh\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.inspirenignite.com\/mh\/wp-json\/wp\/v2\/users\/2351"}],"replies":[{"embeddable":true,"href":"https:\/\/www.inspirenignite.com\/mh\/wp-json\/wp\/v2\/comments?post=17598"}],"version-history":[{"count":0,"href":"https:\/\/www.inspirenignite.com\/mh\/wp-json\/wp\/v2\/posts\/17598\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.inspirenignite.com\/mh\/wp-json\/wp\/v2\/media?parent=17598"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/mh\/wp-json\/wp\/v2\/categories?post=17598"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/mh\/wp-json\/wp\/v2\/tags?post=17598"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}