Bihar STET – TOC Practice Test | Set 1 ⋆ CSE Study247

Bihar STET – TOC Practice Test | Set 1

Questions 46-50 of 100

0% completed (0/100 answered)

Question 46

MCQ · Single Correct 1 mark

Previous Year Question Bihar STET C.S. 18.09.2023 (Shift-III) PYQ

Is the language L = { $a^p$ | p is a prime number } a Regular or Context-Free Language?

A Regular but not Context-Free B Not accepted by Turing Machine C Context-Free but not Regular D Neither Regular nor Context-Free (it is accepted by a Turing Machine / CSL)

Question 47

MCQ · Single Correct 1 mark

Previous Year Question Bihar STET C.S. 18.09.2023 (Shift-III) PYQ

Is the language L = { $0^m$ $1^m$ $0^m$ | m $\ge 1 } Context-Free$?

A Yes, both Regular and Context-Free B Yes, it is Regular C No, it is NOT Context-Free (it is Context-Sensitive) D Yes, it is Context-Free

Question 48

MCQ · Single Correct 1 mark

What parsing tree structure represents the step-by-step grammatical derivation of a sentence from start symbol S?

A Symbol Table B Transition Table C Activation Record D Parse Tree (or Derivation Tree)

Question 49

MCQ · Single Correct 1 mark

In leftmost derivations, which non-terminal symbol is replaced at each derivation step?

A The rightmost non-terminal B The LEFTMOST non-terminal in the sentential form C The start symbol only D Any random non-terminal

Question 50

MCQ · Single Correct 1 mark

In rightmost derivations, which non-terminal symbol is replaced at each step?

A The RIGHTMOST non-terminal in the sentential form B The start symbol C The leftmost non-terminal D A terminal symbol