MIDTERM EXAMINATIONView more random threads:
- HRM624 Conflict Management Spring 2009 Final Term Paper
- ACC501 Final Term July 2011 paper subjective
- cs606compilerconstruction midterm paper for virtual...
- Unsolved Papers ENG201 - Business and Technical English...
- MGT501 Human Resource Management Spring 2009 Final Term
- CS403 Database Management Systems Fall 2009 Final Term
- MGT411- Money & Banking Spring 2009 Final Term Paper
- mgt501 midterm paper fall 2010 december 4
- IT430 E-Commerce Fall 2009 Final Term
- mgt401 midterm papers download 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)