Bihar STET – TOC Practice Test | Set 2

Questions 26-30 of 100

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

Question 26

MCQ · Single Correct 1 mark

In the CYK (Cocke-Younger-Kasami) Parsing Algorithm, what data structure is constructed to parse an input string of length n?

Answers for question 26

Question 27

MCQ · Single Correct 1 mark

What is the space complexity of the CYK parsing algorithm for a string of length n and grammar size |G|?

Answers for question 27

Question 28

MCQ · Single Correct 1 mark

According to the Pumping Lemma for Context-Free Languages, for any CFL L with pumping length p, every string w ∈ L with |w| $\ge p can be written as$$w = uvwxy satisfying$ which THREE conditions?

Answers for question 28

Question 29

MCQ · Single Correct 1 mark

If L1 and L2 are Context-Free Languages, is their Concatenation (L1 • L2) guaranteed to be Context-Free?

Answers for question 29

Question 30

MCQ · Single Correct 1 mark

If L is a Context-Free Language, is its Kleene Star (L*) guaranteed to be Context-Free?

Answers for question 30
Scroll to Top