Register
Filter

Recent activity by resilientknight

2 answers
1
database-indexing-2
Maximum number of clustered indices one can build for a table with n attributes, which already has a primary index?
Maximum number of clustered indices one can build for a table with n attributes, which already has a primary index?
1 answer
2
database-indexing
How many different secondary indices are possible for a table with n attributes(Not necessarily at the same time)?
How many different secondary indices are possible for a table with n attributes(Not necessarily at the same time)?
1 answer
3
test series
1 answer
4
MAdeEasy Doubt
Maximum number of records that can be indexed in B+ tree of level 4 ,order 10..root at level 1 My answer is 9999 ,answer given 9000, ignoring the 9 keys in Root.... Why so?
Maximum number of records that can be indexed in B+ tree of level 4 ,order 10..root at level 1 My answer is 9999 ,answer given 9000, ignoring the 9 keys in Root.... Why s...
2 answers
6
test series
6 answers
7
GATE CSE 2015 Set 2 | Question: 22
An unordered list contains $n$ distinct elements. The number of comparisons to find an element in this list that is neither maximum nor minimum is $\Theta(n \log n)$ $\Theta(n)$ $\Theta(\log n)$ $\Theta(1)$
An unordered list contains $n$ distinct elements. The number of comparisons to find an element in this list that is neither maximum nor minimum is$\Theta(n \log n)$$\Thet...
4 answers
8
database-query-normalization-true-false
if table r has only one candidate key then which of the following is true: if R is in 3nf,it is also in bcnf R may not be in bcnf
if table r has only one candidate key then which of the following is true:if R is in 3nf,it is also in bcnfR may not be in bcnf
1 answer
11
databases-query
A clustered index is typicallly less expensive to maintain than unclustered index. True or False.
A clustered index is typicallly less expensive to maintain than unclustered index. True or False.
3 answers
14
er model,databases
IF A RELATION HAS ______________ CARDINALITY, THEN NO MINIMIZATION CAN TAKE PLACE. a) 1:n b)m:m c)n:1 d) none
IF A RELATION HAS ______________ CARDINALITY, THEN NO MINIMIZATION CAN TAKE PLACE.a) 1:nb)m:mc)n:1d) none
1 answer
16
toc - doubt
W(Wr)+, w belongs to (0*,1*) is Csl because? Is it because we cant decide the no of Wr or the content inside the Wr or both? so if 0111,011,001 a seperate kind of comparison for each? <------- this is the reason?
W(Wr)+, w belongs to (0*,1*) is Csl because? Is it because we cant decide the no of Wr or the content inside the Wr or both? so if 0111,011,001 a seperate kind of compari...
1 answer
17
Ace Booklet
The schedule S: T1: Read(X); T2: Write(X); T2: Write(Y); T3: Write(Y); T1: Write(Y); T1: commit; T2: commit; T3: commit; is Recoverable or non-recoverable?
The schedule S:T1: Read(X); T2: Write(X);T2: Write(Y);T3: Write(Y);T1: Write(Y);T1: commit; T2: commit;T3: commit;is Recoverable or non-recoverable?
2 answers
18
conflict serializability
Consider a schedule S: r1(A); W1(B); W1(C); r2(A); W2(B); W2(C); abort2; r3(A); W3(B); W3(C); C1; C3 How many conflict equivalent serial schedules are possible for the given schedule ?
Consider a scheduleS: r1(A); W1(B); W1(C); r2(A); W2(B); W2(C); abort2; r3(A); W3(B); W3(C); C1; C3 How many conflict equivalent serial schedules are possible for the giv...
5 answers
22
GATE IT 2004 | Question: 21
Which level of locking provides the highest degree of concurrency in a relational database ? Page Table Row Page, table and row level locking allow the same degree of concurrency
Which level of locking provides the highest degree of concurrency in a relational database ?PageTableRowPage, table and row level locking allow the same degree of concurr...
3 answers
23
GATE IT 2004 | Question: 78
Consider two tables in a relational database with columns and rows as follows: ... 1 Both i and ii will fail i will fail but ii will succeed i will succeed but ii will fail Both i and ii will succeed
Consider two tables in a relational database with columns and rows as follows:$$\overset{\text{Table: Student}}{\begin{array}{|c|c|c|} \hline \textbf {Roll_no} & \textbf{...
0 answers
30
Internet- restructuring of b + tree - deletion
Can someone please explain the restructuring of b+ tree in delete 15 step? I mean after 16,20,25 becomes the child of 13 ,after that it is not clear,how does 11 become the root?
Can someone please explain the restructuring of b+ tree in delete 15 step? I mean after 16,20,25 becomes the child of 13 ,after that it is not clear,how does 11 become t...