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 | If L1 And L2 Are Expressed By Regular Expressions R1 And R2 Respectively Then The Language Expressed By R1 + R2 Will Be ___________ | Ir-Regular | Can’T Be Decided | Regular Language | Another Language Which Is Not Listed Here | C | |
| CS402 | If L1 And L2 Are Regular Languages Is/Are Also Regular Language(S) | L1 + L2 | L1L2 | L1* | All Of Above | D | |
| CS402 | If L1 And L2 Are Regular Languages Is/Are Also Regular Language(S) | L1 + L2 | L1L2 | L1* | All Of Above | D | |
| CS402 | If L1 And L2 Are Regular Languages Then Which Statement Is Not True? | (L1/L2 Is Always Regular) | L1+L2 Are Always Regular | L1*L2 Are Always Regular | None Of Them | A | |
| CS402 | If L1 And L2 Are Two Regular Languages Then L1 U L2 Is Not A Regular | True | False | Na | Na | B | |
| CS402 | If L1 And L2 Are Two Regular Languages Then L1nL2 Is Also | Regular | None Regular | Finite | None Infinite | A | |
| CS402 | If R Is A Regular Language And L Is Some Language And L U R Is A Regular Language Then L Must Be A Regular Language | True | False | Na | Na | A | |
| CS402 | If R Is Regular Language And Q Is Any Language (Regular/ Non Regular) Then Pref (Q In R) Is __________ | Non-Regular | Equal | Regular | Infinite | C | |
| CS402 | If R1 = (Aa + Bb) And R2 = ( A + B) Then The Language (Aa + Bb)* Will Be Generated By | (R1)(R2) | (R1 + R2) | (R2)* | (R1)* | B | |
| CS402 | If R1 And R2 Are Regular Expressions Then Which Of The Following Is Not Regular Expression | R1 = R2 | R1R2 | R1* | R1 – R2 | D | |
| CS402 | If S = {Aa Bb} Then S* Will Not Contain | Aabbaa | Bbaabbbb | Aaabbb | Aabbbb | C | |
| CS402 | If S = {Ab Bb} Then S* Will Not Contain | Abbbab | Bbba | Ababbb | Bbbbab | B | |
| CS402 | If The Intersection Of Two Regular Languages Is Regular Then The Complement Of The Intersection Of These Two Languages Is Also Regular: | True | False | Na | Na | A | |
| CS402 | If Two Languages R And Q Are Given Then The Prefixes Of Q In R Denoted By Pref(Q In R) | True | False | Na | Na | A | |
| CS402 | If Two Strings X And Y Defined Over S Are Run Over An Fa Accepting The Language L Then X And Y Are Said To Belong To The Same Class If They End In The Same State No Matter That State Is Final Or Not | True | False | Na | Na | A | |
| CS402 | If W Is Large Enough Word In A Cf Then W Can Be Decomposed Into W =Uvwxyz Such That All Words Of The Form Uvn Xynz Belong To | Cnf | L | Cfl | Cfg | B | |
| 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 | In A Stack | The Element Pushed First Is Poped First | The Element Pushed First Is Poped In The Last | The Element Pushed In Last Is Poped In Last | None Of Given Options | B | |
| CS402 | In Cfg The Symbols That Can’T Be Replaced By Anything Are Called__________ | Terminal | Non-Terminal | Production | All Of Given | C | |
| CS402 | In Cfg The Symbols That Cannot Be Replaced By Anything Are Called __________ | None Terminals | Infinite | Finite | Terminals | D |