Bihar STET – TOC Practice Test | Set 1

Questions 51-55 of 100

0% completed (0/100 answered)
Your score 0/100 0 answered
Correct 0 Incorrect 0 Unanswered 100 Accuracy 0%

Question 51

MCQ · Single Correct 1 mark
Previous Year Question Bihar STET C.S. 12.09.2023 (Shift-I) PYQ

What formal computational machine recognizes the class of Context-Free Languages?

Answers for question 51

Question 52

MCQ · Single Correct 1 mark

What extra memory structure distinguishes a Pushdown Automaton (PDA) from a Finite Automaton (FA)?

Answers for question 52

Question 53

MCQ · Single Correct 1 mark

A Pushdown Automaton is formally defined as a 7-tuple $M = (Q$, $\Sigma , Γ, \delta , q0, Z0, F$). What does Γ represent?

Answers for question 53

Question 54

MCQ · Single Correct 1 mark

How is an Instantaneous Description (ID) of a Pushdown Automaton represented during computation?

Answers for question 54

Question 55

MCQ · Single Correct 1 mark

What are the two standard language acceptance modes for Pushdown Automata?

Answers for question 55
Scroll to Top