CS402 Online Quiz
Friday, November 05, 2010 Posted In CS and IT Edit This
Question # 10 of 10 ( Start time: 08:52:04 PM ) Total Marks: 1
The language having even number of a's and even number of b's defined over S = {a, b} is called
Select correct option:
EVEN-EVEN************
ODD-ODD
PALINDROME
FACTORIAL
Question # 1 of 10 ( Start time: 09:12:21 PM ) Total Marks: 1
The states in which there is no way to leave after entry are called
Select correct option:
Davey John Lockers
Dead States ***** not cofm
Waste Baskets
All of the given options
Question # 2 of 10 ( Start time: 09:13:44 PM ) Total Marks: 1
Kleene star closure can be defined
Select correct option:
Over any set of string*********
Over specific type of string
Question # 3 of 10 ( Start time: 09:14:53 PM ) Total Marks: 1
Automata is the plural of
Select correct option:
Automate
Automaton **********
Question # 4 of 10 ( Start time: 09:15:26 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*)*
Select correct option:
a and b
a and c
c and d
All of the given options
Question # 5 of 10 ( Start time: 09:16:51 PM ) Total Marks: 1
If two RE's generate same language then these RE's are called
Select correct option:
Same RE
Equal RE
Similar RE
Equivalent RE ****
Question # 6 of 10 ( Start time: 09:18:12 PM ) Total Marks: 1
Two FAs are said to be equivalent, if they
Select correct option:
accept null string
accept same language *******
accept different language
none of the given options
Question # 7 of 10 ( Start time: 09:19:34 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
C or D
Question # 8 of 10 ( Start time: 09:21:01 PM ) Total Marks: 1
To find RE corresponding to TG we convert the TG into
Select correct option:
FA
GTG **** not cnfm
NFA
None of the given options
Question # 9 of 10 ( Start time: 09:22:23 PM ) Total Marks: 1
If S = { x }, then S* will be
Select correct option:
{x,xx,xxx,xxxx,…}
{^ ,x,xx,xxx,xxxx,…} **************
Question # 10 of 10 ( Start time: 09:23:46 PM ) Total Marks: 1
a* + b* = (a + b)* this expression is _________
Select correct option:
True *****
False
The language having even number of a's and even number of b's defined over S = {a, b} is called
Select correct option:
EVEN-EVEN************
ODD-ODD
PALINDROME
FACTORIAL
.....
Question # 1 of 10 ( Start time: 09:12:21 PM ) Total Marks: 1
The states in which there is no way to leave after entry are called
Select correct option:
Davey John Lockers
Dead States ***** not cofm
Waste Baskets
All of the given options
Question # 2 of 10 ( Start time: 09:13:44 PM ) Total Marks: 1
Kleene star closure can be defined
Select correct option:
Over any set of string*********
Over specific type of string
Question # 3 of 10 ( Start time: 09:14:53 PM ) Total Marks: 1
Automata is the plural of
Select correct option:
Automate
Automaton **********
Question # 4 of 10 ( Start time: 09:15:26 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*)*
Select correct option:
a and b
a and c
c and d
All of the given options
Question # 5 of 10 ( Start time: 09:16:51 PM ) Total Marks: 1
If two RE's generate same language then these RE's are called
Select correct option:
Same RE
Equal RE
Similar RE
Equivalent RE ****
Question # 6 of 10 ( Start time: 09:18:12 PM ) Total Marks: 1
Two FAs are said to be equivalent, if they
Select correct option:
accept null string
accept same language *******
accept different language
none of the given options
Question # 7 of 10 ( Start time: 09:19:34 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
C or D
Question # 8 of 10 ( Start time: 09:21:01 PM ) Total Marks: 1
To find RE corresponding to TG we convert the TG into
Select correct option:
FA
GTG **** not cnfm
NFA
None of the given options
Question # 9 of 10 ( Start time: 09:22:23 PM ) Total Marks: 1
If S = { x }, then S* will be
Select correct option:
{x,xx,xxx,xxxx,…}
{^ ,x,xx,xxx,xxxx,…} **************
Question # 10 of 10 ( Start time: 09:23:46 PM ) Total Marks: 1
a* + b* = (a + b)* this expression is _________
Select correct option:
True *****
False
