Scribd Logo
Upload

Welcome to Scribd!

  • 20 views

    SY - TOC Unit 5 Quiz (CIE)

    Uploaded by

    Chinmay Pohankar
    The document is a quiz about Turing machines consisting of multiple choice questions. It includes questions about the number of states in a Turing machine, applications of Turing machines, possibilities of a TM while processing input, properties of deterministic Turing machines, outputs of an enumerator for a specific language, capabilities of multi-tape vs single-tape Turing machines, and true/false statements about Turing machine designs. The quiz is part of a class and collects the student's name, division, roll number, and graduate roll number when submitting answers.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    SY - TOC Unit 5 Quiz (CIE)

    Uploaded by

    Chinmay Pohankar
    20 views5 pages
    The document is a quiz about Turing machines consisting of multiple choice questions. It includes questions about the number of states in a Turing machine, applications of Turing machines, possibilities of a TM while processing input, properties of deterministic Turing machines, outputs of an enumerator for a specific language, capabilities of multi-tape vs single-tape Turing machines, and true/false statements about Turing machine designs. The quiz is part of a class and collects the student's name, division, roll number, and graduate roll number when submitting answers.

    Original Title

    SY - TOC Unit 5 Quiz(CIE)

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document is a quiz about Turing machines consisting of multiple choice questions. It includes questions about the number of states in a Turing machine, applications of Turing machines, possibilities of a TM while processing input, properties of deterministic Turing machines, outputs of an enumerator for a specific language, capabilities of multi-tape vs single-tape Turing machines, and true/false statements about Turing machine designs. The quiz is part of a class and collects the student's name, division, roll number, and graduate roll number when submitting answers.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    20 views5 pages

    SY - TOC Unit 5 Quiz (CIE)

    Uploaded by

    Chinmay Pohankar
    The document is a quiz about Turing machines consisting of multiple choice questions. It includes questions about the number of states in a Turing machine, applications of Turing machines, possibilities of a TM while processing input, properties of deterministic Turing machines, outputs of an enumerator for a specific language, capabilities of multi-tape vs single-tape Turing machines, and true/false statements about Turing machine designs. The quiz is part of a class and collects the student's name, division, roll number, and graduate roll number when submitting answers.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 5

    4/23/22, 5:38 PM SY - TOC Unit 5 Quiz(CIE)

    SY - TOC Unit 5 Quiz(CIE)


    [email protected] Switch account

    Draft saved

    Your email will be recorded when you submit this form

    * Required

    Q. 8. Mention the total number of staes in the design of TM for language L 1 point

    over {a, b} L= a*b a*b

    Clear selection

    Enter Your SY Div *

    Enter your Complete Name *

    Chinmay Pohankar

    https://docs.google.com/forms/d/e/1FAIpQLScAzch4wUVoK-zxUoUhERn2e-PVG92FAHafym617v4UmtqJjg/viewform 1/5
    4/23/22, 5:38 PM SY - TOC Unit 5 Quiz(CIE)

    Which of the following is/are not an application of turing machine? 1 point

    Language Recognization

    Generating devices

    Transducers

    None of above

    Clear selection

    Which of the following cannot be a possibility of a TM while it processes an 1 point

    input?

    Enters accepting state

    Enters non-accepting state

    Enters infinite loop and never halts

    None of the mentioned

    Clear selection

    Which of the following does not exists? 1 point

    Mutitape TM

    Multihead TM

    Multitrack TM

    None of mentioned

    Clear selection

    https://docs.google.com/forms/d/e/1FAIpQLScAzch4wUVoK-zxUoUhERn2e-PVG92FAHafym617v4UmtqJjg/viewform 2/5
    4/23/22, 5:38 PM SY - TOC Unit 5 Quiz(CIE)

    A deterministic turing machine is: 1 point

    ambiguous turing machine

    unambiguous turing machine

    non-deterministic

    none of above

    Clear selection

    For the following language, an enumerator will print: L={a^nb^n|n>=0} 1 point

    a^nb^n

    {ab, a^2b^2, a^3b^3, …}

    {e, ab, a^2b^2, a^3b^3, …}

    All of above

    Clear selection

    Enter your Complete roll number(not last two digits) *

    223044

    A multitape turing machine is ________ powerful than a single tape turing 1 point

    machine.

    More

    Less

    Equaly

    Clear selection

    https://docs.google.com/forms/d/e/1FAIpQLScAzch4wUVoK-zxUoUhERn2e-PVG92FAHafym617v4UmtqJjg/viewform 3/5
    4/23/22, 5:38 PM SY - TOC Unit 5 Quiz(CIE)

    A turing machine with several tapes in known as: 1 point

    Multi-tape turing machine

    Multi-track turing machine

    Poly tape turing machine

    All of above

    Clear selection

    Enter your Complete GR Number(not last two digits) *

    22010456

    X is a simple mathematical model of a computer. X has unrestricted and 1 point

    unlimited memory. X is a FA with R/W head. X can have an infinite tape


    divided into cells, each cell holding one symbol.Name X?

    Push Down Automata

    Non deterministic Finite Automata

    Turing machines

    All of above

    Clear selection

    https://docs.google.com/forms/d/e/1FAIpQLScAzch4wUVoK-zxUoUhERn2e-PVG92FAHafym617v4UmtqJjg/viewform 4/5
    4/23/22, 5:38 PM SY - TOC Unit 5 Quiz(CIE)

    Which of the following statements is/are false? 1 point

    Turing machine can be design for a 2's complement of a given number

    Turing machine can be design for for subtraction of two numbers.

    Turing machine can be design for even palindrome of two numbers.

    Turing machine cannot be design for multiplication of two numbers.

    Clear selection

    Page 1 of 1

    Submit Clear form

    Never submit passwords through Google Forms.

    This form was created inside of Vishwakarma Institute of Information Technology. Report Abuse

     Forms

    https://docs.google.com/forms/d/e/1FAIpQLScAzch4wUVoK-zxUoUhERn2e-PVG92FAHafym617v4UmtqJjg/viewform 5/5

    You might also like