2 answers
1
6 answers
2
The Boolean expression $AB+A \overline{B}+\overline{A}C+AC$ is unaffected by the value of the Boolean variable _________.$A$$B$$C$$A, B$ and $C$
1 answer
3
The output of the following combinational circuit is $F$.The value of $F$ is$P_1+P_2’P_3$$P_1+P_2’P_3’$$P_1+P_2P_3’$$P_1’+P_2P_3$
8 answers
8
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 ______.
4 answers
9
Let $G$ be a group of $35$ elements. Then the largest possible size of a subgroup of $G$ other than $G$ itself is _______.
4 answers
11
If there are $m$ input lines and $n$ output lines for a decoder that is used to uniquely address a byte addressable $1$ KB RAM, then the minimum value of $m+n$ is _______...
5 answers
16
Consider a schedule of transactions $T_1$ and $T_2$:$\begin{array}{|c|c|c|c|c|c|c|c|c|c|c|} \hline T_1 & RA & & & RC & & WD & & WB & \text{Commit} & \\ \hline T_2 & & R...
4 answers
19
Consider the Boolean function $z(a,b,c)$. Which one of the following minterm lists represents the circuit given above?$z=\sum (0,1,3,7)$$z=\sum (1,4,5,6,7)$$z=\sum (2,4,5...
3 answers
22
5 answers
23
2 answers
25
What is the worst case time complexity of inserting $n^{2}$ elements into an AVL-tree with $n$ elements initially?$\Theta (n^{4})$$\Theta (n^{2})$$\Theta (n^{2}\log n)$$\...
0 answers
26
Can someone please provide better explaination about how the complexity can be obtained for prim's and krushkal's algorithms using heaps.. by both binary heap and fibonac...
0 answers
27
T (n) = T (n/2) + 2nUsing Master's Method What is the Complexity Of This Recurrence Relation?Or Using AnyOther Method?