Scribd Logo
Upload

Welcome to Scribd!

  • 23 views

    How To Learn From GATE Applied Course - TOC

    Uploaded by

    rythgng
    This document contains a table summarizing the number of questions asked from various topics related to automata theory and formal languages in previous year question papers from 2017 to 2021. The topics covered include Deterministic Finite Automata, Non-deterministic Finite Automata, Regular Expressions, Regular Languages, Context-Free Languages, Context-Free Grammars, Turing Machines, Recursive and Recursively Enumerable Languages, Decidability and Undecidability, and Complexity Classes. For each topic and year, the table provides the number of questions and also categorizes the difficulty level as easy, medium or hard. The total number of questions for each year is provided at the bottom.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content

    You might also like

    How To Learn From GATE Applied Course - TOC

    Uploaded by

    rythgng
    23 views1 page
    This document contains a table summarizing the number of questions asked from various topics related to automata theory and formal languages in previous year question papers from 2017 to 2021. The topics covered include Deterministic Finite Automata, Non-deterministic Finite Automata, Regular Expressions, Regular Languages, Context-Free Languages, Context-Free Grammars, Turing Machines, Recursive and Recursively Enumerable Languages, Decidability and Undecidability, and Complexity Classes. For each topic and year, the table provides the number of questions and also categorizes the difficulty level as easy, medium or hard. The total number of questions for each year is provided at the bottom.

    Original Description:

    Original Title

    How to learn from GATE Applied Course_TOC

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document contains a table summarizing the number of questions asked from various topics related to automata theory and formal languages in previous year question papers from 2017 to 2021. The topics covered include Deterministic Finite Automata, Non-deterministic Finite Automata, Regular Expressions, Regular Languages, Context-Free Languages, Context-Free Grammars, Turing Machines, Recursive and Recursively Enumerable Languages, Decidability and Undecidability, and Complexity Classes. For each topic and year, the table provides the number of questions and also categorizes the difficulty level as easy, medium or hard. The total number of questions for each year is provided at the bottom.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    23 views1 page

    How To Learn From GATE Applied Course - TOC

    Uploaded by

    rythgng
    This document contains a table summarizing the number of questions asked from various topics related to automata theory and formal languages in previous year question papers from 2017 to 2021. The topics covered include Deterministic Finite Automata, Non-deterministic Finite Automata, Regular Expressions, Regular Languages, Context-Free Languages, Context-Free Grammars, Turing Machines, Recursive and Recursively Enumerable Languages, Decidability and Undecidability, and Complexity Classes. For each topic and year, the table provides the number of questions and also categorizes the difficulty level as easy, medium or hard. The total number of questions for each year is provided at the bottom.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 1

    TOC 2021 Set-1 2021-Set2 2020 2019 2018 2017 Set-1 2017 Set-2 2016 Set-1 2016 Set-2

    Set-1 2017 Set-2 2016 Set-1 2016 Set-2 2015 Set-1 2015 Set-2 2015 Set-3 2014 Set-1 2014 Set-2 2014 Set-3 2013 2012 EASY/MEDIUM/HARD
    DFA and NFA(Construction of DFA,
    NFA, E-NFA, Minimimization,
    Interconversions). Note: Most of the
    questions from DFA with minimal
    states , Mealy and Moore Machines 2 3 2 2 1 1 3 1 3 2 1 1 4 EASY
    Regular Expressions (Construction of
    RE, and Inter conversions from RE to
    FA and vice versa) 2 1 2 1 2 1 2 1 EASY
    Regular Languages and Grammars (
    Regular Grmmamars, Closure
    Properties, Decision properties,
    Pumpimg Lemma for RLs) 1 3 2 2 1 3 2 1 3 EASY
    PDA (Construction , Example PDAs) 2 2 2
    CFLs (Verifying the given languages
    CFLs or not, Closure properties,
    Desicion properties, Pumpimg
    Lemma for CFLs 3 2 2 2 2 3 2 1 2 2 EASY
    CFG( Construction, examples,
    Derivartion of strings, Languages) 4 1 2 EASY
    Turing Machines(Construction,
    Examples, Acceptance) 2 1 MEDIUM
    Recursive and Recursive Enumerable
    Languages (Closure Properties,
    Decision properties) 1 2 1 2 1 HARDER
    Decidability and Undecidabilty 3 2 2 2 2 2 1 2 2 1 HARDER
    Complexity Clasess 1 2 2 1 2 1 HARDER

    TOTAL 8 11 9 8 8 9 9 9 9 6 7 5 8 5 7 5 5

    You might also like