{"id":24665,"date":"2020-07-20T07:40:17","date_gmt":"2020-07-20T07:40:17","guid":{"rendered":"https:\/\/www.inspirenignite.com\/jntuh\/automata-and-compiler-design-syllabus-for-mca-2nd-year-2nd-sem-r19-regulation-jntuh-professional-elective-i\/"},"modified":"2020-07-20T07:40:17","modified_gmt":"2020-07-20T07:40:17","slug":"automata-and-compiler-design-syllabus-for-mca-2nd-year-2nd-sem-r19-regulation-jntuh-professional-elective-i","status":"publish","type":"post","link":"https:\/\/www.inspirenignite.com\/jntuh\/automata-and-compiler-design-syllabus-for-mca-2nd-year-2nd-sem-r19-regulation-jntuh-professional-elective-i\/","title":{"rendered":"Automata and Compiler Design Syllabus for MCA 2nd Year 2nd Sem R19 Regulation JNTUH (Professional Elective-I)"},"content":{"rendered":"

Automata and Compiler Design detailed Syllabus for Master of Computer Applications (MCA), R19 regulation has been taken from the JNTUH<\/a> official website and presented for the students affiliated to JNTUH course structure. For Course Code, Subject Names, Theory Lectures, Tutorial, Practical\/Drawing, Credits, and other information do visit full semester subjects post given below. The Syllabus PDF files can also be downloaded from the universities official website.<\/p>\n

For all the other MCA 2nd Year 2nd Sem Syllabus for R19 Regulation JNTUH, visit Master of Computer Applications 2nd Year 2nd Sem R19 Scheme<\/a>. <\/p>\n

For all the (Professional Elective-I) subjects refer to Professional Elective-I Scheme<\/a>. The detail syllabus for automata and compiler design is as follows. <\/p>\n

Course Objectives:<\/h4>\n

For the complete Syllabus, results, class timetable, and many other features kindly download the iStudy App<\/a>
It is a lightweight, easy to use, no images, and no pdfs platform to make students’s lives easier.<\/b>
\"Get<\/a>. <\/p>\n

Course Outcomes:<\/h4>\n
    \n
  1. Able to understand the concept of abstract machines and their power to recognize the languages.<\/li>\n
  2. Able to employ finite state machines for modeling and solving computing problems.<\/li>\n
  3. Able to design context free grammars for formal languages.<\/li>\n
  4. Demonstrate the ability to design a compiler given a set of language features.<\/li>\n
  5. Demonstrate the knowledge of patterns, tokens and regular expressions for lexical analysis.<\/li>\n
  6. Design and implement LL and LR parsers<\/li>\n
  7. Design algorithms to do code optimization in order to improve the performance of a program in terms of space and time complexity.<\/li>\n
  8. Design algorithms to generate machine code.<\/li>\n<\/ol>\n

    Unit I<\/h4>\n

    Introduction to Finite Automata: Structural Representations, Automata and Complexity, the Central Concepts of Automata Theory – Alphabets, Strings, Languages, Problems. Nondeterministic Finite Automata: Formal Definition, an application, Text Search, Finite Automata with Epsilon-Transitions. Regular Expressions: Finite Automata and Regular Expressions, Applications of Regular Expressions, Algebraic Laws for Regular Expressions, Conversion of Finite Automata to Regular Expressions.<\/p>\n

    Unit II<\/h4>\n

    For the complete Syllabus, results, class timetable, and many other features kindly download the iStudy App<\/a>
    It is a lightweight, easy to use, no images, and no pdfs platform to make students’s lives easier.<\/b>
    \"Get<\/a>. <\/p>\n

    Unit III<\/h4>\n

    Turing Machines: Introduction to Turing Machine, Formal Description, Instantaneous description, The language of a Turing machine Introduction to compiler: The structure of a compiler, the science of building a compiler, programming language basics<\/p>\n

    Unit IV<\/h4>\n

    Syntax Analysis: Introduction, Context-Free Grammars, Writing a Grammar, Top-Down Parsing, Bottom-Up Parsing, Introduction to LR Parsing: Simple LR, More Powerful LR Parsers, Using Ambiguous Grammars and Parser Generators.<\/p>\n

    Unit V<\/h4>\n

    For the complete Syllabus, results, class timetable, and many other features kindly download the iStudy App<\/a>
    It is a lightweight, easy to use, no images, and no pdfs platform to make students’s lives easier.<\/b>
    \"Get<\/a>. <\/p>\n

    Text Books:<\/h4>\n
      \n
    1. Introduction to Automata Theory, Languages, and Computation, John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman, 3rd Edition, Pearson Education.<\/li>\n
    2. Compilers: Principles, Techniques and Tools, Alfred V. Aho, Monica S. Lam, Ravi Sethi, Jeffry D. Ullman, 2nd Edition,<\/li>\n<\/ol>\n

      Reference Books:<\/h4>\n
        \n
      1. Theory of Computer Science – Automata languages and computation, Mishra and Chandrashekaran, 2nd edition, PHI.<\/li>\n
      2. Introduction to Languages and The Theory of Computation, John C Martin, TMH.<\/li>\n
      3. Introduction to Computer Theory, Daniel I.A. Cohen, John Wiley.<\/li>\n
      4. A Text book on Automata Theory, P. K. Srimani, Nasir S. F. B, Cambridge University Press.<\/li>\n
      5. Introduction to the Theory of Computation, Michael Sipser, 3rd edition, Cengage Learning.<\/li>\n
      6. Introduction to Formal languages Automata Theory and Computation Kamala Krithivasan, Rama R, Pearson.<\/li>\n<\/ol>\n

        For detail Syllabus of all other subjects of 2nd Year 2nd Sem Master of Computer Applications, visit MCA 2nd Year 2nd Sem Syllabus<\/a> Subjects.<\/p>\n

        For all MCA results, visit JNTUH MCA all years, and semester results <\/a>from direct links.<\/p>\n","protected":false},"excerpt":{"rendered":"

        Automata and Compiler Design detailed Syllabus for Master of Computer Applications (MCA), R19 regulation has been taken from the JNTUH official website and presented for the students affiliated to JNTUH […]<\/p>\n","protected":false},"author":2344,"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":[130],"tags":[],"class_list":["post-24665","post","type-post","status-publish","format-standard","hentry","category-mca"],"_links":{"self":[{"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/posts\/24665","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/users\/2344"}],"replies":[{"embeddable":true,"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/comments?post=24665"}],"version-history":[{"count":0,"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/posts\/24665\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/media?parent=24665"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/categories?post=24665"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/tags?post=24665"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}