Register
Filter

Recent activity by ShamikBanerjee

2 answers
3
Self Doubt on serializable
Why is Blind write necessary for a view serializable schedule that is not conflict serializable?
Why is Blind write necessary for a view serializable schedule that is not conflict serializable?
2 answers
4
GATE CSE 2014 Set 3 | Question: GA-10
Consider the equation: $(7526)_8 − (Y)_8 = (4364)_8$, where $(X)_N$ stands for $X$ to the base $N$. Find $Y$. $1634$ $1737$ $3142$ $3162$
Consider the equation: $(7526)_8 − (Y)_8 = (4364)_8$, where $(X)_N$ stands for $X$ to the base $N$. Find $Y$.$1634$$1737$$3142$$3162$
12 answers
7
GATE CSE 2015 Set 2 | Question: 10
A binary tree T has $20$ leaves. The number of nodes in T having two children is ______.
A binary tree T has $20$ leaves. The number of nodes in T having two children is ______.
3 answers
9
GATE CSE 2015 Set 1 | Question: GA-5
Which one of the following combinations is incorrect? Acquiescence - Submission Wheedle - Roundabout Flippancy - Lightness Profligate - Extravagant
Which one of the following combinations is incorrect?Acquiescence - SubmissionWheedle - RoundaboutFlippancy - LightnessProfligate - Extravagant
12 answers
13
GATE CSE 2003 | Question: 14
The regular expression $0^*(10^*)^*$ denotes the same set as $(1^*0)^*1^*$ $0+(0+10)^*$ $(0+1)^*10(0+1)^*$ None of the above
The regular expression $0^*(10^*)^*$ denotes the same set as$(1^*0)^*1^*$$0+(0+10)^*$$(0+1)^*10(0+1)^*$None of the above
14 answers
20
GATE CSE 2019 | Question: 12
Let $G$ be an undirected complete graph on $n$ vertices, where $n > 2$. Then, the number of different Hamiltonian cycles in $G$ is equal to $n!$ $(n-1)!$ $1$ $\frac{(n-1)!}{2}$
Let $G$ be an undirected complete graph on $n$ vertices, where $n 2$. Then, the number of different Hamiltonian cycles in $G$ is equal to$n!$$(n-1)!$$1$$\frac{(n-1)!}{2}...
16 answers
25
GATE CSE 2014 Set 1 | Question: 39
The minimum number of comparisons required to find the minimum and the maximum of $100$ numbers is ________
The minimum number of comparisons required to find the minimum and the maximum of $100$ numbers is ________
5 answers
26
GATE CSE 2004 | Question: 29
The tightest lower bound on the number of comparisons, in the worst case, for comparison-based sorting is of the order of $n$ $n^2$ $n \log n$ $n \log^2n$
The tightest lower bound on the number of comparisons, in the worst case, for comparison-based sorting is of the order of$n$$n^2$$n \log n$$n \log^2n$