A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

121. Which of the following is not true?
a. Power of deterministic automata is equivalent to power of non-deterministic automata.
b. Power of deterministic pushdown automata is equivalent to power of non-deterministic pushdown automata.
c. Power of deterministic Turing machine is equivalent to power of non-deterministic Turing machine.
d. All the above
View Answer Report Discuss Too Difficult! Search Google
Answer: (b).Power of deterministic pushdown automata is equivalent to power of non-deterministic pushdown automata.

122. Identify the language which is not context - free.
a. L = {ωωR|ωϵ{0,1}*}
b. L = {a^nb^n|n≥0}
c. L = {ωω|ωϵ{0,1}*}
d. L = {a^nb^mc^md^n | n, m≥0 }
View Answer Report Discuss Too Difficult! Search Google
Answer: (b).L = {a^nb^n|n≥0}

123. The context-free languages are closed for:

(i) Intersection                          (ii) Union
(iii) Complementation             (iv) Kleene Star
a. (i) and (iv)
b. (i) and (iii)
c. (ii) and (iv)
d. (ii) and (iii)
View Answer Report Discuss Too Difficult! Search Google
Answer: (c).(ii) and (iv)

124. Grammars that can be translated to DFAs:
a. Left linear grammar
b. Right linear grammar
c. Generic grammar
d. All of these
View Answer Report Discuss Too Difficult! Search Google
Answer: (b).Right linear grammar

125. The language accepted by a Push down Automata:
a. Type0
b. Type1
c. Type2
d. Type3
View Answer Report Discuss Too Difficult! Search Google
Answer: (c).Type2

126. In parallel algorithm design, the process of grouping tasks into larger tasks in order to improve performance:
a. Agglomeration
b. Domain Decomposition
c. Mapping
d. None of these
View Answer Report Discuss Too Difficult! Search Google
Answer: (a).Agglomeration

127. Recursive Descent Parsers are a type of:
a. LL parsers
b. LR parsers
c. LALR parsers
d. SLR parsers
View Answer Report Discuss Too Difficult! Search Google
Answer: (a).LL parsers

128. If language L={0,1}*, then the reversed language L^R =
a. {0,1}*
b. {}
c. {0}*
d. {1}*
View Answer Report Discuss Too Difficult!
Answer: (a).{0,1}*

Page 13 of 13