CS402- Theory of Automata latest mid term paper 2011 virtual university of pakistan

[Vuhelper]

View more random threads:

• CS402 Theory of Automata Spring 2009 Final Term Paper
• mgt411 midterm paper fall 2010
• MTH302- Business Mathematics & Statistics Spring 2009 Final...
• CS403 midterm papers fall 2010 December 4
• MGMT630 Knowledge Management midterm paper
• CS615 SOFTWARE PROJECT MANAGEMENT mid term paper 2011
• cs408 midterm paper and mcq's
• CS408 Human Computer Interaction Spring 2009 Final Term...
• PHY101 Physics Spring 2009 Final Term Paper
• cs301 final term current paper July 2011

MIDTERM EXAMINATION
CS402- Theory of Automata (Session - 2)
Question No: 1 ( Marks: 1 ) - Please choose one
If an alphabet has n number of letter, then number of strings of length m will be
n+m
(n)(m)
mn
nm
Question No: 2 ( Marks: 1 ) - Please choose one
Languages generated by kleene star are always ______________.
Finite
Infinite
Sometimes finite & sometimes infinite
None of the these
Question No: 3 ( Marks: 1 ) - Please choose one
1*(1 + ) = 1* this statement is
True
False
Sometimes true & sometimes false
None of these
Question No: 4 ( Marks: 1 ) - Please choose one
a*b* = (ab)* this expression is __________

Sponsored Links