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 |
Every Regular Expression Can Be Expressed As Cfg But Every Cfg Cannot Be Expressed As A Regular Expression. This Statement Is:
|
True
|
False
|
Depends On The Language
|
None Of The Given Options
|
A |
| CS402 |
Examin The Following Cfg And Select The Correct Choice:
S? Ab A ?Bsb B? Cc C? Ss A? A|B C? B|Bb
|
Abb Is A Word In The Corresponding Cfl
|
Abb Is Not The Word Of Corresponding Cfl
|
Any Word Can Be Accept From The Corresponding Cfl
|
Non Of These
|
A |
| CS402 |
Fa Corresponding To An Nfa Can Be Built By Introducing A State Corresponding To The Combination Of States For A Letter Having Choices
|
No Transition At Certain State
|
One Transition At Certain State
|
More Than One Transitions At Certain State
|
None Of The Given Options
|
C |
| CS402 |
Fa1 And Fa2 Are Two Fa’S Representing Two Languages. Then Fa3 Which Is Sum Of Fa1 And Fa2 Will Accept The Strings Which Are
|
Accepted By Fa1 And Fa2
|
Accepted By Fa1 Or Fa2
|
Accepted By Fa1 And/Or Fa2
|
None Of The Given Options
|
C |
| CS402 |
Fa1 Corresponds To R* Then Fa1 Must Accept __________ String
|
Every
|
Null
|
Odd Length
|
Even Length
|
A |
| CS402 |
Fa3 Expresses R1R2. Then Initial State Of Fa3 Will Consist Of
|
Initial State Of Fa2
|
Initial State Of Fa1
|
Initial States Of Both Fa1 & Fa2
|
Depends On Fa’S
|
B |
| CS402 |
Fa3 Expresses R1R2. Then There Will Be At Least One Final State Of Fa3 That Consist Of Final State Of Fa1 And Initial State Of Fa2
|
True
|
False
|
Depends On Language
|
None Of These
|
B |
| CS402 |
Following Is Not A Regular Language?
|
String Of 0’S Whose Length Is A Perfect Squere
|
Set Of All Palindromes Made Up Of 0’S And 1’S
|
String Of 0’S Whose Length Is A Prime Number
|
All Of The Given Options
|
D |
| CS402 |
For A Certain Language L The Complement Of Lc Is The Given Language L I.E. (L^C)^C = L
|
True
|
False
|
Na
|
Na
|
T |
| CS402 |
For A Given Input It Provides The Compliment Of Boolean And Output
|
Nand Box
|
Delay Box
|
Or Box
|
And Box
|
A |
| CS402 |
For A Non Regular Language There Exist __________ Fa
|
True
|
False
|
Na
|
Na
|
B |
| CS402 |
For Every Three Regular Expressions R S And T The Languages Denoted By R(S U T) And (Rs) U (Rt) Are The Same
|
True
|
False
|
Na
|
Na
|
A |
| CS402 |
For Fa Corresponding To (L1nL2C)U (L1CnL2) The Regular Expression Ca Be Determined That Defines The Language Accepted By This
|
Tg
|
Gfc
|
Fa
|
Gtg
|
C |
| CS402 |
For Language L Defined Over {A B} Then L Partitions {A B}* Into …… Classes
|
Infinite
|
Finite
|
Distinct
|
Non-Distinct
|
C |
| CS402 |
For The Given Input And Box Provides The Boolean And Output
|
True
|
False
|
Na
|
Na
|
A |
| CS402 |
For The Given Input It Provides The Boolean Or Output
|
Delay Box
|
And Box
|
Nand Box
|
Or Box
|
D |
| CS402 |
Formal Is Also Known As ___________
|
Syntactic Language
|
Semantic Language
|
Informal Language
|
None Of These
|
A |
| CS402 |
Grammatical Rules Which Do Not Involve The Meaning Of Words Are Called __________
|
Semantics
|
Syntactic
|
Both A And B
|
None Of Given
|
B |
| CS402 |
Grammatical Rules Which Involve The Meaning Of Words Are Called __________
|
Semantics
|
Syntactic
|
Both A And B
|
None Of Given
|
A |
| CS402 |
Gtg Can Have __________ Final State
|
0
|
1
|
More Than 1
|
All Of The Given
|
D |