Online Exam Preparation
MCQs Library
Browse subject-wise multiple choice questions, review answers quickly, and start a test from the same section.
Questions
| Code | Question | Option A | Option B | Option C | Option D | Answer |
|---|---|---|---|---|---|---|
| CS402 |
S={A Bb Bab Baabb} Set Of Strings Then S* Will Not Have
|
Baba
|
Baabbab
|
Bbaaabb
|
Bbbaabaabb
|
A |
| CS402 |
Set Of All Palindromes Over {A B}Is Regular
|
True
|
False
|
Na
|
Na
|
B |
| CS402 |
Symbols That Can’T Be Replaced By Anything Are Called__________
|
Terminal
|
Non-Terminal
|
Production
|
All Of Given
|
A |
| CS402 |
Tg Can Have More Than One Initial State
|
True
|
False
|
Depends On Alphabets
|
None Of These
|
A |
| CS402 |
Tg Can More Then One Initial State
|
True
|
False
|
Depend On Alphabets
|
None Of Given
|
A |
| CS402 |
Tg Is Always Deterministic
|
True
|
False
|
Na
|
Na
|
B |
| CS402 |
The __________ Is Said To Be Ambiguous If There Exist At Least One Word Of Its Language That Can Be Generated By The Different Production Tree
|
Cfl
|
Cfg
|
Gtg
|
None Of The Given
|
B |
| CS402 |
The Cfg Is Said To Be Ambiguous If There Exist At Least One Word Of Its Language That Can Be Generated By The __________
|
One
|
Two
|
More Than One
|
At Most One
|
C |
| CS402 |
The Cfg Is Said To Be Ambiguous If There Exist At Least One Word Of Its Language That Can Be Generated By The ………… Production Trees
|
One
|
Two
|
More Than One
|
At Most One
|
C |
| CS402 |
The Cfg Is Said To Be Ambiguous If There Exists Atleast One Word Of Its Language That Can Be Generated By The Different Production Trees
|
True
|
False
|
Depends On The Language
|
None Of The Given Options
|
A |
| CS402 |
The Clouser Fa*(Star On An Fa ) Always Accept String
|
Null
|
Aa
|
Bb
|
None Of Given
|
A |
| CS402 |
The Complement Of A Regular Language Is Also A Regular
|
True
|
False
|
Na
|
Na
|
A |
| CS402 |
The Current In The Wire Is Indicated By 1 And 0 Indicates The Absence Of The Current
|
True
|
False
|
Na
|
Na
|
A |
| CS402 |
The Deviation Of The Word W Generated By A Cfg Such That At Each Step A Production Is Applied To The Left Most Nonterminal In The Working String Is Said To Be
|
Left Most Terminal
|
Left Most Deviation
|
None Of These
|
A B Both
|
B |
| CS402 |
The Following Problem(S) ------------- Is/Are Called Decidable Problem(S)
|
The Two Regular Expressions Define The Same Language
|
The Two Fas Are Equivalent
|
Both A And B
|
None Of Given
|
C |
| CS402 |
The Grammatical Rules Are Often Called__________
|
Productions
|
Terminals
|
Non-Terminals
|
None Of Given
|
A |
| CS402 |
The High Level Language Is Converted Into Assembly Language Codes By A Program Called
Compiler
|
True
|
False
|
Na
|
Na
|
A |
| CS402 |
The Input String Is Placed Before It Runs In
|
Stack
|
Memory
|
Tape
|
Ram
|
C |
| CS402 |
The Language Generated By __________ Is Called Context Free Language (Cfl).
|
Fa
|
Tg
|
Cfg
|
Tgt
|
C |
| CS402 |
The Language Generated By That Cfg Is Regular If ___________
|
No Terminal ? Semi Word
|
No Terminal ? Word
|
Both A And B
|
None Of Given
|
C |