Roll No. [ ] [ ] ] [ 1] Total No. of Pages : 02
Total No. of Questions : 09
--- Content provided by FirstRanker.com ---
B.Tech (Information Technology) (Sem.-7)
THEORY OF COMPUTATION
Subject Code : BTIT-904
M.Code : 71983
Time : 3 Hrs. Max. Marks : 60
--- Content provided by FirstRanker.com ---
INSTRUCTIONS TO CANDIDATES :
- SECTION-A is COMPULSORY consisting of TEN questions carrying TWO marks each.
- SECTION-B contains FIVE questions carrying FIVE marks each and students have to attempt any FOUR questions.
- SECTION-C contains THREE questions carrying TEN marks each and students have to attempt any TWO questions.
SECTION-A
--- Content provided by FirstRanker.com ---
- Write briefly :
- Moore Machine
- DFA
- TM
- Grammar
- Yield
- Instantaneous Description
- Right context
- UNIT Production
- Parse tree
- CNF and GNF
--- Content provided by FirstRanker.com ---
--- Content provided by FirstRanker.com ---
SECTION-B
- Construct a finite automata equivalent to the regular expression : (0+1)*(00+11)(0+1)*
- Explain the concept of ambiguity with the help of example.
- Construct a Moore machine equivalent to the Mealy machine M defined by following table :
--- Content provided by FirstRanker.com ---
Present State Next State a=0 a=1 State Output State Output q1 q1 0 q2 1 q2 q2 0 q3 0 q3 q2 0 q3 1 q4 q3 1 q1 1 - State and Describe pumping lemma
- Find a reduced grammar equivalent to the given grammar S—AC|B, A—a C—c|BC E—aA|e
SECTION-C
--- Content provided by FirstRanker.com ---
- Design PDA for {wwR | w={a,b}*}
- Give rules of converting CFG into PDA.
- Describe any two representation of TM.
NOTE : Disclosure of Identity by writing Mobile No. or Making of passing request on any page of Answer Sheet will lead to UMC against the Student.
--- Content provided by FirstRanker.com ---
This download link is referred from the post: PTU B.Tech Question Papers 2020 March (All Branches)
--- Content provided by FirstRanker.com ---