Register
Filter

Recent activity by akankshaR

2 answers
1
Test by Bikram | Algorithms | Test 2 | Question: 6
$O(n^k)$ is complexity of the best method that finds longest Palindrome Substring in a word. For example, in the word "Atatb", the longest palindrome string is "tat". Then, the value of $10^*K$ is __________.
$O(n^k)$ is complexity of the best method that finds longest Palindrome Substring in a word. For example, in the word "Atatb", the longest palindrome string is "tat". The...
0 answers
3
Test by Bikram | Theory of Computation | Test 2 | Question: 29
The number of possible finite automata with two states $a0$ and $a1$ (where $a0$ is always the initial state over the alphabet $\{p, q\}$) which accepts empty language is _______ .
The number of possible finite automata with two states $a0$ and $a1$ (where $a0$ is always the initial state over the alphabet $\{p, q\}$) which accepts empty language is...
2 answers
4
Test by Bikram | Databases | Test 1 | Question: 23
Given R(A,B,C,D,E) with the set of FDs, F{AB→CD, ABC → E, C → A} the normal form of R is 2NF BCNF 4NF 3NF
Given R(A,B,C,D,E) with the set of FDs,F{AB→CD, ABC → E, C → A}the normal form of R is2NFBCNF4NF3NF