MIDTERM EXAMINATIONView more random threads:
- CS403- Database Management Systems download midterm papers...
- MGT401 Financial Accounting II Spring 2009 Final Term Paper
- MGT610 Business Ethics Spring 2009 Final Term Paper
- CS502 Fundamentals of Algorithms Spring 2009 Final Term...
- FIN623 Taxation Management Spring 2009 Final Term Paper
- cS001 final term papers July 2011
- mgt402costmanagementaccounting solved past papers latest...
- CS501- Advance Computer Architecture (Session - 1) fall 2010
- CS403 Database Management Systems Fall 2009 Final Term
- MGT201- Financial 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)