Theoretical Computer Science MCQ : Introduction -Set, Symbol, Alphabet, String, Formal Language : Link1
Theoretical Computer Science MCQ & Answers
Are you worried about the answers to Theoretical Computer Science questions :Set, Alphabet, String, Regular Expression identities, Formal 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. A---------is an ordered collection of objects.
A. Relation
B. Set
C. Function D. Proposition
Q.2. ϵL is equivalent to-------
A. L
B. Lϵ
C. ϵ D. Φ
Q.3. Which among the following is not an associative operation?
A. Union
B. Dot
C. Concatenation D. None of the above
Q.4. If ∑= {0,1}, then Ф* will result to--------
A. ε
B. Ф
C. ∑ D. None of the above
Q.5. Which among the following are incorrect regular identities?
A. εR=R
B. ε*=ε
C. Ф*=ε
D. RФ=R
Q.6. Which of the following statement is correct?
Statement 1: ε represents a single string in the set.Statement 2: Ф represents the language that consist of no string.
A. Statement 1 and 2 both are correct.
B. Statement 1 is false but 2 is correct.
C. Statement 1 and 2 both are false.
D. There is no difference between both the statements, ε and Ф are different notation for same reason.
Q.7. Let for ∑= {0,1} R= (∑∑∑) *, the language of R would be--------
A. {w | w is a string of odd length}
B. {w | w is a string of length multiple of 3}
C. {w | w is a string of length 3}
D. All of the above.
Q.8. RR* can be expressed in which of the forms--------
A. R+
B. R
C. R-
D. R+ U R-
Q.9. Concatenation of R with Ф output is -------
A. R
B. Ф
C. R.Ф
D. None of the above.
Q.10. The appropriate precedence order of operations over a Regular Language is-------
A. Kleene, Union, Concatenate
B. Kleene, Dot, Union
C. Kleene, Star, Union
D. Star, Union, Dot
Q.11. Let R and S be binary relations on a set A. Suppose that R is reflexive, symmetric, and transitive and that S is symmetric, and transitive but is not reflexive. Which statement is always true for any such R and S?
A. R ∪ S is symmetric but not reflexive and not transitive.
B. R ∪ S is symmetric but not reflexive.
C. R ∪ S is transitive and symmetric but not reflexive
D. R ∪ S is reflexive and symmetric.
Q.12. Assume the R is a relation on a set A, aRb is partially ordered such that a and b are------
A. Reflexive
B. Transitive
C. Symmetric
D. Reflexive and transitive
Q.13. The word 'formal' in formal languages means----------
A. the symbols used have well-defined meaning.
B. they are unnecessary, in reality.
C. only form of the string of symbols is significant.
D. Both (A) and (B)
Q.14. P, Q, R be regular expression over ∑, P is not ε, then R=Q + RP has a unique solution:
A. Q*P
B. QP*
C. (P*O*)*
D. Q*P*
Q.15. Arden’s theorem is true for--------
A. Null transitions
B. Non-null transitions
C. More than one initial states D. None of the above