munotes®

Engineering B.E. (Computer Engineering) Sem 5 Theoretical Computer Science Dec 2022 Question Paper - Mumbai University | munotes

Theoretical Computer Science Question Paper, Dec 2022.pdf
CMPN · 109 KB · 1 May 2025

Loading PDF...

Questions asked in this paper

  • (4) Figures to the right indicate full marks
  1. Q1 a) Differentiate between NFA and DFA. 5 marks
    • b) Compare and contrast Moore and Mealy machines. 5
    • c) Explain variants of Turing Machine. 5
    • d) Show that the following grammer is ambiguous : Convert the following RE into NFA with moves and hence obtain the DFA:
    • b) Consider the following Convert the grammer in Greibach Normal Form. 10
  2. Q3 a) Construct PDA accepting the language L = { 10 marks
    • b) Construct TM to check well formedness of parenthesis. 10 Design Mealy machine to recognize 1) * ) and then convert it to
    • b) Consider the following grammer : For the string “ ibtaeibta” , find the following :
    • iv) Check if the above grammer is ambiguous or not. 10 Design a Turing machine that computes a function f(m,n) = m +n , the addition of two
    • b) Give the formal definition of pumping lemma for regular language and then prove that the following language is not regular :
  3. Q6 Write short note on following ( Any two 20 marks
    • a) Chomsky Hierarchy
    • b) Decision properties of regular languages
    • c) Rice’s theorem
    • d) Definition and working of PDA

Read from the scan above, so a character or two may differ. The scan is the original.

Issue

Something wrong on this page? Report it and we will check it against the scan.

Quick Help

No. The full paper opens straight away, with no login and nothing to pay.

Something wrong with this paper? Report it.

Connected Papers
Engineering / B.E. (Computer Engineering) · 250 papers
Browse all →
Questions? Email contact@munotes.in
Done!
Done!