CS402 LIVE IMPORTANT MIDTERM MCQ’s 2023 December 26, 2022 by Dilawar 172 THANKS FOR ATTEMPTING THE QUIZ Created on December 26, 2022 By Dilawar cs402 midterm important quiz 2023 1 / 21 Σ={a,Aa,Abb}, then string aAaAbbAa has ________ length one two three four 2 / 21 Languages generated by kleene star are always ______________. Finite Infinite Sometimes finite & sometimes infinite None of the these 3 / 21 Let S = {aa, bb} be a set of strings then s* will have Λ abba aabbbaa bbaab 4 / 21 If r1 = (aa + bb) and r2 = ( a + b) then the language (aa + bb)* will be generated by (r1)(r2) (r1 + r2) (r2)* (r1)* 5 / 21 If a language can be expressed through FA, then it can also be expressed through TG. True False Depends on language None of the above 6 / 21 GTG can have _______________ final state. Also Read: CS402 IMPORTANT MCQ'S FINAL TERM 23/24 0 1 more than 1 All of the given 7 / 21 In GTG, if a state has more than one incoming transitions from a state. Then all those incoming transitions can be reduced to one transition using _____________ sign - + * None of the given 8 / 21 “One language can be expressed by more than one NFA”. This statement is ______________. False True Depends on NFA None of the given 9 / 21 One FA has 3 states and 2 letters in the alphabet. Then FA will have ___________ number of transitions in the diagram 4 5 6 7 10 / 21 If an alphabet has n number of letter, then number of strings of length m will be n+m (n)(m) m^n n^m 11 / 21 Languages generated by kleene star are always ______________. Also Read: CS402 FINAL TERM PAPERS + LIVE MCQ'S Finite Infinite Sometimes finite & sometimes infinite None of the these 12 / 21 e one a*b* = (ab)* this expression is __________ True FALSE Can’t be assumed None of these 13 / 21 If a language is expressed through TG, then that language will have its RE. True False Depends on language None of these 14 / 21 S= {a,bc,cc} has the latters 1 2 3 4 15 / 21 One language can represents more than one RE. True False Can’t be assumed Non of given 16 / 21 The clouser FA*(star on an FA ) always accept ______string Null aa bb None of given 17 / 21 In FA final state represent by _________sign + - * = 18 / 21 In FA one enter in specific stat but there is no way to leave it then state is called Also Read: BIO731 Final Term Past Paper 2022 Dead States Waste Baskets Davey John Lockers All of above 19 / 21 Length of strings, generated by infinite language is_______ Finite infinite none of these 20 / 21 RE for the language defined over Σ={a,b} having words starting with a is____ a(a+b)* (a+b)*a (a+b)* None of these 21 / 21 The length of output string in case of _________ is one more than the length of corresponding input string. Finite Automaton TG GTG Your score is The average score is 67% LinkedIn Facebook Twitter VKontakte 0% Restart quiz Related
