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),View more random threads:
- cs402 solved mcq's from 23 lecture to 45 lectures fall 2010...
- Eng201 latest solved mcq's and subjective paper fall 2010...
- FINALTERM Spring 2011 CS001 VU-Computer Proficiency...
- ENG201 Business and Technical English Writing Midterm...
- MIDTERM EXAMINATION MGT411- Money and Banking
- DLD (CS302)SOLVED PAPERS fall 2010
- CS304 final term current paper spring Jily 2011
- ECO402 final term solve paper January 2012 Virtual...
- STA630 Mid Term Current Paper fall 2010 solved
- CS403 Mid Paper 28 May 2010 Spring 2010 CS403- Database...
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...
Total Question 45
40(1) + 3(2 marks) + 3(3 marks) + 3(5 marks)
Difference between semi-word and word with example?
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?
How can you say that two FAs are equivalent?
Note: There were three questions related to equivalent of FAs and/ or Languages?
A graph was given and infix and prefix calculation of that graph was required like
Note: Here only 5 was replaced by 7.
Sponsored Links
What is a production?
This example was same in the Paper. Is it ambiguous? How can we eliminate Ambiguity?
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) ≠ Ø
There are currently 1 users browsing this thread. (0 members and 1 guests)