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 |
Gtg Can Have __________ Final State
|
0
|
1
|
More Than 1
|
All Of The Given
|
D |
| CS402 |
Gtg Can Have __________ Initial State
|
Zero
|
One
|
More Than One
|
One Or More Than One
|
D |
| CS402 |
He Symbols That Can’T Be Replaced By Anything Are Called__________
|
Productions
|
Terminals
|
Non-Terminals
|
All Of Above
|
B |
| CS402 |
Identify The True Statement
|
A Pda Is Non-Deterministic If There Are More Than One Read States In Pda
|
A Pda Is Never Non-Deterministic
|
Like Tg A Pda Can Also Be Non-Deterministic
|
A Pda Is Non-Deterministic If There Are More Than One Reject States In Pda
|
C |
| CS402 |
If A Cfg Has Only Productions Of The Form Nonterminal -> String Of Two Nonterminals Or Nonterminal -> One Terminal Then The Cfg Is Said To Be In ___________
|
Pda Form
|
Chomsky Normal Form (Cnf)
|
Null Able Form
|
Unit Production Form
|
B |
| CS402 |
If A Language Can Be Expressed By A Regular Expression Then Its Complement Cannot Be Expressed By A Regular Expression. This Statement Is
|
True
|
False
|
Depends On Language
|
None Of The Given Optios
|
B |
| CS402 |
If A Language Can Be Expressed Through Fa Then It Can Also Be Expressed Through Tg
|
True
|
False
|
Depends On Language
|
None Of The Above
|
A |
| CS402 |
If A Language Is Expressed Through Tg Then That Language Will Have Its Re
|
True
|
False
|
Depends On Language
|
None Of These
|
A |
| CS402 |
If An Alphabet Has N Number Of Letter Then Number Of Strings Of Length M Will Be
|
N+M
|
(N)(M)
|
M^N
|
N^M
|
D |
| CS402 |
If An Effectively Solvable Problem Has Answer In Yes Or No Then This Solution Is Called
|
Decision Procedure
|
Decidable Problem
|
Solved Able Problem
|
All Of Above
|
A |
| CS402 |
If An Effectively Solvable Problem Has Answered In Yes Or No Then This Solution Is Called __________
|
Decision Problem
|
Decision Method
|
Decision Procedure
|
Decision Making
|
C |
| CS402 |
If An Fa Has N State Then It Must Accept The Word Of Length
|
N2
|
N-1
|
N+1
|
All Of Above
|
C |
| CS402 |
If Every Production In Cfg Is One Of The Following Forms. Conterminal ? Semi Word Nonterminal?Word Then The Language Generated By That Gfc Is
|
Regular
|
Nonregular
|
Finite
|
Infinite
|
A |
| CS402 |
If F Accept An ………….. Language Then There Are Some Words W.S.T N= Length (W) <2N
|
Regular
|
Finite
|
Infinite
|
None Of Given
|
C |
| CS402 |
If Fa1 Accepts No String And Fa2 Accepts Many Strings Then Fa1 + Fa2 Will Be Equal To
|
Fa1
|
Fa2
|
May Be Both
|
None Of The Given
|
B |
| CS402 |
If In An Nfa ^ Is Allowed To Be A Label Of An Edge Then That Nfa Is Called ___________
|
Will Not Remain Nfa
|
Nfa With
|
Nfa With Null String
|
Either Nfa With Null String Or Nfa With
|
C |
| CS402 |
If L Is A Regular Language Then --------- Is Also A Regular Language
|
Lm
|
Ls
|
Lx
|
Lc
|
D |
| CS402 |
If L Is A Regular Language Then According To Kleene Theorem There Exists An
|
Tg
|
Gtg
|
Fa
|
Non Of The Given
|
C |
| CS402 |
If L Is A Regular Language Then Lc Is Also A Language
|
Regular
|
Non-Regular
|
Regular But Finite
|
None Of The Given
|
A |
| CS402 |
If L1 And L2 Are Expressed By Regular Expressions R1 And R2 Respectively Then The Language Expressed By R1 + R2 Will Be ___________
|
Regular
|
Ir-Regular
|
Can’T Be Decided
|
Another Language Which Is Not Listed Here
|
A |