QUIZ NO 1 CS402

Question # 1 of 10 ( Start time: 05:46:41 PM ) Total Marks: 1
While finding RE corresponding to TG, If TG has more than one start state then
Select correct option:
Introduce the new start state
Eliminate the old start state
Replace the old start state with final state
Replace the old final state with new start state


Question # 2
While finding RE corresponding to TG, we connect the new start state to the old start state by the transition labeled by
Select correct option:
a
b
null string
None of the given options

Question # 3 of 10 ( Start time: 05:49:03 PM ) Total Marks: 1
Which of the following regular expression represents same language? a. (a+ab)* b. (ba+a)* c. a*(aa*b)* d. (a*b*)*
a+b)*a(a+b)*b(a+b)*+ (a+b)*b(a+b)*a(a+b)*.

{ x}*, { x}+, {a+b}*

Select correct option:
a and b
a and c
c and d

Question # 4 of 10 ( Start time: 05:50:32 PM ) Total Marks: 1
(a* + b*)* = (a + b)* this expression is __________
Select correct option:
True
False

Question # 5 of 10 ( Start time: 05:51:30 PM ) Total Marks: 1
Let FA3 be an FA corresponding to FA1+FA2, then the initial state of FA3 must correspond to the initial state of
Select correct option:
FA1 only
FA2 only
FA1 or FA2
FA1 and FA2

Question # 6 of 10 ( Start time: 05:53:01 PM ) Total Marks: 1
Which of the following statement is NOT true about TG?
Select correct option:
There exists exactly one path for certain string
There may exist more than one paths for certain string
There may exist no path for certain string
There may be no final state

Question # 7 of 10 ( Start time: 05:54:06 PM ) Total Marks: 1
Kleene’s theorem states
Select correct option:
All representations of a regular language are equivalent.
All representations of a context free language are equivalent.
All representations of a recursive language are equivalent
Finite Automata are less powerful than Pushdown Automata.


Question # 8 of 10 (Start time: 05:55:36 PM) Total Marks: 1
What do automata mean?
Select correct option:
Something done manually
Something done automatically

Question # 9 of 10 ( Start time: 05:56:51 PM ) Total Marks: 1
A language accepted by an FA is also accepted by
Select correct option:
TG only
GTG only
RE only
All of the given

Question # 10 of 10 ( Start time: 05:58:16 PM ) Total Marks: 1
If r1 = (aa + bb) and r2 = (a + b) then the language (aa + bb)(a + b) will be generated by
Select correct option:
(r1)(r2)
(r1 + r2)
(r2)(r1)
(r1)*

Question # 1 of 10 ( Start time: 11:12:33 PM ) Total Marks: 1
Alphabet S = {a, bc, cc} has _______ number of letters
Select correct option:
Question # 2 of 10 ( Start time: 11:14:03 PM ) Total Marks: 1
If S = { x }, then S* will be
{x,xx,xxx,xxxx,…}
{^ ,x,xx,xxx,xxxx,…}

Question # 3 of 10 ( Start time: 11:15:11 PM ) Total Marks: 1
Length of EVEN-EVEN language is _________
Select correct option:

Question # 4 of 10 ( Start time: 11:16:41 PM ) Total Marks: 1
If r1 = (aa + bb) and r2 = (a + b) then the language (aa + bb)(a + b) will be generated by
Question # 5 of 10 ( Start time: 11:17:26 PM ) Total Marks: 1
If S = {aa, bb}, then S* will not contain
Aabbaa
Bbaabbbb
Aaabbb
aabbaaaa

Question # 6 of 10 ( Start time: 11:18:55 PM ) Total Marks: 1
Formal is also known as _________
Syntactic language
Semantic language
Informal language
None of these

Question # 7 of 10 ( Start time: 11:20:15 PM ) Total Marks: 1
In an FA, when there is no path starting from initial state and ending in final state then that FA
accept null string
accept all strings
accept all non empty strings
does not accept any string
Question # 9 of 10 ( Start time: 11:22:33 PM ) Total Marks: 1
FA of EVEN language shows null string when
Initial state is final as well
EVEN does not accept null
One state is declared null
None of the these

plz upload current cs402 quiz :s