We are here with you hands in hands to facilitate your learning & don't appreciate the idea of copying or replicating solutions. Read More>>

Looking For Something at vustudents.ning.com? Click Here to Search

www.bit.ly/vucodes

+ Link For Assignments, GDBs & Online Quizzes Solution

www.bit.ly/papersvu

+ Link For Past Papers, Solved MCQs, Short Notes & More


Dear Students! Share your Assignments / GDBs / Quizzes files as you receive in your LMS, So it can be discussed/solved timely. Add Discussion

How to Add New Discussion in Study Group ? Step By Step Guide Click Here.

CS402 Spring 2010 Final Term Papers

 

Please Share here

 

See the below attached files psl

 

 

Spring 2010_FinalTerm_OPKST_CS402_mc090407150_15-08-2010.doc

 

 

_________________________________________________

+ How to Follow the New Added Discussions at Your Mail Address?

+ How to Join Subject Study Groups & Get Helping Material?

+ How to become Top Reputation, Angels, Intellectual, Featured Members & Moderators?

+ VU Students Reserves The Right to Delete Your Profile, If?


See Your Saved Posts Timeline

Views: 1013

.

+ http://bit.ly/vucodes (Link for Assignments, GDBs & Online Quizzes Solution)

+ http://bit.ly/papersvu (Link for Past Papers, Solved MCQs, Short Notes & More)

+ Click Here to Search (Looking For something at vustudents.ning.com?)

+ Click Here To Join (Our facebook study Group)

Replies to This Discussion

CS402 Spring 2010 Final Paper 09-08-2010

Theory of Automata final paper
Question#(1) Fill it with suitable word
A Push down Automata consists of and input TAPE with ----------many location in one direction. (Marks 2)
Question#(2) Construct RE for the language having words of even length over ∑= {a.b} (2 Mark)
Question#(3) If two FAs have no final states then what will be the final state of their union? (2 mark)
Question#(4) Write true or false for the following statement
(a) Dead state is must in NFA
(b) There is a union path for each valid string (called a word) in NFA. (2 mark)
Question#(5) Write the three different parsing techniques? (3 mark)
Question#(6) Explain first two rules of defining all possible production of CFG of the “Row language” (5 mark)
Question#(7) Construct corresponding CFG for the given language
(1) All words of even length but not multiple of 3.
(2) Palindrome (both even and odd palindrome). (5 mark)
Question #8 ) Is the following CFG ambiguous? How can you remove the ambiguity?
S→aS│bS│aaS│
today 15-08-2010 CS402 Spring 2010 final Term Paper
See the attached file psl
Attachments:
i got the same paper today as the one Tariq bhai have uploaded on 9 august..that's strange..!
Paper held on 16 August 2010,
Attachments:
the answer are as follow:
infinite
Regular expression of even length ((a+b)(a+b})* [page no 11]
Q#4 ka a) part meray kheyal mein false hay agar koi confirm karsakta hay to zaroo tell us .
is question ka second part book mein mujhay nahein mela.
GOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOD
LUUUUUUUUUUUUCCCCCCCCCCCCCCCCCCCCCKKKKKKKKK
Attachments:
duaon main yaaad rakhna
Attachments:
yeh check karien
Attachments:
This file is not downloading..can u please mail me at bc070200136@vu.edu.pk
ASAP please...
thanku so much Kashif........ Allah bless u
Kashif bhi very very much thank.
Ali bhi file download nahein ho rahey . how we can download it ?

RSS

Today Top Members 

© 2019   Created by + M.Tariq Malik.   Powered by

Promote Us  |  Report an Issue  |  Privacy Policy  |  Terms of Service

.