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 | The Production S --> Ss | A | B | ^ Can Be Expressed By Re | (A+B)+ | A-B | (A-B)+ | None Of Them | A | |
CS402 | The Regular Expression Defining The Language L1 U L2 Can Be Obtained Converting And Reducing The Previous ---------- Into A ------------ As After Eliminating States | Gtg Tg | Fa Gtg | Fa Tg | Tg Re | B | |
CS402 | The Regular Expression Thus Obtained If Contains At Least One Word Then The Language Is Not Empty Otherwise The Language Is__________ | Regular | No Regular | Empty | Non Of The Above | C | |
CS402 | The Reverse Of The String Sbfsbb Over { Sb F B} | (Bsbfsb) | Bfsbs | Sbbfsb | Bbfsb | A | |
CS402 | The Same Non Terminals Can Be Written In Single Line If They Have More Than One __________ | Productions | Regular Production | None Regular Production | None Of Them | A | |
CS402 | The States In Which There Is No Way To Leave After Entry Are Called | Davey John Lockers | Dead States | Waste Baskets | All Of The Given Options | D | |
CS402 | The States In Which There Is No Way To Leave After Entry Are Called | Davey John Lockers | Dead States | Waste Baskets | All Of The Given Options | D | |
CS402 | The Structure Given Below Is Called ___________ S -> Aa|Bb A -> As|A B -> Bs|B | Re | Tg | Cfg | Pda | C | |
CS402 | The Symbols That Must Be Replaced By Other Things Are Called __________ | Productions | Terminals | Non-Terminals | None Of Given | 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 | The Two Fas Are | Same | Equivalent | Different | None Of Them | B | |
CS402 | The Two Regular Expressions Define The | Same Language | The Two Fas Are Equivalent | Both A And B | None Of Given | C | |
CS402 | The Unit Production Is | Terminal --> Terminal | Terminal --> Non Terminal | Non Terminal --> Terminal | Non Terminal --> Non Terminal | B | |
CS402 | The Values Of Input (Say A & B) Does Not Remain Same In One Cycle Due To | Tape | Halt | Clock Pulse | Start | C | |
CS402 | The Word ‘Formal’ In Formal Languages Means | They Are Unnecessary In Reality | Only The Form Of The String Of Symbols Is Significant | The Symbols Used Have Well Defined Meaning | None Of These | C | |
CS402 | Then The Language Generated By That Cfg Is | Non Regular | Infinite | Regular | Finite | C | |
CS402 | There Is An Approach In Defining The Quotient Of Regular Languages Ie The Language Q Is Said To Be Quotient Of Two Regular Languages P And R Denoted By Q=R/P If | Pq=R | R=Pq | Qr=P | Non Of Above | A | |
CS402 | There Is At Least One Production That Has One __________ On Its Left Side | Terminal | Infinite | None Terminal | All Of Above | C | |
CS402 | Tm Is More Powerful Than Fsm Because | The Tape Movement Is Confined To One Direction | It Has No Finite State Control | It Has The Capability To Remember Arbitrary Long Sequences Of Input Symbols | None Of These | B | |
CS402 | Tm Is More Powerful Than Fsm Because | The Tape Movement Is Confined To One Direction | It Has No Finite State Control | It Has The Capability To Remember Arbitrary Long Sequences Of Input Symbols | None Of These | B |