Register

testbook testseries
closed

• closed by
644 views
0 0 votes
closed with the note: already exist

Maximum number of nodes in the derivation tree when a word of length 2k is derived from a grammar in CNF

  1. $2^{k+1}-1$
  2. $3.2^{k}-1$
  3. $2^{k+1}+1$
  4. $3.2^{k}+1$
Voting & Accepting an answer helps improve the community
← Previous · Cache memoryNext → · Uninitialized array ...
← Previous in category · KLP MISHRANext in category → · nptel automata
Position:
Show:

Related questions

0 0 votes
0 0 answers
1.2k
1.2k views
Mk Utkarsh asked Sep 10, 2018
1,206 views
Testbook Testseries
A packet has arrived in which the offset value of second frame is 450, the header length is 20 and the value of total length field is 1000. What is the number of the firs...
0 0 votes
0 0 answers
295
295 views
Avik Chowdhury asked Aug 27, 2018
295 views
TESTBOOK TESTSERIES
A process executes the code for(i=1;i
1 1 vote
0 0 answers
1.2k
1.2k views
Akriti sood asked Jan 23, 2017
1,220 views
choose the correct one |testbook testseries
how is statement iv always true??For any simple, connected, undirected graph $G(V, E, w)$ with each edge carrying distinct positive edge weights. Consider the following s...
0 0 votes
1 answers 1 answer
1.2k
1.2k views
DAWID15 asked Dec 22, 2022
1,182 views
ZEAL TESTSERIES
Options:10, 12,14, 16, 18, 2020, 18, 16, 14, 12, 1012, 10, 16, 14, 20, 18NONEGiven the following doubly linked list with the normal node definition.What is printed if the...