8 answers
1
8 answers
2
The average number of key comparisons required for a successful search for sequential search on $n$ items is$\frac{n}{2}$$\frac{n-1}{2}$$\frac{n+1}{2}$None of the above
1 answer
11
Say I have a Binary Semaphore S initialized to 1. Consider V() as Signal and P() as Wait. If I now invoke V(S), will it wait for S to become 0? Or will it go on with furt...
5 answers
13
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...
1 answer
20
0 answers
24
3 answers
28
What will be solution of this function for coefficient of $x^{100}$?$$\frac{1}{\left ( 1-x^{10} \right )(1-x^{20})(1-x^{50})}$$
0 answers
29
State True/False and explain the following statements. Recoverability implies no dirty read. Dirty read implies cascading rollbacks when transactions are more than $2$