2nd Quiz of CS402 Fall 2010 with correct answer check it out
Sayed Rahim (MCS)
Q1
A DFA with n states must accept at least one string of length greater than n.
Choices:
True
Q2
FA corresponding to an NFA can be built by introducing a state corresponding to the combination of states, for a letter having
Choices:
no transition at certain state
Q3
Which of the following statement is NOT true?
Choices:
TG can be considered to be an NFA
Q4
For every three regular expressions R, S, and T, the languages denoted by R(S U T) and (RS) U (RT) are the same.
Choices:
True
Q5
Does the empty string match the regular expression |y+a|?
Choices:
No
Q6
If an FA already accepts the language expressed by the closure of certain RE, then the given FA is the required FA.
Choices:
True
Q7
Which of the following statement is true about NFA with Null String?
Choices:
Transition of null string is allowed at any stage
Q8
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.
Choices:
True
Q9
FA corresponding to an NFA can be built by introducing an empty state for a letter having
Choices:
no transition at certain state
Q10
Let FA3 be an FA corresponding to FA1FA2, then the initial state of FA3 must correspond to the initial state of
Choices:
FA1 and FA2
mc100403271 Muhammad Ashfaq
> --
> --
> Please visit www.vuzs.net For Current & Old Papers, Quizzes, Assignments and
> study material.
> --
> You received this message because you are subscribed to the Google
> Groups "vuZs" group.
> --
> To post a new message on this group, send email to vu...@googlegroups.com
> --
> Posting Rule: Please Start your subject line with subject code (like MGT501,
> MGT402)
> --
> To unsubscribe from this group, send email to
> vuZs+uns...@googlegroups.com
> --
> For more info, visit the main page of vuZs group at
> http://groups.google.com/group/vuZs
> --
> To join this group visit http://groups.google.com/group/vuZs/subscribe?hl=en
>