NIELIT Scientist –B Day-14 : Theory of computation Quiz-1

Attempt now to get your rank among 407 students!

Question 1

The grammar ‘G1’   and the grammar ‘G2’ is
Which is the correct statement?

• AG1 is ambiguous, G2 is unambiguous
• BG1 is unambiguous, G2 is ambiguous
• CBoth G1 and G2 are ambiguous
• DBoth G1 and G2 are unambiguous

Question 2

Contex-free Grammar (CFG) can be recognized by

• AFinite state automata
• B2-way linear bounded automata
• Cpush down automata
• Dboth (B) and (C)

Question 3

If the parse tree of a word w generated by a Chomsky normal form grammar has no path of length greater than i, then the word w is of length

• Ano greater than 2ⁱ⁺¹
• Bno greater than 2ⁱ
• Cno greater than 2^i-1
• Dno greater than i

Question 4

The regular grammar for the language  is given by:
(Assume, p, q, r and s are non-terminals)

• A, 
  
• B,
• C,,
• D,,

Question 5

Which of the following statements is correct?

• AA = { aⁿ bⁿ  | n = 0,1, 2, 3 ..} is regular language
• BSet B of all strings of equal number of a's and b's defines a regular language
• CL =  (A* B*)∩ B gives the set A
• DNone of these

• 407 attempts
• 0 upvotes
• 5 comments