Register

Recent questions tagged testbook-test-series

4 votes
4 answers
307
TestBook Test Series: Theory Of Computation - Grammar
Number of nodes in the derivation tree when a word of length $2^{k}$ is derived from a grammar in CNF? $2^{k+1} -1$ $3.2^{k+1} - 1$ $2^{k+1} + 1$ $2^{k+1} + 1$
Number of nodes in the derivation tree when a word of length $2^{k}$ is derived from a grammar in CNF?$2^{k+1} -1$$3.2^{k+1} - 1$$2^{k+1} + 1$$2^{k+1} + 1$
User Avatar
4 votes
1 answer
309
TestBook Test Series: Databases - Super Keys
I think here even with Ph is removed from table we still get 12 Super keys. Because Salary & One of CK must be there.
I think here even with Ph is removed from table we still get 12 Super keys. Because Salary & One of CK must be there.
User Avatar
0 votes
0 answers
313
TestBook Live Test 1 Q No 20
I got that Statement 3 can be false in case we have function 1/n, then its square become 1/n^2. But I don't think statement 2 is true either. Please prove whether I'm correct or wrong.
I got that Statement 3 can be false in case we have function 1/n, then its square become 1/n^2. But I don't think statement 2 is true either. Please prove whether I'm cor...
User Avatar
Page: