CS402 Theory of Automata solve MCQs 2011

[Vuhelper]

View more random threads:

• mgt503 mid term solve paper 2011
• MGT502 Organizational Behavior mid term solve paper april...
• It430 solved paper of fall 2010 on 19-02-2011 from...
• cs101 final term subjective paper fall 2011 January 2012
• mgmt630 mid term solve paper spring 2011
• ECO402 final term solve paper January 2012 Virtual...
• mth302 solved midterm paper 2011
• DLD (CS302)SOLVED PAPERS fall 2010
• Solved Paper MGT501- Human Resource Management Spring 2009...
• Solved Paper Of MGMT611 Human Relations (alt. code=HRM611)...

for solve look in attachment

NEW Modified
CS402-Theory of Automata MCQs
1) For a given input, it provides the compliment of Boolean AND output.

NAND box (NOT AND)
DELAY box
OR box
AND box

2) It delays the transmission of signal along the wire by one step (clock pulse).

NAND box (NOT AND)
DELAY box
OR box
AND box

3) For the given input, it provides the Boolean OR output

NAND box (NOT AND)
DELAY box
OR box
AND box

4) For the given input, AND box provides the Boolean AND output.
True False

5) The current in the wire is indicated by 1 and 0 indicates the absence of the current.
True False

6) Any language that can not be expressed by a RE is said to be regular language.
True False

7) If L1 and L2 are regular languages is/are also regular language(s).

L1 + L2
L1L2
L1*
All of above

8) Let L be a language defined over an alphabet Σ, then the language of strings, defined over Σ, not belonging to L, is called Complement of the language L, denoted by Lc or L’.
True False

9) To describe the complement of a language, it is very important to describe the ----------- of that language over which the language is defined.

Alphabet
Regular Expression
String
Word

10) For a certain language L, the complement of Lc is the given language L i.e. (Lc)c = Lc
True False

11) If L is a regular language then, --------- is also a regular language.
Lm Ls Lx Lc

12) Converting each of the final states of F to non-final states and old non-final states of F to final states, FA thus obtained will reject every string belonging to L and will accept every string, defined over Σ, not belonging to L. is called

Transition Graph of L
Regular expression of L
Complement of L
Finite Automata of L

13) If L1 and L2 are two regular languages, then L1 U L2 is not a regular.
True False


14) De-Morgan's law for sets is expressed by,



CORRECT

15) If L1 and L2 are regular languages, then these can be expressed by the corresponding FAs.
True False

16) L= 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)*

17) 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

18) The language that can be expressed by any regular expression is called a Non regular language.
True False

19) The languages -------------- are the examples of non regular languages.

PALINDROME and PRIME
PALINDROME and EVEN-EVEN
EVEN-EVEN and PRIME
FACTORIAL and SQURE

20) Let L be any infinite regular language, defined over an alphabet Σ then there exist three strings x, y and z belonging to Σ* such that all the strings of the form for n=1,2,3, … are the words in L. called.

Complement of L
Pumping Lemma
Kleene’s theorem
None in given

(21) Languages are proved to be regular or non regular using pumping lemma.
True False

(22) ------------------- is obviously infinite language.
EQUAL-EQUAL
EVEN-EVEN
PALINDROME
FACTORIAL

(23) If, two strings x and y, defined over Σ, are run over an FA accepting the language L, then x and y are said to belong to the same class if they end in the same state, no matter that state is final or not.
True False

(24) Myhill Nerode theorem is consisting of the followings,

L partitions Σ* into distinct classes.
If L is regular then, L generates finite number of classes.
If L generates finite number of classes then L is regular.
All of above

(25) The language Q is said to be quotient of two regular languages P and R, denoted by--- if PQ=R.
R=Q/P Q=R/P Q=P/R P=R/Q



(26) If two languages R and Q are given, then the prefixes of Q in R denoted by Pref(Q in R).
True False

(27) Let Q = {aa, abaaabb, bbaaaaa, bbbbbbbbbb} and R = {b, bbbb, bbbaaa, bbbaaaaa} Pref (Q in R) is equal to,

{b,bbba,bbbaaa}
{b,bba,bbaaa}
{ab,bba,bbbaa}
{b,bba,bbba}

(27) If R is regular language and Q is any language (regular/ non regular), then Pref (Q in R) is ---------.

Non-regular
Equal
Regular
Infinite

(28) "CFG" stands for _________

Context Free Graph
Context Free Grammar
Context Finite Graph
Context Finite Grammar

(29) ___________ states are called the halt states.

ACCEPT and REJECT
ACCEPT and READ
ACCEPT AND START
ACCEPT AND WRITE

(30) The part of an FA, where the input string is placed before it is run, is called _______

State
Transition
Input Tape
Output Tape

(31) In new format of an FA (discussed in lecture 37), This state is like dead-end non final state

ACCEPT
REJECT
STATR
READ

(32) For language L defined over {a, b}, then L partitions {a, b}* into …… classes

Infinite
Finite
Distinct
Non-distinct

(33) The major problem in the earliest computers was

To store the contents in the registers
To display mathematical formulae
To load the contents from the registers
To calculate the mathematical formula

(34) Between the two consecutive joints on a path

One character can be pushed and one character can be popped
Any no. of characters can be pushed and one character can be popped
One character can be pushed and any no. of characters can be popped
Any no. of characters can be pushed and any no. of characters can be popped



(35) In pumping lemma theorem (x y^n z) the range of n is

n=1, 2, 3, 4……….
n=0, 1, 2, 3, 4……….
n=…….-3,-2,-1, 0, 1, 2, 3, 4……
n=…….-3,-2,-1, 1, 2, 3, 4……

(36) The PDA is called non-deterministic PDA when there are more than one out going edges from……… state

START or READ
POP or REJECT
READ or POP
PUSH or POP

(37) 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

(38) There is a problem in deciding whether a state of FA should be marked or not when the language Q is infinite.

True False

(39) If an effectively solvable problem has answered in yes or no, then this solution is called ---------

Decision procedure
Decision method
Decision problem
Decision making

(40) 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

(41) To examine whether a certain FA accepts any words, it is required to seek the paths from ------- state.

Final to initial
Final to final
Initial to final
Initial to initial

(42) The high level language is converted into assembly language codes by a program called compiler.

TRUE FALSE

(43) Grammatical rules which involve the meaning of words are called ---------------

Semantics
Syntactic
Both a and b
None of given

(44) Grammatical rules which do not involve the meaning of words are called ---------------

Sponsored Links

Semantics
Syntactic
Both a and b
None of given



(45) The symbols that can’t be replaced by anything are called -----------------
Productions
Terminals
Non-terminals
All of above

(46) The symbols that must be replaced by other things are called __________

Productions
Terminals
Non-terminals
None of given

(47) The grammatical rules are often called_____________

Productions
Terminals
Non-terminals
None of given

(47) The terminals are designated by ________ letters, while the non-terminals are designated by ________ letters.

Capital, bold
Small, capital
Capital, small
Small, bold

(48) The language generated by __________ is called Context Free Language (CFL).

FA TG CFG TGT

(49) Σ = {a,b} Productions S→XaaX X→aX X→bX X→Λ
This grammar defines the language expressed by___________

(a+b)*aa(a+b)*
(a+b)*a(a+b)*a
(a+b)*aa(a+b)*aa
(a+b)*aba+b)*

(50) S → aXb|b XaX → aX|bX|Λ The given CFG generates the language in English __________

Beginning and ending in different letters
Beginning and ending in same letter
Having even-even language
None of given

(51) The CFG is not said to be ambiguous if there exists atleast one word of its language that can be generated by the different production trees,

TRUE FALSE

(52) The language generated by that CFG is regular if _________

No terminal → semi word
No terminal → word
Both a and b
None of given

(53) The production of the form no terminal → Λ is said to be null production.

TRUE FALSE

(54) A production is called null able production if it is of the form N → Λ

TRUE FALSE




(55) The productions of the form nonterminal → one nonterminal, is called _________

Null production
Unit production
Null able production
None of given

(56) CNF is stands for

Context Normal Form
Complete Normal Form
Chomsky Normal Form
Compared Null Form