Wednesday, November 25, 2009

Automata quiz fall 2009

=============================
QUIZ 1
=============================
Quiz Start Time: 06:37 AM
Time Left 19
sec(s)
Question # 1 of 10 ( Start time: 06:37:52 AM ) Total Marks: 1
While finding RE corresponding to TG, If TG has more than one final state then
Select correct option:
Introduce the new final state
Eliminate the old final state
Replace the old final state with start state
Replace the old final state with new start state
Quiz Start Time: 06:37 AM
Time Left 60
sec(s)
Question # 2 of 10 ( Start time: 06:39:16 AM ) 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
Quiz Start Time: 06:37 AM
Time Left 28
sec(s)
Question # 3 of 10 ( Start time: 06:39:53 AM ) Total Marks: 1
Which of the following statement is NOT true?
Select correct option:
FA can be considered to be an NFA
FA can be considered to be an NFA with null string
NFA can be considered to be an TG
TG can be considered to be an NFA
Quiz Start Time: 06:37 AM
Time Left 82
sec(s)
Question # 4 of 10 ( Start time: 06:41:17 AM ) 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
Quiz Start Time: 06:37 AM
Time Left 77
sec(s)
Question # 5 of 10 ( Start time: 06:41:34 AM ) 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
Quiz Start Time: 06:37 AM
Time Left 72
sec(s)
Question # 6 of 10 ( Start time: 06:41:54 AM ) Total Marks: 1
Is the language {a ab aba bab} regular?
Select correct option:
Yes
No
Quiz Start Time: 06:37 AM
Time Left 41
sec(s)
Question # 7 of 10 ( Start time: 06:42:18 AM ) 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
Quiz Start Time: 06:37 AM
Time Left 69
sec(s)
Question # 8 of 10 ( Start time: 06:43:21 AM ) Total Marks: 1
According to theory of automata there are _________ types of languages
Select correct option:
One
Two
Three
Four
Quiz Start Time: 06:37 AM
Time Left 32
sec(s)
Question # 9 of 10 ( Start time: 06:43:47 AM ) Total Marks: 1
What is false about the term alphabet?
Select correct option:
It is a finite set of symbols.
It is usually denoted by Greek letter sigma
It can be an empty set.
Strings are made up of its elements.
Quiz Start Time: 06:37 AM
Time Left 38
sec(s)
Question # 10 of 10 ( Start time: 06:44:54 AM ) Total Marks: 1
Every FA is a TG.
Select correct option:
True
False
=============================
QUIZ 2
=============================
Quiz Start Time: 06:46 AM
Time Left 19
sec(s)
Question # 1 of 10 ( Start time: 06:46:26 AM ) Total Marks: 1
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
Quiz Start Time: 06:46 AM
Time Left 84
sec(s)
Question # 2 of 10 ( Start time: 06:47:52 AM ) Total Marks: 1
What is false about the term alphabet?
Select correct option:
It is a finite set of symbols.
It is usually denoted by Greek letter sigma
It can be an empty set.
Strings are made up of its elements.
Quiz Start Time: 06:46 AM
Time Left 78
sec(s)
Question # 3 of 10 ( Start time: 06:48:05 AM ) Total Marks: 1
If S = {aa, bb}, then S* will not contain
Select correct option:
aabbaa
bbaabbbb
aaabbb
aabbbb
Quiz Start Time: 06:46 AM
Time Left 31
sec(s)
Question # 4 of 10 ( Start time: 06:48:28 AM ) Total Marks: 1
(a* + b*)* = (a + b)* this expression is __________
Select correct option:
True
False
Quiz Start Time: 06:46 AM
Time Left 84
sec(s)
Question # 5 of 10 ( Start time: 06:49:55 AM ) Total Marks: 1
Length of EVEN-EVEN language is _________
Select correct option:
Even
Odd
Sometimes even & sometimes odd
Such language doesn’t exist
Quiz Start Time: 06:46 AM
Time Left 21
sec(s)
Question # 6 of 10 ( Start time: 06:50:08 AM ) Total Marks: 1
What is false about the PALINDROME LANGUAGE?
Select correct option:
Every word is reverse of itself.
It is an infinite language.
FA can be build for it.
None of the given option
Quiz Start Time: 06:46 AM
Time Left 61
sec(s)
Question # 7 of 10 ( Start time: 06:51:33 AM ) 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
Waste Baskets
All of the given options
Quiz Start Time: 06:46 AM
Time Left 86
sec(s)
Question # 8 of 10 ( Start time: 06:52:09 AM ) Total Marks: 1
Automata is the plural of
Select correct option:
Automate
Automaton
Quiz Start Time: 06:46 AM
Time Left 78
sec(s)
Question # 9 of 10 ( Start time: 06:52:19 AM ) Total Marks: 1
If S = {a, b} then which of the following RE will generate all possible strings
Select correct option:
a* + b*
(ab)*
(a + b)*
(ab + ba)*
Quiz Start Time: 06:46 AM
Time Left 68
sec(s)
Question # 10 of 10 ( Start time: 06:52:39 AM ) Total Marks: 1
FA is also called
Select correct option:
TG
GTG
NFA
DFA
=============================
QUIZ 3
=============================
Quiz Start Time: 06:53 AM
Time Left 18
sec(s)
Question # 1 of 10 ( Start time: 06:53:40 AM ) Total Marks: 1
Every non deterministic Finite Automata can be converted into
Select correct option:
Regular Expression
Deterministic Finite Automata
Trasition Graph
All of the given options
Quiz Start Time: 06:53 AM
Time Left 81
sec(s)
Question # 2 of 10 ( Start time: 06:54:59 AM ) Total Marks: 1
What is false about the PALINDROME LANGUAGE?
Select correct option:
Every word is reverse of itself.
It is an infinite language.
FA can be build for it.
None of the given option
Quiz Start Time: 06:53 AM
Time Left 47
sec(s)
Question # 3 of 10 ( Start time: 06:56:26 AM ) Total Marks: 1
Let FA3 be an FA corresponding to FA1FA2, 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
Quiz Start Time: 06:53 AM
Time Left 86
sec(s)
Question # 4 of 10 ( Start time: 06:57:16 AM ) 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
Quiz Start Time: 06:53 AM
Time Left 4
sec(s)
Question # 7 of 10 ( Start time: 07:12:16 AM ) Total Marks: 1
FA corresponding to an NFA can be built by introducing an empty state for a letter
having
Select correct option:
no transition at certain state
one transition at certain state
two transition at certain state
more than two transitions at certain state
Quiz Start Time: 06:53 AM
Time Left 51
sec(s)
Question # 8 of 10 ( Start time: 07:13:45 AM ) Total Marks: 1
Closure of an FA, is same as ___________ of an FA with itself, except that the initial
state of the required FAis a final state as well.
Select correct option:
Union
Sum
Concatenation
Intersection
Quiz Start Time: 06:53 AM
Time Left 73
sec(s)
Question # 9 of 10 ( Start time: 07:14:27 AM ) Total Marks: 1
Which of the following statement is NOT true?
Select correct option:
FA can be considered to be an NFA
FA can be considered to be an NFA with null string
NFA can be considered to be an TG
TG can be considered to be an NFA
Quiz Start Time: 06:53 AM
Time Left 82
sec(s)
Question # 10 of 10 ( Start time: 07:14:46 AM ) Total Marks: 1
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
=============================
QUIZ 4
=============================
Quiz Start Time: 07:16 AM
Time Left 24
sec(s)
Question # 1 of 10 ( Start time: 07:16:42 AM ) Total Marks: 1
FA corresponding to an NFA can be built by introducing a state corresponding to the
combination of states, for a letter having
Select correct option:
no transition at certain state
one transition at certain state
more than one transitions at certain state
none of the given options
Quiz Start Time: 07:16 AM
Time Left 72
sec(s)
Question # 2 of 10 ( Start time: 07:17:56 AM ) Total Marks: 1
Formal is also known as _________
Select correct option:
Syntactic language
Semantic language
Informal language
None of these
Quiz Start Time: 07:16 AM
Time Left 82
sec(s)
Question # 3 of 10 ( Start time: 07:18:18 AM ) Total Marks: 1
Every non deterministic Finite Automata can be converted into
Select correct option:
Regular Expression
Deterministic Finite Automata
Trasition Graph
All of the given options
Quiz Start Time: 07:16 AM
Time Left 50
sec(s)
Question # 4 of 10 ( Start time: 07:18:32 AM ) 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
Quiz Start Time: 07:16 AM
Time Left 80
sec(s)
Question # 5 of 10 ( Start time: 07:19:49 AM ) Total Marks: 1
Does the empty string match the regular expression “y+a”?
Select correct option:
Yes
No
Quiz Start Time: 07:16 AM
Time Left 85
sec(s)
Question # 6 of 10 ( Start time: 07:20:07 AM ) Total Marks: 1
Let FA3 be an FA corresponding to FA1FA2, then the final state of FA3 must correspond
to the final state of
Select correct option:
FA1 only
FA2 only
FA1 or FA2
FA1 and FA2
Quiz Start Time: 07:16 AM
Time Left 39
sec(s)
Question # 7 of 10 ( Start time: 07:20:20 AM ) Total Marks: 1
What is false about the PALINDROME LANGUAGE?
Select correct option:
Every word is reverse of itself.
It is an infinite language.
FA can be build for it.
None of the given option
Quiz Start Time: 07:16 AM
Time Left 64
sec(s)
Question # 8 of 10 ( Start time: 07:21:35 AM ) Total Marks: 1
If R is a regular language and L is some language, and L U R is a regular language, then
L must be a regular language.
Select correct option:
True
False
Quiz Start Time: 07:16 AM
Time Left 64
sec(s)
Question # 9 of 10 ( Start time: 07:22:07 AM ) Total Marks: 1
Kleene star closure can be defined
Select correct option:
Over any set of string
Over specific type of string
Quiz Start Time: 07:16 AM
Time Left 78
sec(s)
Question # 10 of 10 ( Start time: 07:22:37 AM ) Total Marks: 1
If S = { x }, then S* will be
Select correct option:
{x,xx,xxx,xxxx,…}
{^ ,x,xx,xxx,xxxx,…}

No comments:

Advertisement