MIDTERM EXAMINATIONView more random threads:
- CS501 Advance Computer Architecture final term paper 2011...
- CS507 Information Systems mid term paper 2011
- HRM624 Conflict Management Spring 2009 Final Term Paper
- cs401 unsolved midterm paper download
- FIN623 Taxation Management Spring 2009 Final Term Paper
- MTH302 mid term paper spring 2011 virtual university of...
- ECO401 Economics Spring 2009 Final Term
- MGT401 Financial Accounting II Spring 2009 Final Term Paper
- FIN630 Investment Analysis & Portfolio Management Spring...
- CS001 VU Computer Proficiency License Spring 2009 Final...
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
There are currently 1 users browsing this thread. (0 members and 1 guests)