Scribd
Upload
21 views4 pages

CSE1008

This document contains a question paper for the Fall 2023-24 Semester examination for the course CSE1008: Theory of Computation at S52 University. It includes various questions related to designing DFAs and NFAs, constructing regular expressions, and analyzing languages using the pumping lemma. The exam has a total duration of 90 minutes and is worth 50 marks.

Uploaded by

anushkapanditlearn
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
21 views4 pages

CSE1008

This document contains a question paper for the Fall 2023-24 Semester examination for the course CSE1008: Theory of Computation at S52 University. It includes various questions related to designing DFAs and NFAs, constructing regular expressions, and analyzing languages using the pumping lemma. The exam has a total duration of 90 minutes and is worth 50 marks.

Uploaded by

anushkapanditlearn
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 4
@ VIT-AP S52 UNIVERSITY Apply Knowledge. Improve Life!” QUESTION PAPER Name of the Examination: Fall 2023-24 Semester — CAT-1 Course Code: CSE1008 Course Title: Theory of computation Set number: Set-1 Date of Exam: 12/0/2093 (N) Cu) Duration: 90 mins ‘Total Marks: 50 Instructions: 1. Assume data wherever necessary. 2. Any assumptions made should be clearly stated. QI. To design a DFA to accept odd number of a’s and even number of b’s. Check whether the following strings are accepted or not. (10) i, ababa ii ababaa Q2. Consider the NFA given below. check whether the strings 001, 011101,01110,010 are accepted by the machine or not, (10) eae) 3. Reduce the DFA given below transition diagram. (10) a 2) on : @p- © Page 1 of 2 4, Construct RE for the DFA in the below transition diagram using Arden’s theorem. (10) QS. Construct a DFA for the Regular expression 8) RE-(a)" (ba)"b' over Y= {a,b} except (5) b) RE= «+ aaatbbbb over 5 = {a, b}; accept only words €, aaa, bbbb. (5) QP MAPPING Module ane | Kime |SOM*PPEE | sapped a x cor POI, POS 10 az col ___ POI, POS 10 a3 1 cor PO, POS 10 aa 2 COZ POI, PO2, POS 10 05 2 COR POI, PO2, POS 10 Page 2 of 2 UNIVERSITY Apply Knowledge. Improve Life!” QUESTION PAPER Name of the Examination: Fall 2023-24 Semester ~ CAT-1 Course Code: CSE1008 Course Tite: Theory of computation Set number: Set-3 Date of ram: 13/07)2023 (An) ©) Duration: 90 mins Total Marks: 50 Instructions: 4. Assume data wherever necessary. 2. Any assumptions made should be clearly stated. Q1. To design a DFA that contains strings of zero’s and one’s with equal number of zero’s and ones, No prefix of strings should contain two more zero’s than ones or two more ones than zero’s and to verify the following string is accepted or not. (10) i 011001 i.0100 Q2. Design an NFA to accept set of all strings starting with ‘a’ followed by ‘a’ or °b’ or ending with a or any number of b’s, To show that the string abbbb is accepted or not. (10) Q3. Optimize the DFA in the following transition diagram (10) Page 1 of 2 4, Construct a RE for the DFA for the following transition diagram using Arden's theorem. 10) ab VB f ab stat QS. Show that the language L= {a' : iprime} is not regular using pumping lemma, (10) ‘QP MAPPING ano, | Mode | co Mapped meee Marks Gi z cor P01, PO3 70 @ z Cot POI, POS 10 a Z cor POT, PO3 70 ae] 2 co POI, PO2, PO 10 as 2 cor POI, PO2, POS 70 Page 2 of 2

You might also like