0 votes 0 votes Let $n$ is the length of string to test for membership, then the number of table entry in CYK algorithm is $n(n+1)$ $n^2+1$ $n^2-1$ $n(n+1)/2$ Theory of Computation nielit2017dec-scientistb theory-of-computation cyk-algorithm + – admin asked Mar 30, 2020 • retagged Oct 29, 2020 by Krithiga2101 admin 1.7k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes D seems to be correct. stblue answered Dec 18, 2017 stblue comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes The number of entries in Table is like a triangular matrix. Total no of elements in the matrix = n(n+1)/2 Answer is D. Avdhesh Singh Rana answered Dec 18, 2017 Avdhesh Singh Rana comment Share Follow See all 0 reply Please log in or register to add a comment.