Register

TESTBOOK TESTSERIES
closed

• closed by
122 views
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
0 answers
2
Prateek Raghuvanshi asked Jun 10, 2018
358 views
testbook testseries
Maximum number of nodes in the derivation tree when a word of length 2k is derived from a grammar in CNF $2^{k+1}-1$ $3.2^{k}-1$ $2^{k+1}+1$ $3.2^{k}+1$
Maximum number of nodes in the derivation tree when a word of length 2k is derived from a grammar in CNF$2^{k+1}-1$$3.2^{k}-1$$2^{k+1}+1$$3.2^{k}+1$
User Avatar
1 votes
1 votes
0 answers
3
Akriti sood asked Jan 23, 2017
487 views
choose the correct one |testbook testseries
how is statement iv always true??
how is statement iv always true??
User Avatar
0 votes
0 votes
2 answers
4
DAWID15 asked Dec 19, 2022
772 views
Zeal Testseries
I’m getting 2 as the answer, but the correct one given by them is 5. Somebody please confirm.
I’m getting 2 as the answer, but the correct one given by them is 5.Somebody please confirm.
User Avatar
Link Copied!