Code Question Option A Option B Option C Option D Answer
CS402 Choose The Incorrect (False) Statement A Mealy Machine Generates No Language As Such A Mealy Machine Has No Terminal State For A Given Input String Length Of The Output String Generated By A Moore Machine Is Not More Than The Length Of The Output String Generated By That Of A Mealy Machine All Of These C
CS402 The Terminals Are Designated By __________ Letters While The Non-Terminals Are Designated By __________ Letters Capital Bold Small Capital Capital Small Small Bold B
CS402 Tg Can Have More Than One Initial State True False Depends On Alphabets None Of These A
CS402 Let L Be A Language Defined Over An Alphabet ? Then The Language Of Strings Defined Over ? Not Belonging To L Denoted By Lc Or L. Is Called Non Regular Language Of L Complement Of The Language L Non Of The Given All Of Above B
CS402 If An Effectively Solvable Problem Has Answer In Yes Or No Then This Solution Is Called Decision Procedure Decidable Problem Solved Able Problem All Of Above A
CS402 A ___________ Is The One For Which Every Input String Has A Unique Path Through The Machine Deterministic Pda Nondeterministic Pda Pushdown Store Input Tape D
CS402 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 C
CS402 The High Level Language Is Converted Into Assembly Language Codes By A Program Called Compiler True False Na Na A
CS402 If S = {Aa Bb} Then S* Will Not Contain Aabbaa Bbaabbbb Aaabbb Aabbbb C
CS402 Converting Each Of The Final States Of F To Non-Final States And Old Non-Final States Of F To Final States Fa Thus Obtained Will Reject Every String Belonging To L And Will Accept Every String Defined Over S Not Belonging To L. Is Called Complement Of L Finite Automata Of L Transition Graph Of L Regular Expression Of L A
CS402 In Fa If One Enters In A Specific State But There Is No Way To Leave It Then That Specific State Is Called __________ Dead State Waste Basket Davey John Locker All Of These A
CS402 One Language Can Be Represented By More Than One Re” This Statement Is__________ True False Can’T Be Assumed None Of These A
CS402 Which Statement Is True? The Pda Must Have One Accept State And One Reject State The Pda Must Have One Accept State And Two Reject State The Pda Must Have Two Accept State And Two Reject State There Is No Reject State In The Pda D
CS402 In A Cfg The Nonterminal That Occurs First From The Left In The Working String Is Least Significant Nonterminal Most Significant Nonterminal Left Most Nonterminal Left Most Derivate C
CS402 The Production S --> Ss | A | B | ^ Can Be Expressed By Re (A+B)+ A-B (A-B)+ None Of Them A
CS402 No154: For Language L Defined Over {A B} Then L Partitions {A B}* Into …… Classes Distinct Accept Unit Production None Of The Above A
CS402 If S = {Ab Bb} Then S* Will Not Contain Abbbab Bbba Ababbb Bbbbab B
CS402 A^N B^N Generates The __________ Language Non Regular Languages Regular Language Infinite Language Finite Language A
CS402 For Language L Defined Over {A B} Then L Partitions {A B}* Into …… Classes Infinite Finite Distinct Non-Distinct C
CS402 Closure Of An Fa Is Same As __________ Of An Fa With Itself Except That The Initial State Of The Required Fa Is A Final State As Well Union Sum Concatenation Intersection C