Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by akshayaK
3
votes
1
answer
1
Secondary Index
Secondary key over key is dense and secondary key over non key is sparse is it correct ? i think it should be Secondary key over non key is dense and secondary key over key is sparse
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 ...
1.8k
views
asked
Jan 21, 2019
0
votes
0
answers
2
Heaps
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 will take O(N) TC, what is the use im not getting ? please explain.
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...
356
views
asked
Dec 21, 2018
0
votes
0
answers
3
Equivalence Problem
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
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
238
views
asked
Dec 20, 2018
0
votes
1
answer
4
Subset Problem
$L1 \subseteq L2$ decidable ? (for any of languages) i read No language is closed under subset operation Not even Regular Langauge ? I it TRUE ??
$L1 \subseteq L2$ decidable ? (for any of languages)i read No language is closed under subset operation Not even Regular Langauge ?I it TRUE ??
1.0k
views
asked
Dec 20, 2018
0
votes
0
answers
5
Turing Machine
L = {M | M is a TM and L(M) is infinite} L is Rec/ RE/ Not RE ?
L = {M | M is a TM and L(M) is infinite}L is Rec/ RE/ Not RE ?
125
views
asked
Dec 15, 2018
0
votes
0
answers
6
Thomas Write Rule
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 ? anyone please help me in understanding this
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...
600
views
asked
Dec 9, 2018
0
votes
0
answers
7
Error Detction
Inorder to detect 1bit error, min distance required is 2 and for 2bit error detection, min distance required is 3…. can anyone please explain why is it so ??
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 ??
365
views
asked
Nov 27, 2018
0
votes
0
answers
8
deleteStack() VS deleteQueue() [Linked List Implementation]
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 ?
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 ?
339
views
asked
Nov 8, 2018
0
votes
0
answers
9
MadeEasy Test Series : TCP
236
views
asked
Oct 29, 2018
0
votes
0
answers
10
Functional Dependency
How can we write dependency AB -> A ? can we write it as B->A ??
How can we write dependency AB - A ?can we write it as B->A ??
289
views
asked
Sep 27, 2018
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register