||| VuHelp4U ||| CS402 Todays Solved Quizes

Today's Solved Quizes

CS402

 

There _______ be dead states in NFA.

Select correct option:

may not

must

should not

will

 

1 Let FA1 accepts many strings and FA2 accepts none then FA1+FA2 will be equal to:

 Select correct option:

FA1

 FA2

 FA2-FA1

(FA2)*

 

If FA1 corresponds to (a+b)* then FA1 must accept ___________ string/strings.

 Select correct option:

No

Odd length

Even length

Every

 

The minimum length of the strings(except null string) of a language that starts and ends in the same letters will be:

Select correct option:

1

2

3

4

 

A regular language can be:

Select correct option:

irregular

infinite

non-deterministic

None of the given options

 

There ______ a language for which only FA can be built but not the RE.

Select correct option:

is cannot be

 may be

may not be

 

For every three regular expressions R, S, and T, the languages denoted by R(S U T) and (RS) U (RT) are the ______ .

 Select correct option:

Same

Different

 

In _______ there must be transition for all the lettersof a string.

 Select correct option:

 NFA

GTG

TG

FA

 

We cannot construct an NFA for the language of ______ defined over alphabet set {a,b}.

Select correct option:

Even

odd

Palindromes

Integers

 

Decomposing a string into its valid units is referred as:

Select correct option:

Decomposing

Splitting

Tokenizing

Dividing

 

 

In concatenation we accept the initial state of FA2 automatically after the final state of FA1 because of:

Select correct option:

We need just one initial state (correct)

 

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

Select correct option:

2

3

more than 3

None of these

 

Let FA3 be an FA corresponding to FA1FA2, then the initial state of FA3 must correspond to the initial state of Select correct option:

FA1

only FA2

only FA1

 

Let FA1 accepts many strings and FA2 accepts none then FA1+FA2 will be equal to:

Select correct option:

FA1

FA2

FA2-FA1

(FA2)*

 

 

FA and _______ are same except that _______ has unique symbol for each transition.

Select correct option:

FA,TG

NFA,TG

NFA,FA

GTG,NFA

 

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

Select correct option:

Regular language

Finite Aut

 

The minimum length of the strings(except null string) of a language that starts and ends in the same letters will be:

Select correct option:

1

2

3

4

 

For every three regular expressions R, S, and T, the languages denoted by R(S U T) and (RS) U (RT) are the ______ .

Select correct option:

Same

Differen

 

There _______ be dead states in NFA.

Select correct option:

may

not must

should not

will

 

In _______ there must be transition for all the lettersof a string.

Select correct option:

NFA

GTG

TG

FA

 

The minimum length of the strings(except null string) of a language that starts and ends in different letters will be:

Select correct option:

1

2

3

4

 

Consider we have languages L7 and L6. Which of the following represents their concatenation?

Select correct option:

·                  L7+L6

·                  L7/L6

·                  L6L7

·                  L7L6

 

In concatenation we accept the initial state of FA2 automatically after the final state of FA1 because of:

Select correct option:

We need just one init

 

There _______ be dead states in NFA.

Select correct option:

may

not must

should not

will

 

If we have a finite language and the number of states in the FA is n then the maximum number of letters in the each word of the language that will be ac

·                  1

·                  n-1

·                  n+1

·                  n

 

FA3 be an FA corresponding to FA1FA2, then the initial state of FA3 must correspond to the initial state of

Select correct option:

FA1 only

FA2 only

 

Consider we have languages L7 and L6. Which of the following represents their concatenation?

Select correct option:

L7+L6

L7/L6

L6L7

L7L6

 

Let FA1 has x number of states and FA2 has y number of states. Now FA1+FA2 can have maximum _______________ number of states. Select correct option:

·                  x+y

        x-y

·                  x/y

    none

 

The language {a ab aba bab} is _____ .

Select correct option:

Irregular

Regular

Recursive

None of the given options

 

The minimum length of the strings(except null string) of a language that starts and ends in the same letters will be:

Select correct option:

1

2

3

4

 

The minimum length of the strings(except null string) of a language that starts and ends in different letters will be:

Select correct option:

1

2

3

 

In _______ there must be transition for all the lettersof a string.

Select correct option:

NFA

GTG

TG

FA

 

     

--
To post to this group, send email to vuhelp_pk@googlegroups.com
To unsubscribe from this group, send email to vuhelp_pk+unsubscribe@googlegroups.com
 
 
Group Rules Vuhelp4u
Sharing of Video songs links, movies links, dramas links are not allowed in study group. Only Islamic and general information Video links allowed.
SPAM, Advertisement, and Adult messages are NOT allowed and that member will be behaved strictly.
http://groups.google.com/group/vuhelp_pk?hl=en_US