CS402 - Theory of Automata finalterm paper

by Asad Thu Feb 24, 2011 3:06 pm

Assalamoalaikum.........
today's automata paper was really confusing........false n true statement bohat hi chicher qisam ki theen.....
moor n mealy machine say thay mcq.....TM say related thay.......mid say related stuff say bhi kafi aaya tha.......
40 mcq thay
2marks k i think 3 n
3 k bhi 3 and
5 k bhi 3 thay.......

even n odd palendrome k CFG thay ....even language ka CFG without multiple of 3 aaya tha.....5 marks

pop n push .......both n separately ...2 and 3 marks..
differentiate Live Production, Dead Production 5 marks .....
ak important q meray pass tha last papers ka yeah bhi aaya tha......

If L1,L2 and L3 be any three finite languages over Sigma = {a,b}, then how will be

(L1 INTERSECTION L2) Union (L2 INTERSECTION L3) ≠ Ø
[You must be registered and logged in to see this image.]

by Asad Thu Feb 24, 2011 3:07 pm

Assalamoalaikum.........
today's automata paper was really confusing........
moor n mealy machine say thay mcq.....TM say related thay.......mid say related stuff say bhi kafi aaya tha.......
40 mcq thay
2marks k i think 3 n
3 k bhi 3 and
5 k bhi 3 thay.......

even n odd palendrome k CFG thay ....even language ka CFG without multiple of 3 aaya tha.....5 marks

pop n push .......both n separately ...2 and 3 marks..
differentiate Live Production, Dead Production 5 marks .....
ak important q meray pass tha last papers ka yeah bhi aaya tha......

If L1,L2 and L3 be any three finite languages over Sigma = {a,b}, then how will be

(L1 INTERSECTION L2) Union (L2 INTERSECTION L3) ≠ Ø

[You must be registered and logged in to see this image.]

by Asad Thu Feb 24, 2011 3:07 pm

52 total Q the,120 mnts,40 mcq's ,4Q k 2 marks,or 4Q k 3marks or 4Q k 5marks.total marks 80.RE k 1 2 mcqs the
polish notation thi(o-o-o)
CNF ki definition,PDA in conversion form ki charactrestics thi
ambiguous grammer,
meally more me se 3 4 mcqs the,prefix ka 1 Q tha,
itna e yad...

by Asad Thu Feb 24, 2011 3:09 pm

Total Question 45

40(1) + 3(2 marks) + 3(3 marks) + 3(5 marks)

1. Difference between semi-word and word with example?
2. If there are more than one edges between two states then we can replace them by one edge in a TG. Explain it with examples?
3. How can you say that two FAs are equivalent?

Note: There were three questions related to equivalent of FAs and/ or Languages?

4. A graph was given and infix and prefix calculation of that graph was required like

Note: Here only 5 was replaced by 7.

What is a production?
This example was same in the Paper. Is it ambiguous? How can we eliminate Ambiguity?

[You must be registered and logged in to see this image.]

by Asad Thu Feb 24, 2011 3:09 pm

 Consider the following FA bellow
5marks
What is the language accepted by above FA.
Note: for figure see ur handouts of any FA.
 Describe language of following PDA write two or three lines 5 marks
 Differentiate between dead production and live production. 5 marks
 What do u understand by the phrase rule for developing language define over
certain alphabets explain with example.
5 marks
 Give regular expression R E let E= {0,1}
3 marks
Begging with 0 and ending with 1.
 What the mean by prefixes of language in another language,
3 marks
 What do you say about transition Graphs
3 marks
 What are the joints of PDA
2 marks
[You must be registered and logged in to see this image.]
 What mean by the following statement 2 marks
Language is closed.
 What meant by left most derivation in CFG 2 marks
 What is transition? 2 marks

by Sponsored content

CS402 - Theory of Automata finalterm paper

CS402 - Theory of Automata finalterm paper

Re: CS402 - Theory of Automata finalterm paper

Re: CS402 - Theory of Automata finalterm paper

Re: CS402 - Theory of Automata finalterm paper

Re: CS402 - Theory of Automata finalterm paper

Re: CS402 - Theory of Automata finalterm paper