Cs402 Quiz 1.docx

============================= 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,…}

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 In concatenation we accept the initial state of FA2 automatically after the final state of FA1 because of: Select correct option: 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? Select correct option: 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: Select correct option: FA1 FA2 FA2-FA1 (FA2)*

Let FA1 accepts many strings and FA2 accepts none then FA1+FA2 will be equal to: Select correct option: FA1 FA2 FA2-FA1 (FA2)* The language {a ab aba bab} is _____ . Select correct option: Irregular Regular Recursive None of the given options

Decomposing a string into its valid units is referred as: Select correct option: 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: Select correct option: 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 Select correct option: 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: Select correct option: 1 2 3 4 A regular language can be: Select correct option: irregular infinite non-deterministic None of the given options Decomposing a string into its valid units is referred as: Select correct option: Decomposing Splitting Tokenizing Dividing

We cannot construct an NFA for the language of ______ defined over alphabet set {a,b}. Select correct option: Even even odd Palindromes Integers In _______ there must be transition for all the lettersof a string. Select correct option: 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 ______ . Select correct option: Same Different There ______ a language for which only FA can be built but not the RE. Select correct option: is cannot be may be may not be A regular language can be: Select correct option: irregular infinite non-deterministic None of the given options If FA1 corresponds to (a+b)* then FA1 must accept ___________ string/strings. Select correct option: 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: Select correct option: 1 2 3 4 In _______ there must be transition for all the lettersof a string. Select correct option: NFA GTG TG FAFA and _______ are same except that _______ has unique symbol for each transition. Select correct option: 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? Select correct option: 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 Select correct option: 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: Select correct option: 1 2 3 4

Question # 1 of 10 ( Start time: 10:32:10 PM ) Total Marks: 1 Every TG is an FA Select correct option: True False

Question # 2 of 10 ( Start time: 10:32:56 PM ) 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

Question # 3 of 10 ( Start time: 10:33:52 PM ) Total Marks: 1 Given S, Kleene star closure is denoted by Select correct option: S* S+ SNone of these

Quiz Start Time: 10:32 PM Time Left 82 sec(s) Question # 4 of 10 ( Start time: 10:35:21 PM ) 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.

Question # 5 of 10 ( Start time: 10:36:30 PM ) Total Marks: 1 To find RE corresponding to TG we convert the TG into Select correct option: FA GTG NFA None of the given options

Question # 6 of 10 ( Start time: 10:37:37 PM ) 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

Question # 7 of 10 ( Start time: 10:38:51 PM ) Total Marks: 1 Automata is the plural of Select correct option: Automate Automaton

Question # 8 of 10 ( Start time: 10:39:19 PM ) Total Marks: 1 If S = { x }, then S* will be Select correct option: {x,xx,xxx,xxxx,…} {^ ,x,xx,xxx,xxxx,…}

Question # 9 of 10 ( Start time: 10:40: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 # 10 of 10 ( Start time: 10:41:03 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 Waste Baskets All of the given options

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 Question # 2 of 10 ( Start time: 11:35:40 PM ) Total Marks: 1 FA is also called TG GTG NFA DFA Question # 3 of 10 ( Start time: 11:36:04 PM ) Total Marks: 1 If r1 and r2 are regular expressions then which of the following is not regular expression

r1 + r2 r1 r2 r1* r1 – r2 Question # 4 of 10 ( Start time: 11:37:47 PM ) Total Marks: 1 Kleene star closure can be defined Over any set of string Over specific type of string Question # 5 of 10 ( Start time: 11:38:29 PM ) Total Marks: 1 Which of following string(s) belongs to the language of the regular expression (aa*b)*? baabab abbbaa aaaaaa aabaab Question # 6 of 10 ( Start time: 11:39:05 PM ) Total Marks: 1 According to theory of automata there are _________ types of languages Select correct option: One Two Three Four Question # 7 of 10 ( Start time: 11:40:38 PM ) Total Marks: 1 If S = {aa, bb}, then S* will not contain aabbaa bbaabbbb aaabbb aabbbb Question # 8 of 10 ( Start time: 11:41:25 PM ) Total Marks: 1 Every non deterministic Finite Automata can be converted into Regular Expression Deterministic Finite Automata Trasition Graph All of the given options Question # 9 of 10 ( Start time: 11:42:38 PM ) Total Marks: 1 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 Question # 10 of 10 ( Start time: 11:43:18 PM ) Total Marks: 1 (a* + b*)* = (a + b)* this expression is _________ True False