# testbook testseries [closed]

43 views

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$
closed with the note: already exist

closed

## Related questions

1
95 views
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 first byte in the first frame and the last byte in the last frame if the size of IP packet is 3500 B. ... value of second frame is $450$ then 1st frame consisted of $450 \times 8 = 3600B$. that's more than the data we want to send.
Which of the following statements are false ? $1.$ A depth-first search of a directed graph always produces the same number of tree edges (i.e., independent of the order in which the vertices are provided and independent of the order of the adjacency list). ... path between any two vertices will not change. $4.$ Dijkstra's algorithm may not terminate if the graph contains negative weight edges.