Deprecated: The behavior of unparenthesized expressions containing both '.' and '+'/'-' will change in PHP 8: '+'/'-' will take a higher precedence in /home/vulmshel/public_html/wp-content/plugins/ad-inserter/class.php on line 7077

Deprecated: The behavior of unparenthesized expressions containing both '.' and '+'/'-' will change in PHP 8: '+'/'-' will take a higher precedence in /home/vulmshel/public_html/wp-content/plugins/ad-inserter/class.php on line 7139

Deprecated: The behavior of unparenthesized expressions containing both '.' and '+'/'-' will change in PHP 8: '+'/'-' will take a higher precedence in /home/vulmshel/public_html/wp-content/plugins/ad-inserter/class.php on line 8135

Deprecated: The behavior of unparenthesized expressions containing both '.' and '+'/'-' will change in PHP 8: '+'/'-' will take a higher precedence in /home/vulmshel/public_html/wp-content/plugins/ad-inserter/class.php on line 8197
CS402 Solved Grand Quiz Spring 2021 - VULMS Help

CS402 Solved Grand Quiz Spring 2021

Dear Students in this post we are providing you CS402 Solved Grand Quiz Spring 2021. We have provided all Past CS402 Grand Quiz with 100% correct Solution. You can also visit our website vulmshelp.com for the solution of CS402 Mid Term past paper and Final Term Past paper.

CS402 Solved Grand Quiz Spring 2021

CS402 SOLVED MCQs

Sr.NoMCQSANSWER
Which of the following steps replaces multiple incoming transition edges with a single one proving Kleene’s theorem part II?Step 3
 2Let FA1 accepts many strings and FA2 accepts no strings, then  FA1+FA2 will be equal to:FA1
 3Let L be the language of all strings, defined over ∑ =(0,1), ending in 10. Which of the following strings are indistinguishable w.r.t L with z being 0? (010,101)
 4If r1=(aa+bb)and r2=(a+b) then the  language (aa+bb)(a+b) will bhe generated by_______(r)(r2)  
 5Introducing a new start state in the case of multiple states is step no.______ of proving Kleen’s theorem part II.1
 6The language having even numbers of a’s and even number of b’s defined over S={a,b} is called ______EVEN-EVEN
 7In NFA having no transition at a certain state, FA can be built by introducing :Empty state
 8For every three regular expression R, S, and T. the language denoted by R(S U T) and (RS)U(RT) are the _______Same
 9Which of the following string belongs to the language of the regular expression (aa*b)?aabaab
 10If L1’ and L2’ are regular languages, then L1, L2 will beRegular
 11Suppose the language L1 has 2 L2 has 2 states. If we have a machine M that accepts L1∩L2. Then the total number of states in M is equal to_______4
12If L is a regular language, then (L’)’ U L will be:L
 13In  Mealy machine, the output depends on______Present state and Present output
 14Strings x,y,z belongs to ∑* such that xz ∈ L but yz ∉ L where L ⊆ ∑* are:Distinguishable
 15Melay machine to increase the output string in magnitude by 1 is called:Incrementing machine
 16Suppose we have FA3 (which is to FA1+FA2) then the final state of FA3 will be declared final if:It corresponds to any of the final states of FA1 or FA2
 17If we have the finite language and the number of states in the FA is n then the maximum number of letter in each word of the language that will be accepted  by the given FA will be :n+1
 18Which of the following state is introduced while developing NFA for the closure of FA?An initial state which should be  final as well
 19Length of EVEN-EVEN language is_______Even
 20If FA1 corresponds to (a+b)* then FA1 must accept_______ strings/strings.Every
 21In FA, initial stage is represented by :Drawing an arrowhead before the state 
 22Which one of the following machine is represented as a pictorial representation with states and directed edges labeled by an input letter along with an output character?Mealy machine
 23Length of machine “AbBAbcd“ defined over ∑=(Ab,B,c,d) is_______.Five
 24An FA is a collection of:Finite states , finite transition and finite input letter
 25Given the language L={ab, aa, baa}, which of the following strings are in L*? abaabaaabaaaaaabaaaabaaaaabaaaabbaaaaabaa1,2 & 4
 26In the context to make NFA for the concentration of FA1 and FA2 (FA1 accepting null string) which of the following option is correct?Final states in both FAs
 27Every ___ is a ___ as well, but the converse may not be true.FA, TG
28 NFA with null string has ____ initial state(s).One
 29While finding RE corresponding to a TG, we connect the new start state with the old start state by____ transition.Null
 30If S=(x). then S* will be_____.{^,x,xx,xxx,xxxx….}
 31The minimum length of string (except null string) of a language that starts and ends in the same letter will be:2
 32If S={ab, bb} , then S* will  not contain______.bbba
 33Which of the following machine has only one initial state?Moore machine
 34Which of the following diagram is very rigid in order to express any language?FA
 35Let L be the language of all strings, defined over ∑ =(0,1), ending in 111. Which of the following strings are indistinguishable w.r.t L with z being 11?111,101
 36Mealy machine can have ______ final states.Zero
 37In Moore machine , output is produced over  the change of:States
 38Lets we have two regular expressions R1 ={xx+yy}and R2={x+y} . Which one of the following is the correct regular expression for the union of R1 and R2?(xx+yy)+(x+y)
 39FA 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
 40The situation there is no way to leave after entry is calledDavey john locker
 41Which one of the following word is not accepted by the given regular expression?Abbaab
 42According to the theory of automata, there are ________ types of languages.Two
 43Which of the following word is not accepted by the given regular expression?Baabaabba
 44Regular languages are closed under the following operations.Union, Concentration, Closure
 45There can be more than ____ FA for a certain language but for ____FA there is only one language associated with it.One, one
 46There is no compulsion that each state must have an on outdoing edge for every input variable in:Transition graph
 47FA is also called_____.DFA
 48If r1 and r2 are regular expressions then (r1*r2) is______RE (Regular expression)  
 49Which of the following is the minimal number of states for a finite automaton accepting the language of all strings defined over any alphabet set?1
 50Keeping view language of all strings ending with ‘a’ for which symbol we will take a loop on the final state of its transition diagram?A
 51Which of the following statements is true about NFA with Null String?Transition of null string is allowed in any stage
 52Which one of the following diagrams expresses languages more simply?GTG
 53The language of all strings defined over alphabet set={a,b} that does not end with ‘a’ actually end with:a and ^
 54Let S={aa,bb}, then S* will have the _____ string.^
 55Formal is also known as_____.Syntactic language
 56There may be more than one transition for a certain letter on a state in:Non-Deterministic finite automata
 57A loop at a state is supposed to be_____transition while converting Moore machine into an equivalent Maley machine.Incoming
 58FA of EVEN language shows null string when______. initial state is final as well
 59Which of the following statement is true about GTG?Transitions are based on regular expressions
 61Which of the following machine has only one initial state and no final state?Moore machine
 62In GTG, there can be more than one :Start state and final state
 63GTG for the expression (aa+aba)* may have minimum number of states.1
 64In regular expression, the operator  ‘*’ stands for.Iteration
 65If we have only one state having no transition for input letters, then it is an example of:NFA
 67If A and B are regular languages, !(A’U B’) is:Regular
 68A ________ with “n” states must accept least one string of length greater than “n”.DFA
 69If r1 is a regular expression then (r1)* is _______.Also a regular expression
 70Which of the following is the bypass and state elimination step in the context of  Kleene’s theorem part II proof?4
 71Which of the following is free of non-determinism?FA
 72There is no question of accepting any language in:Moore machine
 73A string will be accepted by an NFA if there exist_______one successful path.atleast
 74Kleene’s theorem part I expresses the relationship between_______FA and TG
 75Keeping in view the discussion by Martin, how any states are required to recognize the language of all strings of length 2 or more defined over ∑={a,b} with ’b’ being the second letter from right?7
 76FA and _____ are same excepts that ______has unique symbol for each transition.NFA,FA
 77Subtraction of binary number is possible through.Both complementing and incrementing machine
 78Null strings can be specified on edges in:Transition graph
 79What is false about the PLAINDROME LANGUAGE?FA can be build for it
 80While finding RE corresponding to a TG, if TG has more than one start state then.Introduce the new start state
 81All possible combination of string of a language including null string is referred as.Kleene star closure of a language
 82N! will be equal to:n*(n-1)!
 83Every NFA can be  considered to be a____ as well, but the converse may not be true.TG
 84In proving Kleene theorem II , if three statuses are connected then middle state is removed bt connecting  first and third and writing corresponding RE in:Concentration  
 85In ______ there must be transition for all the letters of the string.FA
 86For a given Moore Machine , the input string is ‘101010’ , thus the output string would be of length:Length of input string+1
 87The FA can be drawn for the regular expression (a+b)* with minimum________ state(s).1
 88Which of the following does not contribute while finding out the length of strings?^
 89The language of all strings defined over alphabet set ={x,y} that ends with same letters will have the maximum length of:Infinite  
 90Considering FA1 and FA2 having 2 states each. Now FA1+FA2 can have maximum__________ number of states.More than 3
 91Which one of the following is RE for the language defined over ∑={a,b} having all the words starting with a?a(a+b)*
 92An ________ can be considered to be an intermediate structure between finite automaton and transition graph.NFA
 93In order to make NFA for the union of FA1 and FA2, the new initial state should be liked to:Initial states of both FAs
 94We cannot construct an NFA for the language of _______ defined over alphabet set{a,b}.Palindromes
95The CFG is said to be ambiguous if there exist at least one word of its language that can be generated by the ………… production treesMore then one / Different
 96What do automata mean?something that works automatically / “something are done automatically
 97 According to theory of automata there2
 98The Minimum length of the string (except bull string) of a language that starts and ends in the same letters will be:1
 99If S= {ab,bb} then S* will not contain_________Bbba
 100Which of the following machines has only one initial state and no final state?More machine
 101Which of the following diagram is very rigid in order to express any language ?FA
 102If S={a},then S+will be______{a,aa ,aaa , aaaa…}
 104Let L be the language of the all string defined over over ending in10. Which of the following string are indistinguishable with respect to L with z being 11?010,101
 105Melay machine can have _____final stateZero
 106Given the Language L = {ab, aa,baa},which of the following string are in L*?
1.Abaabaaaabaa
2.Aaaabaaaa
3. Baaaaabaaaaab
4. baaaaabaa
1, 2 and 4
 107If L1 and L2 are regular Language L1 will beRegular
 108In Mealy Machine the out put depends on_______Present State and present output
 109There is no question of accepting any language in.Moore Machine
 110The state where there is no way to leave after entry is called___Davey john Locker
 111FA corresponding to an NFA can be built by introducing an empty state for a letter havingNo transaction at certain state
 112Which of the following diagram express language more simply?GTG
 113Automata is the plural of______Automation
 114If A and B are regular Language !(AB) isRegular
 115In NFA having no transition at certain state FA can be built by introducing.Empty state
 116Consuming FA1 and FA2 having 2 STATES each. Now FA1+FA2 can have maximum______number of state  2
3
More then 3
None of the given
 117In an FA when there is no path starting from initial state and ending state in final state then that FA______Accept all string
 118According to theory of automation there are_____type if languageTwo
 119In Moore machine if the length of input string is 9 then the length of output string will be.10
 120When ODD language is expressed by an FA,then it will have minimum ____ stateOne
 121[(a+b)(a+b)]*.given RE contact generate the string________Bbbbbb
 122Which of the following state is true about GTG?Transection are based on regular expression
 123Every_____is a _____ as will, but the converts may not be true.FA,TG
 124Which of the following machine is represented as a pictorial representation with states and directed edges labeled by an input letter along with an output character?Mealy Machine
 125The recursive method for defining a language has ____ stepsThree
 126Consider the following RE. A(a+b)b* All of the following word are accepted except______Aa
 127Which of the following regular expression represented same language? (a+ab)*2(ba+a)*A*(aa*b)*(a*b)*1 and 2
 128For every there regular expression R,S and T the Language denoted by R(ST) and (RS)(RT) are theSame
 129Alphabet S={a,bc,cc} has____number of letters.Three
 130An____can be considered to be an intermediate structure between Finite automation and Transition Graph.NFA
 131Two FAs are said to be equivalent if they______Accept same language
 132There may be more then one transition for a certain letter on a state inFinite Automata
 133_____can also help in proving Kleene Theorem III.NFA
 134Kleene Theorem Part II expression the relationship between____TG and RE
 135FA corresponding to an NFA can be built by introducing an empty state for a letter having.No transition at certain state
 136FA is also calledDFA
 137If two Res generated  same language then these Res are called ____Equivalent RE
 138We cannot an NFA for the language of ____ defend over alphabet set{a,b}Palindromes
 139Kleene Theorem Part II expression the relationship between____RE and FA
 140Let FA3 an FA corresponding to FA1 FA2 then the initial state of FA3 must correspond to the initial state ofFA1 only
 141Every FA should be___Deterministic
 142The minimum length of string (except null string) of a language that starts and ends in the different letter will be:1
 143Which of the following will be the final state of FA3 obtained from the union of FA1 and FA2?Final states of FA1 or FA2
 144In concatenation we accept the initial state of FA2 automatically after the final state of FA1 because of:We need just one initial state
 145Let FA1 accepts many strings and FA2 accepts none then FA1+FA2 will be equal to:FA2-FA1
 146The language {a ab aba bab} is _____ .  Regular
 147Decomposing a string into its valid units is referred as:Tokenizing
 148Let FA3 be an FA corresponding to FA1+FA2, then the initial state of FA3 Must corresponds to the initial state of  FA1 or FA2
 If FA1 corresponds to (a+b)* then FA1 must accept ___________ string/strings. Select correct option: No Odd lengthEVERY
 149A regular language can be:irregular infinite non-deterministic None of the given options  
 150N into its valid units is referred as:Tokenizing
 151The strings of FA2 are accepted first before the strings of FA1Palindromes
 152There ______ a language for which only FA can be built but not the RE.Be may
 153Kleene’s Theorem part I expresses the relationship between ___FA and TG  
 154We can create an equivalent ___ for a language for which we create an ___NFA, FA  

As you know virtual university taking midterm or grand quiz exams. Students are searching past grand quiz files of their subjects. Here we provide you vu grand quiz 2021 files. Easy to Download your midterm papers according to your subject

JOIN OUR WHATSAPP GROUP

Download link of CS402 Grand Quiz Solved File

We are here to provide Latest Virtual University assignment  Solutions, GDB Solutions, Quiz Solution, Midterm Past Papers, and Final term Past Papers in this website.

1 thought on “CS402 Solved Grand Quiz Spring 2021”

Leave a Comment