Register
Filter

Recent activity by akshayaK

6 answers
1
#DBMS ER Model - Minimum Number of tables
What are minimum number of tables required for the following given ER models such that they satisfy 1NF ?
What are minimum number of tables required for the following given ER models such that they satisfy 1NF ?
1 answer
3
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 ...
0 answers
7
Threads
Consider following statements given below : S1 : User level thread does not require context switching. S2 : VM increases context switching overhead. Which of the following statements are TRUE ?
Consider following statements given below :S1 : User level thread does not require context switching.S2 : VM increases context switching overhead.Which of the following s...
1 answer
8
#Threads #OS True/False statements
for kernel-level threads, a system call can block the entire process. User level threads can be scheduled independently. Kernel level threads are transparent to the user level threads. Which of them is True?
for kernel-level threads, a system call can block the entire process.User level threads can be scheduled independently.Kernel level threads are transparent to the user le...
0 answers
9
Self Doubt
L= {a*b*c* – (a^nb^nc^n : n>=0)} Explain whether it is Regular, CFL,DCFL.,CSL
L= {a*b*c* – (a^nb^nc^n : n>=0)} Explain whether it is Regular, CFL,DCFL.,CSL
0 answers
10
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...
1 answer
11
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 ??
0 answers
12
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
12 answers
13
GATE CSE 2010 | Question: 10
In a binary tree with $n$ nodes, every node has an odd number of descendants. Every node is considered to be its own descendant. What is the number of nodes in the tree that have exactly one child? $0$ $1$ $\frac{(n-1)}{2}$ $n-1$
In a binary tree with $n$ nodes, every node has an odd number of descendants. Every node is considered to be its own descendant. What is the number of nodes in the tree ...
13 answers
16
GATE CSE 2017 Set 2 | Question: 55
Consider the following C program. #include<stdio.h> #include<string.h> int main() { char* c="GATECSIT2017"; char* p=c; printf("%d", (int)strlen(c+2[p]-6[p]-1)); return 0; } The output of the program is _______
Consider the following C program.#include<stdio.h #include<string.h int main() { char* c="GATECSIT2017"; char* p=c; printf("%d", (int)strlen(c+2[p]-6[p]-1)); return 0; }T...
0 answers
17
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 ?
0 answers
21
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...
3 answers
23
Schedules
$1)$ Find the number of all possible conflict-equivalent and view-equivalent schedules to the following serial schedules. (a) r1(A), w1(B), r2(A), w2(B), r3(A), w3(B).
$1)$ Find the number of all possible conflict-equivalent and view-equivalent schedules to the following serial schedules. (a) r1(A), w1(B), r2(A), w2(B), r3(A), w3(B)....
1 answer
24
[DBMS] Strict recoverable schedules
S:- R1(A) R2(A) W2(A) W2(A) Is S strict recoverable schedule?
S:- R1(A) R2(A) W2(A) W2(A)Is S strict recoverable schedule?
1 answer
25
#self doubt
Let a schedule be Strict Recoverable then it will suffer from which problem? a) ww problem b) rw problem c)wr problem d) Lost update problem
Let a schedule be Strict Recoverable then it will suffer from which problem?a) ww problem b) rw problemc)wr problem d) Lost update problem
0 answers
26
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 ??
1 answer
28
Knapsack problem
5.Consider the Knapsack instance with 5 objects and a capacity M=11, profit P=(5,4,7,2,3) and weight W=(4,3,6,2,2.). Solve it using dynamic programming approach.
5.Consider the Knapsack instance with 5 objects and a capacity M=11, profit P=(5,4,7,2,3) andweight W=(4,3,6,2,2.). Solve it using dynamic programming approach.
0 answers
29
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 ?
0 answers
30
MadeEasy Test Series : TCP