3 votes
1 answer
1
Secondary key over key is dense and secondary key over non key is sparseis it correct ?i think it should beSecondary key over non key is dense and secondary key over key ...
0 votes
0 answers
2
Why do we need a Build Heap procedure ?if we want to build a heap, we will call max_heapify on root node and we will form a heap in O(log N) TC.if we use build heap, it w...
0 votes
0 answers
3
L(G1) = L(G2) for DCFL is decidable and undecidable for all other languages.how do we prove intuitively and how do we check it ?Please Explain it
0 votes
1 answer
4
$L1 \subseteq L2$ decidable ? (for any of languages)i read No language is closed under subset operation Not even Regular Langauge ?I it TRUE ??
0 votes
0 answers
5
L = {M | M is a TM and L(M) is infinite}L is Rec/ RE/ Not RE ?
0 votes
0 answers
6
what do you mean by outdated writes ?we ignore outdated writes in TWR, what do we mean by this ??from this, which of this allowed under TWR and not Basic Timestamp ?anyon...
0 votes
0 answers
7
Inorder to detect 1bit error, min distance required is 2and for 2bit error detection, min distance required is 3….can anyone please explain why is it so ??
0 votes
0 answers
8
why deleteQueue() is taking O(1) even if it has to traverse whole linked list ???whereas deleteStack() has time complexity of O(n) ??can anyone please explain it ?
0 votes
0 answers
9
0 votes
0 answers
10
How can we write dependency AB - A ?can we write it as B->A ??