MIDTERM EXAMINATIONView more random threads:
- MCM301 Communication skills Spring 2009 Final Term Paper
- cs101 midterm papers fall 2010 download
- CS201 Introduction to Programming Spring 2009 Final Paper
- CS501 Advance Computer Architecture midterm paper fall 2010
- MTH101 Calculus And Analytical Geometry MidTerm Papers...
- MGT401 FINANCIAL ACCOUNTING II MIDTERM solve papers FALL...
- HRM624 Conflict Management Spring 2009 Final Term Paper
- CS402- Theory of Automata latest mid term paper 2011...
- CS101 Final term paper 2011 Subjective solved New
- MKT501- Marketing Management Spring 2009 Final Term Paper
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)