BARC CS 2018 Nuclear Quiz -3 (TOC)

Attempt now to get your rank among 970 students!

Question 1

Find the equivalent regular expression generated by the above grammar G.

• A
• B
• C
• D

Question 2

A language over ∑ (a,b)* ,all strings are palindrome, has grammar where ε is not included in grammar[ means ‘ S->ε ‘ not available ]
Then which is true ?

• AIt is an odd length palindrome
• BIt is an even length palindrome
• Cpresence or absence of ε does not matter
• DNone

Question 3

What is not a regular expression for one or more a?

• Aa
• Ba
• Ca + aa + aaa + ………………………………………………..
• DNone of the above

Question 4

Consider the following problem X.
Given a Turing machine M over the input alphabet Σ, any state q of M
And a word w ∈Σ*, does the computation of M on w visit the state q?
Which of the following statements about X is correct?

• AX is decidable
• BX is undecidable but partially decidable
• CX is undecidable and not even partially decidable
• DX is not a decision problem

Question 5

If a language is recursive then it is

• Aundecidable
• Bdecidable
• Csometimes decidable
• Dcan’t say

• 970 attempts
• 2 upvotes
• 10 comments