Virtual University Forum

by Ehtisham Arshad on December 20, 2013 at 9:58am My today paper at 08:30 am 1. what is the difference between (a,b) and (a+b)?      2 marks  2. write any of two statments of kleen's theorem?         2 marks 3. given diagram of NFA was to convert in FA diagram      3 marks 5. given two regular expressions r1 =(a+b)((a+b)(ab))* and r2=(a+b)*b was to draw corresponding FA's and after to draw table and diagram of r1+r2 by UNION?       5 marks 6. there was an NFA and was to convert to FA by transition table?( method III)    5 marks   aik aur bhi 3 marks ka tha but wo yad nahi. best of luck

by Muhammad kashif on December 20, 2013 at 11:36am My today paper at 8:30am 95 % MCQs from past papers 1. What is the regular expression of given FA(Even lenght wala FA dia gaya tha) 2marks 2. 3. Make the transition table of the closure of the FA(FA was gien) 3 marks 4. Write the RE of the given languages.3 Marks i. one was accept all strings exept null stings ii.01110 occur any place in strings 5.Mke the Maze that has 20 boxes 5 non moveable reming movable also make the NFA Its  2.5+2.5 marks 6. Mealy machine was given one ouput string was given make the table according to it output 5 marks best of luck

Today Paper Total Questions = 26 Total Marks = 40 Total MCQs of 1 Mark = 20 Short Subjective Question of 2 Marks = 2 Subjective Question of 3 Marks = 2 Subjective Questions of 5 Marks = 2 What is meant by ‘Transition’ in Finite automaton?..........2 Aik string given thi usko tokenize krna tha………2 Differentiate between distinguishable and indistinguishable string……….3 Let L be the language of string, defined over alphabet = {0,1} ending in 10. Draw diagram…….3 Construct NFA from the given FAs. Two FA were given………5 Two statement were given about Moore and mealy machine Justify both statements. Statement …..5

cs402  today paper 20-12-2013 Q 1:consider alphabet is (0,1) you head to write a regular expession of the language having string that contains either 111 or 11 and have no more 1's. Q 2:  write at least one similarty and one difference  between DFA &NFA. Q 4: Write the RE of the given languages.  aur ak question tha k FA1 and FA2 ko NFA ma convert kry aur ak FA ki transition table bnana tha (theorem part 111) Best of luck

mujhe yeh kuch questions yad hain jo exam mein aye thy. Q:consider alphabet is (0,1) you head to write a regular expession of the language having string that contains either 111 or 11 and have no more 1's. 2 FAs thy aur concatenation kar k NFA banana thaa. Q: given language {a,b,ab}  FA and NFA banana thaa. MCQs easy thy. waise NFA ko bari ahmiyat haasil hai.

by +•´¯`• MOMAL •´¯`•+ on December 21, 2013 at 2:16pm MY PAPER of CS402  ·          define string and word ? ·          3 question about convert the given NFA in to FA. ·          FA1 intersectionFA2 ·          making FA with tranisition table .