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 Current Mid Term Papers Spring 2014 & Past Mid Term Papers at One Place Date: June 07 to June 18, 2014

All Current Mid Term Papers Spring 2014 and Past Mid Term Papers at One Place From June 07 to June 18, 2014.

Share Your Mid Term Papers Here in Reply of this Discussion

May Allah Solve Our Problems and Give Us Success

You Can Download Solved Mid Term Papers, Short Notes, Lecture Wise Questions Answers Files, Solved MCQs, Solved Quizzes , Solved Mid Term Subjective Papers , Solved Mid Term Objective Papers From This Discussion For Preparation Mid Term Paper of Spring 2014

For Important Helping Material related to this subject (Solved MCQs, Short Notes, Solved past Papers, E-Books, FAQ,Short Questions Answers & more). You must view all the featured Discussion in this subject group.

For how you can view all the Featured discussions click on the Back to Subject Name Discussions link below the title of this Discussion & then under featured Discussion corner click on the view all link.

Or visit this link 

Click Here For Detail.

Thanks and Regards,

VU Students.ning Social Network.

+ 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: 2250

.

+ 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

All Mcqs from past papers.

Q. Point of Kleen Theory only two. Marks 2
Answer:
1. If a language can be accepted by an FA then it can be accepted by a TG as well.
2. If a language can be accepted by a TG then it can be expressed by an RE as well.
3. If a language can be expressed by a RE then it can be accepted by an FA as well.

2. The language can express in FA then why we need NFA. Justify your answer. (2)
Answer:
NFAs are interesting because we can express languages easier than FAs.
DFA can be understood as one machine. NFA can be understood as multiple little machines computing at t
same time.

3Draw a transition table fo the followinf diagram? 3

4.Draw transition table for concatenation of FA?3

5.Draw transition table for the following diagram at least 5 readings. 5

  Ans page number 37

6.Draw Mealy machine for the following Moore machine? 5

Diagram of page 61 Moore machine

Ans.Diagram of page 62 Mealy machine

please jis file say tamam ncqs aye hai koi wo to attach kar do, mera next paper isi subject ka ha but mjhe bht mushkil lagtaha ya subject :-( koi past paper attach karo jis ma say tamam mcqs ay hain :-( :-(

my today paper too much easy

all mcqz from past paper 2 n 3 were new

subjective 

mealy machine ka transition table bunana tha 5

draw FA coresponding to follwing NFA? Ans pg. 43 (5)

draw a transition table for conatenation of FA?

 Farheen batool  &  mehak siddiqui  Thanks for sharing ur paper to help other.best of luck for ur result 

Attention Students: You don’t need to go any other site for current papers pattern & questions. Because all sharing data related to current Mid term papers of our members are going from here to other sites. You can judge this at other sites yourself. So don’t waste your precious time with different links. Just keep visiting http://vustudents.ning.com/ for all latest updates.

Asslam-O-Alaikum

Friends

90% MCQ'S from past paper.

Q# Lec#22 Application of incrementing.( ka function btana tha) [2 marks]

Q# Recursive definition. [2 marks ]

Q#If there is no initial state in FA then that FA does not accept any language Discuss two situations when an FA does not accept any string not even the null string? [5 marks]

Ans in lecture #6 (page 15,16 )

Q#Give the transition table (FA yaad nai kaise tha) [3 marks]

Q# Consider a part of the following TG To eliminate state 3 the above TG can be reduced to. lecture #11  (page #28) 2nd example (r1,r2....r9) [ 5 marks]

Q # Consider the following Moore machine... (output btane the) lecture # 22

(page # 61) ki 1st example.[3 marks]

Best of luck 

Emaan Fatima thanks for sharing ur paper..best of luck for ur result 

Thank u sir Tariq Malik

CS402 All Featured Discussions link For Solved Past Mid Term Papers, Solved MCQs, Short Notes & more material for Current mid term papers Spring 2014 exam Preparation links 

http://vustudents.ning.com/group/cs402theoryofautomata/forum/topic/...

thanks to all for this useful giude

My todays Paper Was Very easy ... All MCQs were from Past papers of Moaaz file And Subjective are As follows
BC120201113 CS402 My Todays Paper 9-6-2014
1) Why there is no concept of Final state In the Moor Machine?
Answer:- Pg55 Lecture 20

2) True or False??
“An NFA is a TG with unique start and a property of having single letter as label of transition”.
Answer:- lecture 40 pg15
3) Consider coplimenting mealy machin and find ∑, L and if we run 0011010 in the machine then what will be out put??
Answer:- lecture 21 page 58

4) Find the NFA of the language consisting of 10 and defined on ∑= {0,1}
5) An NFA was given, was to convert in FA.
Answer:- Lecture 16
6) Find the Transition table of the Given FAs.
Answer:- Example on the pg36 Lecture 13

Attachments:

BC120201113    CS402 My Todays Paper  9-6-2014

1)      Why there is no concept of Final state In the Moor Machine?

Answer:- Pg55 Lecture 20

 

2)      True or False??

“An NFA is a TG with unique start and a property of having single letter as label of transition”.

Answer:- lecture 40 pg15

3)      Consider           find ∑ and  and if we run 0011010 in the machine then what will be out put??

Answer:- lecture 21 page 58

 

4)      Find the NFA of the language consisting of 10 and defined on ∑= {0,1}

5)      An NFA was given, was to convert in FA.

Answer:- Lecture 16

6)      Find the Transition table of the Given FAs.

Answer:- Example on the pg36 Lecture 13

          

 

 

 

 

RSS

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

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

.