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.
5. What is a production?
6. This example was same in the Paper. Is it ambiguous? How can we eliminate Ambiguity?
Showing posts with label CS402 Feb 2011. Show all posts
Showing posts with label CS402 Feb 2011. Show all posts
Saturday, February 12, 2011
Thursday, February 10, 2011
CS402 Current Paper
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) ≠ Ø
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) ≠ Ø
Subscribe to:
Posts (Atom)