MIDTERM EXAMINATIONView more random threads:
- CS501 Advance Computer Architecture final term paper 2011...
- All Unsolved Past Papers Final Term and Mid Term 2008 And...
- CS402- Theory of Automata latest mid term paper 2011...
- cs304 Object Oriented Programming download the midterm...
- MGT411 Money & Banking 2009 Final Term paper
- MGT602 Entrepreneurship Spring 2009 Final Term paper
- PAK301 Pakistan Studies old midterm papre
- ACC311 Fundamentals of Auditing Spring 2009 Final Term Paper
- FIN623 Finalterm 2009
- mth202 midterm paper download fall 2010 december
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)