Theoretical Computer Science MCQ : Introduction -Regular Expression, Regular Language : Link2
Theoretical Computer Science MCQ & Answers
Are you worried about the answers to Theoretical Computer Science questions :Regular Expression, Regular Language? We have arranged the Show Answer button under the each question. Candidates can click on it to know the right option among the given alternatives. Furthermore, the applicants can check our web portal @ www.totalmcq.com to take part in more MCQ on various subject. Wish, the given information about the Theoretical Computer Science MCQ will helpful to the advance and can learn the various types of questions and answers.
Q.1. Consider following regular expression
i) (a/b)*
ii) (a*/b*)*
iii) ((ϵ/a)b*)*
Which of the following statements are correct?
A. i,ii are equal and ii,iii are not
B. i,ii are equal and i,iii are not
C. ii,iii are equal and i,ii are not D. all are equal
Q.2. (a+b)* is equivalent to-------
A. b*a*
B. (a*b*)*
C. a*b* D. None of the above.
Q.3. A regular language over an alphabet a is one that can be obtained from------
A. Union
B. kleene
C. Concatenation D. All of the above
Q.4. Which among the following is equivalent to the given regular expression?
01*+1
A. (0(1)*)+1
B. (01)*+1
C. 0((1)*+1) D. ((0*1)1*)*
Q.5. Regular Expression denote precisely the ________ of Regular Language.
A. set
B. Class
C. Power Set
D. Super Set
Q.6. Which among the following looks similar to the given expression? ((0+1).(0+1))*
A. {xϵ {0,1}*|x is all binary number with even length}
B. {xϵ {0,1} |x is all binary number with even length}
C. {xϵ {0,1}*|x is all binary number with odd length}
D. {xϵ {0,1} |x is all binary number with odd length}
Q.7. The set of all strings over ∑ = {a,b} in which strings consisting a’s and b’s and ending with in bb is
A. (a+b)* bb
B. ab
C.{ a*bbb}
D. All of the above
Q.8. Regular expressions are used to represent which language?
A. Recursive language
B. Regular language
C. Context free language
D. All of the above
Q.9. The set of all strings over ∑ ={a,b} in which a single a is followed by any number of b’s or a single b followed by any number of a’s is-----
A. ab* + ba*
B. ab*ba*
C. a*b + b*a
D. None of the above
Q.10. The set of all strings over ∑ = {a,b} in which all strings having bbbb as substring is-------
A. bbb(a+b)*
B. (a+b)* bbbb (a+b)*
C. bb (a+b)*
D. (a+b)* bb (a+b)*bb
Q.11. In regular expressions, the operator ‘*’ stands for------
A. Concatenation
B. Addition
C. Selection D. Iteration
Q.12. Which of the following is NOT the set of regular expression R = (ab + abb)* bbab
A. abbbab
B. ababbabbbab
C. abababab
D. ababbbbab
Q.13. What is/are the applications of Regular Expression?
A. Designing compilers
B. Developing text editors
C. Simulating sequential circuits
D. All of the above
Q.14. Which of the following operation can be applied on regular expressions?
A. Union
B. Closure
C. Concatenation
D. All of the above
Q.15. The regular expression with all strings of 0′s and 1′s with at least two consecutive 0′s is------
A. 1 + (10)*
B. (0+1)*011
C. (0+1)*00(0+1)* D. 0*1*2*