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-
- Assume suitable data, if necessary.
- Attempt all the questions.
--- Content provided by FirstRanker.com ---
Q.1 Select the correct option. 6+1=6 Marks
- L denotes the language over {a}, finite language of symbols.
- string
- characters
- integers
- DFA
--- Content provided by FirstRanker.com ---
- Transition diagrams are represented by
- ellipses
- circles
- triangles
- rectangles
--- Content provided by FirstRanker.com ---
- Grammar that produce more than one parse tree for same sentence is:
- Ambigious
- Unambiguous
- Complementation
- Concatentation Intersection
--- Content provided by FirstRanker.com ---
- Regular grammars also known as
- Type 0
- Type 1
- Type 2
- Type 3
--- Content provided by FirstRanker.com ---
- Lets read r are regular expressions denoting the languages R and S. Then r(r+s)* denotes.
- S +RS
- R+
- RUS
- R*
--- Content provided by FirstRanker.com ---
- S→aAS is which grammar?
- Right linear Grammar
- Left linear Grammar
- Linear Grammar
- None of the above
--- Content provided by FirstRanker.com ---
Q.2 Solve Any Two of the following: 2*6=12 Marks
- Construct the DFA for L = {a, ab}.
- w: strings starting and ending with different characters
- w: string with "ab" as substring
- Show that following grammar is ambiguous for the input "a+a*a"
S→SS | aS | Sa | a
- Construct the regular Grammar for the given finite automata.
--- Content provided by FirstRanker.com ---
Q.3 Any One of the following: 1*8 = 8 Marks
- What are the requirements of verification methods of Context Free Grammar? With suitable example, explain them individually.
-
- Construct the moore machine corresponding to the mealy machine.
- Convert following moore machine to mealy machine.
--- Content provided by FirstRanker.com ---
*** End ***
--- 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 ---