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 | Let S = {Aa Bb} Be A Set Of Strings Then S* Will Have | ? | Abba | Aabbbaa | Bbaab | A | |
| CS402 | Like Tg A Pda Can Also Be Non-Deterministic | True | False | Na | Na | B | |
| CS402 | Myhill Nerode Theorem Is Consisting Of The Followings | L Partitions S* Into Distinct Classes | If L Is Regular Then L Generates Finite Number Of Classesif L Is Regular Then L Generates Finite Number Of Classes | If L Generates Finite Number Of Classes Then L Is Regular | All Of Above | D | |
| 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 | No164: If R1 = (Aa + Bb) And R2 = ( A + B) Then The Language (A + B)* (Aa + Bb)* Will Be Generated By | (R2)(R1) | (R1 + R2)* | (R2)*(R1)* | (R1)* | D | |
| CS402 | 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 | C | |
| CS402 | One Fa Has N States And M Letters In The Alphabet. Then Fa Will Have Number Of Transitions In The Diagram | (N)+(M) | (M)-(N) | (M)(N) Or (N)(M) | None Of The Given Options | C | |
| CS402 | One Language Can Be Expressed By More Than One Fa”. This Statement Is | True | False | Some Times True & Sometimes False | None 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 | One Language Can Have ___________ Cfg(S) | At Least One | At Least Two | At Least Three | None Of Them | A | |
| CS402 | One Language Can Represents More Than One Re | True | Falss | Can’T Be Assumed | Non Of Given | A | |
| CS402 | Palindrome Can Be Defined By More Than One Regular Language | True | False | By Only One Re | Some Times By Only One Re And Some Times False | B | |
| CS402 | Pda Stands For __________ | Push And Drop Automaton | Pop And Drop Automaton | Push Down Automaton | None Of Given Options | C | |
| CS402 | Pumping Lemma Is Generally Used To Prove That | A Given Language Is Infinite | A Given Language Is Not Regular | Whether Two Given Regular Expressions Of A Regular Language Are Equivalent Or Not | None Of These | B | |
| CS402 | Re For The Language Defined Over S={A B} Having Words Starting With A Is__________ | A(A+B)* | (A+B)*A | (A+B)* | None Of These | A | |
| CS402 | S ? Axb|Bxa X ? Ax|Bx|? The Given Cfg Generates The Language Of Strings In English __________ | Beginning And Ending In Different Letters | Beginning And Ending In Same Letter | Having Even-Even Language | None Of Given | A | |
| CS402 | S = {A B} Productions S?Xaax X?Ax X?Bx X??. This Grammar Defines The Language Expressed By__________ | (A+B)*Aa(A+B)* | (A+B)*A(A+B)*A | (A+B)*Aa(A+B)*Aa | (A+B)*Aba+B)* | A | |
| CS402 | S = {Baa Ab} Then S* Will Not Contain | Abbaab | Abab | Baabaa | Abbaa | A | |
| CS402 | S= {A Bc Cc} Has The Latters | 1 | 2 | 3 | 4 | C | |
| CS402 | S={A Aa Abb} Then String Aaaabbaa Has __________ Length | 1 | 2 | 3 | 4 | D |