[vu-students] 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:

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:

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

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:

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:

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

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

Select correct option:

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:

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

Select correct option:

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

Select correct option:

NFA

GTG

--
You received this message because you are subscribed to the Google
Groups "VU Students" group.
To post to this group, send email to vu-students@googlegroups.com
To unsubscribe from this group, send email to
vu-students+unsubscribe@googlegroups.com
For more options, visit this group at
http://groups.google.com/group/vu-students?hl=en_PK?hl=en

::: vuaskari.com ::: Office of the High Commissioner for Human Rights: URGENT PETITION ON THE UN KASHMIR REPORT

Hey, I just signed the petition "Office of the High Commissioner for Human Rights: URGENT PETITION ON THE UN KASHMIR REPORT" and wanted to see if you could help by adding your name. Our goal is to reach 200,000 signatures and we need more support. You can read more and sign the petition here: http://chng.it/WMsBWWXBd6 Thanks! khurram -- We say, "Be one as Pakistani Nation and grow up for Pakistan's Future". Wish you all the best. Join www.vuaskari.com, To post to this group, send email to vuaskari_com@googlegroups.com Visit these groups: This (Main) Group: http://groups.google.com/group/vuaskari_com?hl=en?hl=en MIT/MCS Group: http://groups.google.com/group/vu_askarimit?hl=en?hl=en HRM Group: http://groups.google.com/group/askari_hrm?hl=en?hl=en Banking Group: http://groups.google.com/group/askari_banking?hl=en?hl=en Management: https://groups.google.com/group/vuaskari_mgt?hl=en Marketing: https://groups.google.com/group/vuaskari_mkt?hl=e...

VU Study

Search This Blog