CS101
532
CS201
225
CS301
232
CS302
174
CS304
192
CS401
224
CS402
258
CS403
228
CS408
113
CS411
121
CS502
249
CS504
268
CS601
679
CS604
381
CS605
261
CS607
184
CS609
230
CS610
300
CS614
100
CS703
65
| Code | Question | Option A | Option B | Option C | Option D | Answer | |
|---|---|---|---|---|---|---|---|
| CS402 | Bottem Up Parsing Can Be Determined Similar To That Of Top Down Parsing With The Change That In This Case The Process Is Started With The Given String And The Tree Is Extended Till “S “Is | Regular | Non Regular | Obtain | Finite | C | |
| CS402 | Can A Turing Machines Head Ever Be In The Same Location In Two Successive Steps? | True | False | True But Only In Finite Languages | True But Only In Infinite Langauges | B | |
| CS402 | Cfg Is Said To Be A Regular Grammar If It Generates The Regular Language I.E.A Cfg Is Said To Be A Regular Grammar In Which Each Production Is One Of The: | Three Forms | One Form | Four Forms | Two Forms | D | |
| CS402 | Cfg Stands For ___________ | Context Free Graph | Context Free Grammar | Context Finite Graph | Context Finite Grammar | B | |
| CS402 | Choose The Correct Statement | A Mealy Machine Generates No Language As Such | A Moore Machine Generates No Language As Such | A Mealy Machine Has No Terminal State | All Of These | C | |
| CS402 | Choose The Correct Statement | A Mealy Machine Generates No Language As Such | A Moore Machine Generates No Language As Such | A Mealy Machine Has No Terminal State | All Of These | C | |
| 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 | Choose The Incorrect Statement | (A+B)*Aa(A+B)* Generates Regular Language | A Language Consisting Of All Strings Over ?={A B} Having Equal Number Of A’S And B’S Is A Regular Language | Every Language That Can Be Expressed By Fa Can Also Be Expressed By Re | None Of These | D | |
| 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 | |
| CS402 | Consider A Language L Defined Over An Alphabet ? If Two Strings X And Y Defined Over ? Are Run Over An Fa Accepting The Language L Then X And Y Are Said To Belong To The Same ___________ If They End In The Same ___________ | Class State | Final Infinite | Regular Nonregular | All Of Above | A | |
| CS402 | Consider The Following Cfg: (Note: ^ Means Null) S->A|Xb|Aya X->Y|^ Y->B|X Which Nonterminal(S) Is/Are Not Nullable | S | X | Y | S X And Y | B | |
| CS402 | Consider The Following Cfg: S?As|Bs|Aas|? Can Be Observed That The Word Aaa Can Be Derived From More Than | One Production Tree | Two Producton Tree | Total Language Tree | All Of Above | A | |
| CS402 | Consider The Following Gfc : S?Aa|Bb A?Aa|B B?As|? Here S?Aaand A?B Are Null Productions While B?? Is Null Able Production | True | False | Na | Na | B | |
| CS402 | Consider The Language L Of Strings Defined Over S = {A B} Ending In A | There Are Finite Many Classes Generated By L So L Is Regular | There Are Infinite Many Classes Generated By L So L Is Regular | There Are Finite Many Classes Generated By L So L Is Non-Regular | There Are Infinite Many Classes Generated By L So L Is Non-Regular | B | |
| CS402 | Considering Fa1 And Fa2 Having 2 States Each. Now Fa1+Fa2 Can Have Maximum __________ Number Of States | 2 | 3 | More Than 3 | None Of Them | D | |
| 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 | Converting The Given Cfg In Cnf Is The First Rule Of | Cyk Algorithm | Cky Algorithm | Kyc Algorithm | Cnk Algorithm | A | |
| CS402 | Does The Empty String Match The Regular Expression |Y+A|? | True | False | Some Times True & Sometimes False | None Of Given | B | |
| CS402 | 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 | D | |
| CS402 | Every Fa Should Be __________ | Deterministic | Non- Deterministic | Deterministic & Non- Deterministic | None Of These | A |