Explore topic-wise MCQs in Compilers.

This section includes 2 Mcqs, each offering curated multiple-choice questions to sharpen your Compilers knowledge and support exam preparation. Choose a topic below to get started.

1.

Let w be any string of length n is {0,1}*. Let L be the set of all substring of w. State the minimum number of states in a NDFA that accepts L?

A. n<a href="https://www.sanfoundry.com/wp-content/uploads/2017/05/compilers-questions-answers-minimization-dfa-1-q6.png"><img alt="Find the string of length n from the given diagram" class="alignnone size-full wp-image-159837" height="86" src="https://www.sanfoundry.com/wp-content/uploads/2017/05/compilers-questions-answers-minimization-dfa-1-q6.png" width="280"/></a>
B. n 1
C. n
D. n + 1
E. 2n 1
Answer» D. n + 1
Discussion
2.

Consider the languages L1 = and L2 = {a}. Which one of the following represents L1 L2* U L1*?

A.
B. a*
C. All of the mentioned
D. None of the mentioned
Answer» B. a*
Discussion