CS402 Latest unsolved MCQs For mid term Spring 2013

Question

Closure of an FA is same as concatenation of an FA with itself?

True

False

Question

In Closure of an FA the initial state of a required FA is

 

Initial state of another FA

Final State of another FA

Final state as well of the same FA

None of the Given

Question

NFA is a TG as well?

True

False

Question

Considering FA1 and FA2 having 2 states each. Now FA1+FA2 can have maximum number of states.

2

3

It will be more than 3.

None of them

Question

Closure of an FA, is same as of an FA with itself, except
that the initial state of the required FA is a final state as well.

Union
Sum
Concatenation
Intersection

Question

If R is a regular language and L is some language, and L U R is a regular language, then L must be a regular language.


True

False

Question

If R is a regular language and L is some language, and L U R is a RE then L must be a

Concatenation

Regular Language

Question

There a unique path for each string in NFA?

Must be

May be

Should be

May not be

Question

If a Language is accepted by an FA then there exists a TG accepting the language?

True

False

Question

It is clear by the definition of NFA that a string is supposed to be accepted if there exist at least successful path

Two

One

More than one

More than two

Question

Can NFA and FA be equivalent?

Yes

No

Question

NFA helps to eliminate at certain state of an FA

Loop

FA

NFA

String

Question

It is possible to convert an FA into NFA?

Yes
No

Question

A language accepted by an FA is also accepted by
Select correct option:

TG only
GTG only
RE only
All of the given

Question

Length of EVEN-EVEN language is _________

Select correct option:

Even
Odd
Sometimes even & sometimes odd
Such language doesn’t exist

Question

[(a + b)(a + b)]*, given RE cannot generate the string ________

Select correct option:


Abbaabab
Abbbaa
Bbbbbb
abbbaaaaa

Question

Which of the following statement is true about GTG?
Select correct option:

Transition are based on input letter
Transition are based on specified substring
Transition are based on Regular Expression
None of the given options.

Question

Formal is also known as _________

Select correct option:

Syntactic Language
Semantic language
Informal Language
None of these

Question

What is false about the term alphabet?

Select correct option:

It is finite set of symbols
It is usually denoted by Greek letter Sigma
It can be an empty set.
Strings are made up of its elements

Question

the language having even number of a’s and even number of b’s defined over S = {a, b} is called

Select correct option:

 

EVEN-EVEN
ODD-ODD
PALINDROME
FACTORIAL

Question

In an FA, when there is no path starting from initial state and ending in final state then that FA
Select correct option:

accept null string
accept all strings
accept all non empty strings
does not accept any string