FirstRanker Logo

FirstRanker.com - FirstRanker's Choice is a hub of Question Papers & Study Materials for B-Tech, B.E, M-Tech, MCA, M.Sc, MBBS, BDS, MBA, B.Sc, Degree, B.Sc Nursing, B-Pharmacy, D-Pharmacy, MD, Medical, Dental, Engineering students. All services of FirstRanker.com are FREE

📱

Get the MBBS Question Bank Android App

Access previous years' papers, solved question papers, notes, and more on the go!

Install From Play Store

Download DBATU B.Tech 2019 Oct-Nov CSE 5th Sem Theory Of Computatio Question Paper

Download DBATU (Dr. Babasaheb Ambedkar Technological University) B Tech 2019 Oct-Nov (Bachelor of Technology) CSE 5th Sem Theory Of Computatio Question Paper

This post was last modified on 21 January 2020

This download link is referred from the post: DBATU B-Tech Last 10 Years 2010-2020 Previous Question Papers || Dr. Babasaheb Ambedkar Technological University


DR. BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY, LONERE

Mid Semester Examination – Oct 2019

Course: B. Tech in Computer Sci. & Engineering Sem: V

--- Content provided by FirstRanker.com ---

Subject Name: Theory of Computation Max Marks: 20

Subject Code: BTCOC502 Duration: 1 Hr.

Instructions to the Students: Date: -7/10/2019-

  1. Assume suitable data, if necessary.
  2. Attempt all the questions.
  3. --- Content provided by FirstRanker.com ---

Q.1 Select the correct option. 6+1=6 Marks

  1. L denotes the language over {a}, finite language of symbols.
    1. string
    2. characters
    3. integers
    4. DFA
    5. --- Content provided by FirstRanker.com ---

  2. Transition diagrams are represented by
    1. ellipses
    2. circles
    3. triangles
    4. rectangles
    5. --- Content provided by FirstRanker.com ---

  3. Grammar that produce more than one parse tree for same sentence is:
    1. Ambigious
    2. Unambiguous
    3. Complementation
    4. Concatentation Intersection
    5. --- Content provided by FirstRanker.com ---

  4. Regular grammars also known as
    1. Type 0
    2. Type 1
    3. Type 2
    4. Type 3
    5. --- Content provided by FirstRanker.com ---

  5. Lets read r are regular expressions denoting the languages R and S. Then r(r+s)* denotes.
    1. S +RS
    2. R+
    3. RUS
    4. R*
    5. --- Content provided by FirstRanker.com ---

  6. S→aAS is which grammar?
    1. Right linear Grammar
    2. Left linear Grammar
    3. Linear Grammar
    4. None of the above
    5. --- Content provided by FirstRanker.com ---

Q.2 Solve Any Two of the following: 2*6=12 Marks

  1. Construct the DFA for L = {a, ab}.
    1. w: strings starting and ending with different characters
    2. w: string with "ab" as substring
  2. --- Content provided by FirstRanker.com ---

  3. Show that following grammar is ambiguous for the input "a+a*a"

    S→SS | aS | Sa | a

  4. Construct the regular Grammar for the given finite automata.

Q.3 Any One of the following: 1*8 = 8 Marks

  1. What are the requirements of verification methods of Context Free Grammar? With suitable example, explain them individually.
  2. --- Content provided by FirstRanker.com ---

    1. Construct the moore machine corresponding to the mealy machine.
    2. Convert following moore machine to mealy machine.

*** End ***

FirstRanker.com

--- Content provided by FirstRanker.com ---



This download link is referred from the post: DBATU B-Tech Last 10 Years 2010-2020 Previous Question Papers || Dr. Babasaheb Ambedkar Technological University

--- Content provided by FirstRanker.com ---