0 votes
2 answers
1
S1 is true and S3 is False as secondary index is dense...Please explain whether S2 is true or false
1 votes
1 answer
2
0 votes
2 answers
3
0 votes
1 answer
4
0 votes
2 answers
5
Which scheduling algorithm is optimum among the following disk scheduling algorithm in most of cases?a)FCFSb)SSTFc)SCANd)LOOKAlso please give reason
0 votes
2 answers
6
What is value of binary semaphore "S" after executing 10 P (Wait) operations and 14 V (Signal) operations if the initial value of "S" is 1 ?
0 votes
1 answer
7
To check whether a given schedule is serializable or not , do we need to check only for conflict serializability or both conflict serializability and view serializabil...
0 votes
3 answers
8
When do we say that 2 functions are polynomially comparable for applying master theorem...? We can apply the theorem for T(n)=3T(n/4)+nlgn but cant apply it for T(n)=2T(n...
0 votes
1 answer
9
S1 is false ....but can any one plz explain about S2..?
0 votes
1 answer
10
Please explain..
0 votes
1 answer
11
1 votes
1 answer
12
A 5 stage pipeline with the stages taking 1, 1, 3, 1, 1 units of time has throughput of(A) 1/3 (B) 1/7 (C) 1/5 (D) 1/6Also please explain the answer
0 votes
1 answer
13
1 votes
2 answers
14
Let $f:A\to B$ and $E$ and $F$ be subsets of $A$. Is below statement true or false?$S:f(E \cap F)= f(E) \cap f(F)$
0 votes
0 answers
16
Let D denote the determinant of n*n matrix. If any line of the determinant is passed over m parallel lines which is true?a) The resultant determinant will change its sign...
0 votes
2 answers
19
Let R(ABCDE) be a relational schema and F={AB->CD, ABC->E,C->A}. The number of candidate keys are a) 1b) 2c) 3d) 4Is there some standard way to solve such problem.. or we...
0 votes
1 answer
20
Also please explain how many times "PROCESS" will be printed when we don't use fflush()...?