MCQ IN COMPUTER SCIENCE & ENGINEERING

Previous
Next

COMPUTER SCIENCE AND ENGINEERING

COMPILER DESIGN

Question [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
The number of elements in the set for the Language L={x(∑r) *|length if x is at most 2} and ∑={0, 1} is ____
A
7
B
6
C
8
D
5
Explanation: 

Detailed explanation-1: -The Question and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus. Information about The number of elements in the set for the Language L=x(∑r) *|length if x is at most 2 and ∑=0, 1 is a)7b)6c)8d)5Correct answer is option ‘A’.

Detailed explanation-2: -The maximum number of transition which can be performed over a state in a DFA? ∑= a, b, ca)1b)2c)3d)4Correct answer is option ‘C’.

Detailed explanation-3: -The maximum number of final states for a DFA can be total number of states itself and minimum would always be 1, as no DFA exits without a final state. Therefore, the solution is n+1.

Detailed explanation-4: -Thus, it can be said that it also accepts all the strings which is divisible by 6. No of final states in Language L1 U L2? 8.

Detailed explanation-5: -Explanation: According to the question, minimum of 3 states are required to recognize an octal number divisible by 3.

There is 1 question to complete.
Previous
Next