cs402 QUIZ 1

=============================
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
Time Left 60
sec(s)
If two RE’s generate same language then these RE’s are called
Same RE
Equal RE
Similar RE
Equivalent RE
Time Left 28
sec(s)
Which of the following statement is NOT true?
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
Time Left 82
sec(s)
Two FAs are said to be equivalent, if they
accept null string
accept same language
accept different language
none of the given options
Time Left 77
sec(s)
The language having even number of a’s and even number of b’s defined over S = {a, b}
is called
EVEN-EVEN
ODD-ODD
PALINDROME
FACTORIAL
Time Left 72
sec(s)
Is the language {a ab aba bab} regular?
Yes
No
Time Left 41
sec(s)
Let FA3 be an FA corresponding to FA1+FA2, then the initial state of FA3 must
correspond to the initial state of
FA1 only
FA2 only
FA1 or FA2
FA1 and FA2
Time Left 69
sec(s)
According to theory of automata there are _________ types of languages
One
Two
Three
Four
Time Left 32
sec(s)
What is false about the term alphabet?
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.
Time Left 38
sec(s)
Every FA is a TG.
True
False
=============================
QUIZ 2
=============================
Time Left 19
sec(s)
While finding RE corresponding to TG, we connect the new start state to the old start
state by the transition labeled by
a
b
null string
None of the given options
Time Left 84
sec(s)
Time Left 78
sec(s)
If S = {aa, bb}, then S* will not contain
aabbaa
bbaabbbb
aaabbb
aabbbb
Time Left 31
sec(s)
(a* + b*)* = (a + b)* this expression is __________
True
False
Time Left 84
sec(s)
Length of EVEN-EVEN language is _________
Even
Odd
Sometimes even & sometimes odd
Such language doesn’t exist
Time Left 21
sec(s)
What is false about the PALINDROME LANGUAGE?
Every word is reverse of itself.
It is an infinite language.
FA can be build for it.
None of the given option
Time Left 61
sec(s)
The states in which there is no way to leave after entry are called
Davey John Lockers
Dead States
Waste Baskets
All of the given options
Time Left 86
sec(s)
Automata is the plural of
Automate
Automaton
Time Left 78
sec(s)
If S = {a, b} then which of the following RE will generate all possible strings
a* + b*
(ab)*
(a + b)*
(ab + ba)*
Time Left 68
sec(s)
FA is also called
TG
GTG
NFA
DFA
=============================
QUIZ 3
=============================
Time Left 18
sec(s)
Every non deterministic Finite Automata can be converted into
Regular Expression
Deterministic Finite Automata
Trasition Graph
Time Left 81
sec(s)
Time Left 47
sec(s)
Let FA3 be an FA corresponding to FA1FA2, then the initial state of FA3 must
correspond to the initial state of
FA1 only
FA2 only
FA1 or FA2
FA1 and FA2
Time Left 86
sec(s)
is called
EVEN-EVEN
ODD-ODD
PALINDROME
FACTORIAL
Time Left 4
sec(s)
FA corresponding to an NFA can be built by introducing an empty state for a letter
having
no transition at certain state
one transition at certain state
two transition at certain state
more than two transitions at certain state
Time Left 51
sec(s)
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.
Union
Sum
Concatenation
Intersection
Time Left 73
sec(s)
Which of the following statement is NOT true?
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
Time Left 82
sec(s)
a
b
null string
=============================
QUIZ 4
=============================
Time Left 24
sec(s)
FA corresponding to an NFA can be built by introducing a state corresponding to the
combination of states, for a letter having
no transition at certain state
one transition at certain state
more than one transitions at certain state
none of the given options
Time Left 72
sec(s)
Formal is also known as _________
Syntactic language
Semantic language
Informal language
None of these
Time Left 82
sec(s)
Regular Expression
Trasition Graph
Time Left 50
sec(s)
Which of the following regular expression represents same language? a. (a+ab)* b.
(ba+a)* c. a*(aa*b)* d. (a*b*)*
a and b
a and c
c and d
Time Left 80
sec(s)
Does the empty string match the regular expression “y+a”?
Yes
No
Time Left 85
sec(s)
Let FA3 be an FA corresponding to FA1FA2, then the final state of FA3 must correspond
to the final state of
FA1 only
FA2 only
FA1 or FA2
FA1 and FA2
Time Left 39
sec(s)
Time Left 64
sec(s)
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.
True
False
Time Left 64
sec(s)
Kleene star closure can be defined
Over any set of string
Over specific type of string
Time Left 78
sec(s)
If S = { x }, then S* will be
{x,xx,xxx,xxxx,…}
{^ ,x,xx,xxx,xxxx,…}
Let FA3 be an FA corresponding to FA1FA2, then the initial state of FA3 must correspond to the
initial state of
FA1 only
FA2 only
FA1 or FA2
FA1 and FA2
In concatenation we accept the initial state of FA2 automatically after the final state of FA1 because
of:
We need just one initial state
We need exactly one final state
Some part of a string may be accepted by FA2
The strings of FA2 are accepted first before the strings of FA1
Even even
odd
Palindromes
Integers
Which of the following will be the final state of FA3 obtained from the union of FA1 and FA2?
Final state of FA1
Final state of FA2
Final states of FA1 or FA2
Final states of FA1 or FA2 or both
Let FA1 accepts many strings and FA2 accepts none then FA1+FA2 will be equal to:
FA1
FA2
FA2-FA1
(FA2)*
Let FA1 accepts many strings and FA2 accepts none then FA1+FA2 will be equal to:
FA1
FA2
FA2-FA1
(FA2)*
The language {a ab aba bab} is _____ .

Irregular
Regular
Recursive
Decomposing a string into its valid units is referred as:
Decomposing
Splitting
Tokenizing
Dividing
The minimum length of the strings(except null string) of a language that starts and ends in different
letters will be:
1
2
3
4
Let FA3 be an FA corresponding to FA1+FA2, then the initial state of FA3
Must correspond to the initial state of
FA1 only
FA2 only
FA1 or FA2
FA1 and FA2
If FA1 corresponds to (a+b)* then FA1 must accept ___________ string/strings.

Select correct option: No Odd
length
Even length
Every
The minimum length of the strings(except null string) of a language that starts and ends in the same
letters will be:
1
2
3
4
A regular language can be:

irregular
infinite
non-deterministic
Decomposing a string into its valid units is referred as:
Decomposing
Splitting
Tokenizing
Dividing
We cannot construct an NFA for the language of ______ defined over alphabet set {a,b}.
Even
even odd
Palindromes
Integers
In _______ there must be transition for all the lettersof a string.

NFA
GTG
TG
FABC100403151 : Sidra Sahar Quiz Start Time: 06:43 PM Time Left 87 sec(s) Question # 7 of 10 (
Start time: 06:49:08 PM ) Total Marks: 1 For every three regular expressions R, S, and T,
the languages denoted by R(S U T) and (RS) U (RT) are the ______ .
Same Different
There ______ a language for which only FA can be built but not the RE.
is cannot
be may
be may
not be
A regular language can be:
irregular
infinite
non-deterministic
If FA1 corresponds to (a+b)* then FA1 must accept ___________ string/strings.
No Odd
length
Even length
EveryConsider we have languages L7 and L6. Which of the following represents their
concatenation? Select correct option:
L7+L6
L7/L6
L6L7
L7L6
Closure of an FA is the same as ___________ of an FA with itself except that the initial state of
the required FA is a final state as well.
Select correct
The minimum length of the strings(except null string) of a language that starts and ends in different
letters will be:
1
2
3
4
In _______ there must be transition for all the lettersof a string.

NFA
GTG
TG
FAFA and _______ are same except that _______ has unique symbol for each transition.
FA,TG
NFA, TG
NFA, FA
GTG,NFA
If we have a finite language and the number of states in the FA is n then the maximum number of
letters in the each word of the language that will be ac
1
n-1
n+1
n
Consider we have languages L7 and L6. Which of the following represents their concatenation?
L7+L6
L7/L6
L6L7
L7L6
Let FA3 be an FA corresponding to FA1FA2, then the final state of FA3 must correspond to the final
state of
FA1 only
FA2 only
FA1 or FA2
FA1 and FA2
The minimum length of the strings(except null string) of a language that starts and ends in the same
letters will be:
1
2
3
4
Question # 1 of 10 ( Start time: 10:32:10 PM ) Total Marks: 1
Every TG is an FA
True
False

a
b
null string

Given S, Kleene star closure is denoted by
S*
S+
S-
None of these
Quiz Start Time: 10:32 PM

Time Left 82
sec(s)

To find RE corresponding to TG we convert the TG into
FA
GTG
NFA



Automata is the plural of
Automate
Automaton

If S = { x }, then S* will be

{x,xx,xxx,xxxx,…}
{^ ,x,xx,xxx,xxxx,…}
is called
EVEN-EVEN
ODD-ODD
PALINDROME
FACTORIAL


Davey John Lockers
Dead States
Waste Baskets

FA is also called
TG
GTG
NFA
DFA
If r1 and r2 are regular expressions then which of the following is not regular expression
r1 + r2
r1 r2
r1*
r1 – r2
Kleene star closure can be defined
Over any set of string
Over specific type of string
Which of following string(s) belongs to the language of the regular expression (aa*b)*?
baabab
abbbaa
aaaaaa
aabaab
According to theory of automata there are _________ types of languages
One
Two
Three
Four
If S = {aa, bb}, then S* will not contain
aabbaa
bbaabbbb
aaabbb
aabbbb
Regular Expression
Trasition Graph
Davey John Lockers
Dead States
Waste Baskets
(a* + b*)* = (a + b)* this expression is _________
True
False

cs402 QUIZ 1

Caricato da

Informazioni sul documento

Titolo originale

Copyright

Formati disponibili

Condividi questo documento

Condividi o incorpora il documento

Opzioni di condivisione

Hai trovato utile questo documento?

Questo contenuto è inappropriato?

Copyright:

Formati disponibili

cs402 QUIZ 1

Caricato da

Copyright:

Formati disponibili

=============================

The language {a ab aba bab} is _____ .

If FA1 corresponds to (a+b)* then FA1 must accept ___________ string/strings.

A regular language can be:

In _______ there must be transition for all the lettersof a string.

In _______ there must be transition for all the lettersof a string.

Question # 2 of 10 ( Start time: 10:32:56 PM ) Total Marks: 1

Question # 3 of 10 ( Start time: 10:33:52 PM ) Total Marks: 1

Quiz Start Time: 10:32 PM

It is a finite set of symbols.

Question # 6 of 10 ( Start time: 10:37:37 PM ) Total Marks: 1

Every word is reverse of itself.

Question # 7 of 10 ( Start time: 10:38:51 PM ) Total Marks: 1

Question # 8 of 10 ( Start time: 10:39:19 PM ) Total Marks: 1

Select correct option:

Question # 10 of 10 ( Start time: 10:41:03 PM ) Total Marks: 1

Select correct option:

What is false about the PALINDROME LANGUAGE?

Potrebbero piacerti anche