MIDTERM EXAMINATIONView more random threads:
- MTH101 Calculus And Analytical Geometry Spring 2009 Final...
- MTH301 Calculus II Fall 2009 Final term Paper
- CS101- Introduction to Computing final term New paper July...
- MGT602 Entrepreneurship Spring 2009 Final Term paper
- CS501 Advance Computer Architecture Spring 2009 Final Term...
- Eco401 Ecnomics all solved papers 2007 to fall 2010 Download
- MGT603 Strategic Management Spring 2009 Final Term Paper
- MGT502 Organizational Behaviour MIDTERM EXAMINATION ...
- CS402- Theory of Automata latest mid term paper 2011...
- Mth202 midterm papers all download december fall 2010
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)