Scribd
Upload
3 views

s-2024

The document outlines the supplementary examination details for the Theory of Computation course at Dr. Babasaheb Ambedkar Technological University for the Summer 2024 semester. It includes instructions for students, a breakdown of questions across various topics such as finite automata, context-free grammar, and Turing machines, with each question categorized by its expected level of understanding. The exam consists of multiple questions where students must solve any two from each section, totaling a maximum of 60 marks.

Uploaded by

pratusathe16
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
3 views

s-2024

The document outlines the supplementary examination details for the Theory of Computation course at Dr. Babasaheb Ambedkar Technological University for the Summer 2024 semester. It includes instructions for students, a breakdown of questions across various topics such as finite automata, context-free grammar, and Turing machines, with each question categorized by its expected level of understanding. The exam consists of multiple questions where students must solve any two from each section, totaling a maximum of 60 marks.

Uploaded by

pratusathe16
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

DR.

BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY, LONERE


Supplementary Examination Summer 2024
Course: B. Tech. Semester :V
Branch : Computer Engineering/ Computer Science And Engineering
Subject Code & Name: Theory of Computation (BTCOC502)
Max Marks: 60 Date: 03/07/2024 Duration: 3 Hrs.
Instructions to the Students:
1. All the questions are compulsory.
2. The level of question/expected answer as per OBE or the Course Outcome (CO) on
which the question is based is mentioned in ( ) in front of the question.
3. Use of non-programmable scientific calculators is allowed.
4. Assume suitable data wherever necessary and mention it clearly.
(Level/CO) Marks
Q. 1 Solve Any Two of the following.
A) Design Non deterministic Finite Automaton to accept all strings over Design 6
alphabet {a, b} ending with abab.
B) Distinguish between Moore machine and Mealy machine. Analyze 6
C) Construct Deterministic Finite Automaton for regular expression Design 6
(a+b)*aba

Q.2 Solve Any Two of the following.


A) State some applications of regular expressions. Remember 6
B) Distinguish between regular language and context free language. Understand 6
C) Design context free grammar for following language (ab)n where n>=1 Design 6

and anbn where n>=0.

Q. 3 Solve Any Two of the following.


A) State some applications of Context Free Grammar. Understand 6
B) Explain the following. Remember 6
(i) Type 0 grammar
(ii) Type 1 grammar
(iii) Type 2 grammar
(iv) Type 3 grammar
C) Find the reduced grammar equivalent to the following grammar where Apply 6
productions are :
S AC | SB
A bASC | a
B  aSB | bbc
C BC |ad

Q.4 Solve Any Two of the following.


A) What is Push Down Automaton (PDA)? Explain different components Remember 6
of PDA.
B) Design PDA to accept language L = (ab)* where na= nb. Design 6

C) Construct PDA for following grammar. Apply 6


S aAA
A aS | bS | a

Q. 5 Solve Any Two of the following.


A) Explain how Turing machine is represented using transition diagram Understand 6
and transition table.
B) Explain concept infinite loop in Turing machine with the help of an Analyze 6
example.
C) Design Turing machine that recognizes the language L of all strings Design 6
over {a, b} with number of a’s equal to number of b’s.
*** End ***

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy