Scribd Logo
Upload

Welcome to Scribd!

  • Sessional Exam Questions Paper

    Uploaded by

    Revanth
    7 views5 pages

    Original Title

    sessional exam questions paper (1)

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document

    Copyright:

    © All Rights Reserved
    Download as PDF or read online from Scribd
    Flag for inappropriate content
    7 views5 pages

    Sessional Exam Questions Paper

    Uploaded by

    Revanth

    Copyright:

    © All Rights Reserved
    Download as PDF or read online from Scribd
    Flag for inappropriate content
    of 5
    BCE-C612 Fe Formal Languages and Automata Theory ‘Time : 1 Hour MM: 30 QI) Design CFG which accepts strings of type a’ b ; i=] Q2) Design a PDA which accepts strings made of a and b, which are palindrome. Q3) Define Turing Machine. ETO A Z es BOECOTE adautonate thoy ‘Time: 1 Hour 9%) Define the term 11b) Write regular expression for the language over the alphabet {0,1}. With no consecutive zeros. ‘anguages a inite Automata, Differentiate between NFA and DFA. [5] (5) ) Design a DFA (deterministic finite automaton) to accept the language (8) ‘ L1=(a {a,b,c} Jastarts and ends with the same symbol } _8a) Define Context Free Grammar. (3) Rib) Consider the Following grammar find whether “aaabbbaa” is accepted or not. [7] $1 — aaS1 | abS! | baS1 | bbS1 |a|b { GURUKULA KANGRI (DU), HARIDWAR Sessional-1 B.Tech.-CSE/3" Year Distributed Systems (BCE-C-611) Date: 28.04.2022 Time: 10:30 am - 11:30 am Coordinator: Mr. Sumit Bansal Maximum Marks: 20 (Prited:64

    You might also like