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 |
Formal’ In Formal Languages Means
|
The Symbols Used Have Well Defined Meaning
|
They Are Unnecessary In Reality
|
Only The Form Of The String Of Symbols Is Significant
|
None Of These
|
A |
| CS402 |
------------------- Is Obviously Infinite Language
|
Equal-Equal
|
Even-Even
|
Palindrome
|
Factorial
|
C |
| CS402 |
(A + B)* A Is Re For The Language Defined Over S={A B} Having Words Not Ending In B
|
True
|
False
|
Such A Language Is Not Regular
|
None Of The Given Options
|
A |
| CS402 |
(A + B)*B Is Re For The Language Defined Over S={A B} Having Words Not Ending In A
|
True
|
False
|
Such A Language Is Not Regular
|
None Of These
|
A |
| CS402 |
(A* + B*)* = (A + B)* This Expression Is __________
|
True
|
False
|
Na
|
Na
|
B |
| CS402 |
(A* + B*)* = (A + B)* This Expression Is __________
|
True
|
False
|
Na
|
Na
|
B |
| CS402 |
(A+B)*A(A+B)*B(A+B)* Is The Re Of Language Defined Over ={A B} Having At Least One A And One B
|
True
|
False
|
Such A Language Does Not Exist
|
None Of These
|
A |
| CS402 |
(A+B)*A(A+B)*B(A+B)* Is The Re Of Language Defined Over S={A B} Having At Least One A And One B
|
True
|
False
|
Such A Language Does Not Exist
|
None Of The Given Options
|
A |
| CS402 |
__________ States Are Called The Halt States
|
Accept And Reject
|
Accept And Read
|
Accept And Start
|
Accept And Write
|
A |
| CS402 |
__________Is A Place Where The Input Letters Can Be Placed Until These Letters Are Referred Again. It Can Store As Many Letters As One Can In A Long Column
|
Stack
|
Pop And Stack
|
Pushdown Stack
|
None Of These
|
C |
| CS402 |
“Every Finite Language Can Be Expressed By Fa”. This Statement Is __________
|
True
|
False
|
Depends On Language
|
None Of These
|
A |
| CS402 |
“Every Infinite Language Is Regular” This Statement Is
|
True
|
False
|
Na
|
Na
|
A |
| 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 Expressed By More Than One Nfa”. This Statement Is __________
|
True
|
False
|
Depends On Nfa
|
None Of The Given
|
A |
| CS402 |
= Language Of Words Containing Even Number Of A’S. Regular Expression Is
|
(A+B)*Aa(A+B)*
|
(B+Ab*A)*
|
A+Bb*Aab*A
|
(A+B)*Ab(A+B)*
|
B |
| CS402 |
A (A + B)* Is The Re Of Language Defined Over S = {A B} Having At Least One A
|
True
|
False
|
Such A Language Does Not Exist
|
None Of The Given Options
|
A |
| CS402 |
A ___________ Is The One For Which Every Input String Has A Unique Path Through The Machine
|
Deterministic Pda
|
Nondeterministic Pda
|
Pushdown Store
|
Input Tape
|
D |
| CS402 |
A Dfa With N States Must Accept At Least One String Of Length Greater Than N
|
True
|
False
|
Na
|
Na
|
|
| CS402 |
A Dfa With N States Must Accept At Least One String Of Length Greater Than N
|
True
|
False
|
Na
|
Na
|
A |
| CS402 |
A Operator Adds A New Letter At The Top Of Stack
|
Push
|
Pop
|
Read
|
Append
|
A |