.... How to Find Your Subject Study Group & Join ....   .... Find Your Subject Study Group & Join ....  

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

Study Groups By Subject code Wise (Click Below on your university link & Join Your Subject Group)

[ + VU Study Groups Subject Code Wise ]  [ + COMSATS Virtual Campus Study Groups Subject Code Wise ]

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

CS402 Mid Term Papers Fall 2017 December 9, 2017 to December 20, 2017 & Past Papers

CS402 Mid Term Papers Fall 2017 December 9, 2017 to December 20, 2017 & Past Papers

Share This With Friends......


How to Find Your Subject Study Group & Join.

Find Your Subject Study Group & Join.

+ Click Here To Join also Our facebook study Group.


This Content Originally Published by a member of VU Students.

+ Prohibited Content On Site + Report a violation + Report an Issue

+ Safety Guidelines for New + Site FAQ & Rules + Safety Matters

+ Important for All Members Take a Look + Online Safety


Views: 1316

See Your Saved Posts Timeline

Replies to This Discussion

past papermain sy ktni percentge tk ajta ha 

mujy meri mai per msg ker ky bta dyna rabiamustafa250@gmail.com

or meri iys mail per cs402 midterm ky tmam pper send krna plzzz mery pc main dowlodin problem arhi ha

Cs 402 9 Dec time 9:30

MCQ ,s are mostly in Past Papers and conceptual.
Subjective: 1)Palindrome with recursion .2) Draw FA with R.E 3) Draw NFA state. 4)Diagram di hoe thi un ko covert karna tha.

Mcqs from Moazz file

2 Question NFA bnane wale tha 

2 Question Descriptive language k tha 

Transition graph bnana tha 

waqr sidhu ky solve file ha kisy k pas to plz share

Sir, Please help me for the solution of the given questions with the reasons plzzzzzzzz

When ODD language expressed by an FA, then it will have maximum ------- States,

  1. One B)    Two     C)      Three      4)      Four

 

A Moore Machine is a collection of ---------- things.

  1. Two B)    Three     C)      Four      4)      Five

If an FA has N states then it must accept the word of length--------

  1. N+1    B)     N-1      C)     N    D)       2N

Consider FA1 and FA2 are two finite automata representing two different languages. FA3 (sum of FA1 and FA2) will accept all strings accepted by -------------

  1. FA1 and FA2      B)     FA1 or FA2      C)      FA1 but not FA2       D)       FA2 but not FA1

A CFG corresponding to regular expression a* denoted over sigma={a,b} has atleast ----------- productions

  1. 3 B)    4     C)      1      4)      2

------------ is/are required to convert the given transition graph into a regular expression

                                          a                                                   a,b

          

                                                 b

 

  1. 1 Step B)    2 Step     C)      3 Step      4)      4 Step

Can a turning machine’s head ever be in the same location in two successive steps?

  1. Yes B)    Yes but only in the finite languages     C)      No     4)      )    Yes but only in the infinite languages    

RSS

Forum Categorizes

Job's & Careers (Latest Jobs)

Admissions (Latest Admissons)

Scholarship (Latest Scholarships)

Internship (Latest Internships)

VU Study

Other Universities/Colleges/Schools Help

    ::::::::::: More Categorizes :::::::::::

Member of The Month

1. Angry Bird

Lahore, Pakistan

© 2018   Created by +~Malik~.   Powered by

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