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 | A Production In Cfg Consists Of | One Terminal | More Than One Terminal | One Non-Terminal | Terminals And Non-Terminals | D | |
| CS402 | A Production Is Called Null Able Production If It Is Of The Form N ? ? | True | False | Na | Na | A | |
| CS402 | A Program Which Is The Set Of Rules Which Show That Which State Is To Be Entered When A Letter Is Read Form The | Tape | Halt | Tm | None Of Above | A | |
| CS402 | A Regular Language | Must Be Finite | Must Be Infinite | Can Be Finite Or Infinite | Must Be Finite And Cannot Be Infinite | A | |
| CS402 | A(A+B)*A+B(A+B)*B Is Re For The Language Defined Over S={A B} Having Words Beginning And Ending With Same Letters | True | False | Such A Language Is Not Regular | None Of These | A | |
| CS402 | A*B* = (Ab)* This Expression Is ___________ | True | False | Can’T Be Assumed | None Of These | B | |
| CS402 | A^N B^N Generates The __________ Language | Non Regular Languages | Regular Language | Infinite Language | Finite Language | A | |
| CS402 | Above Given Fa Accepts The Language In Which Strings | Begins With And Ends In Same Letter | Begins With And Ends In Different Letter | Has Length More Than 2 | None Of The Given | A | |
| CS402 | According To 3Rd Part Of The Kleene’S Theorem If A Language Can Be Accepted By An Re Then It Can Be Accepted By A ___________ As Well | Tg | Fa | G And Fa | None Of These | C | |
| CS402 | According To Mayhill Nerode Theorem If L Generates Finite No. Of Classes Then L Is __________ | Regular | Nonregular | Infinite | Infinite | A | |
| CS402 | According To Theory Of Automata There | 1 | 2 | 3 | 4 | B | |
| CS402 | According To Theory Of Automata There Are ___________ Types Of Languages | 1 | 2 | 3 | 4 | B | |
| CS402 | All Nonnull Words Of The Cfl Can Be Generated By The Corresponding Cfg Which Is In Cnf I.E The Grammar In Cnf Will Generate The Same Language Except The | String | Regular Language | Null String | Non Of Above | C | |
| CS402 | An Fa Has Same Initial And Final State Then It Means That It Has No Final State | True | False | Na | Na | B | |
| CS402 | And R2 = ( A + B) Then The Language (Aa + Bb)(A + B) Will Be Generated By | (R1 + R2) | (R2)(R1) | (R1)* | (R1)(R2) | A | |
| CS402 | Any Language That Can Not Be Expressed By A Re Is Said To Be Regular Language | True | False | Na | Na | B | |
| CS402 | Any Word Generated By Given Cfg Cannot Also Be Expressed By Syntax Tree Or Generation Tree Or Derivation Tree As Well | True | False | Na | Na | B | |
| CS402 | Before The Cfg Corresponding To The Given Pda Is Determined The Pda Is Converted In To The Standard Form Which Is Called The | Standard Form | Conversion Form | Left Most Derivation | None Of Them | B | |
| CS402 | Between The Two Consecutive Joints On A Path | One Character Can Be Pushed And One Character Can Be Popped | Any No. Of Characters Can Be Pushed And One Character Can Be Popped | One Character Can Be Pushed And Any No. Of Characters Can Be Popped | Any No. Of Characters Can Be Pushed And Any No. Of Characters Can Be Popped | B | |
| CS402 | Between The Two Consecutive Joints On A Path | One Character Can Be Pushed And One Character Can Be Popped | Any No. Of Characters Can Be Pushed And One Character Can Be Popped | One Character Can Be Pushed And Any No. Of Characters Can Be Popped | Any No. Of Characters Can Be Pushed And Any No. Of Characters Can Be Popped | B |