8 answers
2
The number of permutations of the characters in LILAC so that no character appears in its original position, if the two L’s are indistinguishable, is ______.
6 answers
4
Consider an undirected random graph of eight vertices. The probability that there is an edge between a pair of vertices is $\dfrac{1}{2}.$ What is the expected number of ...
1 answer
5
There are Insert and Retrieve_Max operations on a set {}. for n such operations what is the time complexity of the efficient algorithm possible?$n^{2}$nlogn n logn
5 answers
6
Which one or more of the following $\text{CPU}$ scheduling algorithms can potentially cause starvation?First-in First-OutRound RobinPriority SchedulingShortest Job First
3 answers
8
Which one of the following sequences when stored in an array at locations $A , \ldots, A[10]$ forms a max-heap?$23,17,10,6,13,14,1,5,7,12$$23,17,14,7,13,10,1,5,6,12$$23,1...
8 answers
9
If the matrix $A$ is such that $$A= \begin{bmatrix} 2\\ −4\\7\end{bmatrix}\begin{bmatrix}1& 9& 5\end{bmatrix}$$ then the determinant of $A$ is equal to ______.
0 answers
15
In which of the given operations, will a user level to kernel level switch, surely happen?Page FaultSystem CallSubroutine CallMalloc()
9 answers
17
Consider the following rooted tree with the vertex labeled $P$ as the root:The order in which the nodes are visited during an in-order traversal of the tree is$SQPTRWUV$$...
2 answers
19
2 answers
20
A relation is in 3NF if every non-prime attribute of R is fully functionally reliant on every key of RTRUEFALSE
2 answers
22
1 answer
29