# Recent posts tagged announcement

1
Formula for no.of calls in f(n) =2f(n)-1 when f(0)=1 only applied fibonacci series where f(0)=1 f(1)=1 f(2)=2 i,e (f(0)+f(1)) f(3)=3............f(7)=21 so no.of calls 2(21)-1=41 remember when f(0)=0,f(1)=1 then formula changes as 2f(n+1)-1
4
Total cache size $= 256\ KB$ Cache block size $=32\text{ Bytes}$ So, number of cache entries $=\dfrac{ 256\ K}{32}=8\ K$ Number of sets in cache $=\dfrac{ 8\ K}{4}=2\ K$ as cache is $4\text{-way}$ associative. So, $\log(2048) = 11\ bits$ are ... , we need $16\text{ tag bits}$ along with each cache entry to identify which of the possible $2^{16}$ blocks is being mapped there. Correct Answer: $C$
6
For example if we consider {name, rollno} rollno. here RHS is a subset of LHS , This type of dependency are called trivial They are implicit.
7
The roots are $x=1, x=2$, and $x=3.$ So polynomial is $f(x) = (x-1)(x-2)(x-3)$ $f(0) = -6, f(4) = 6$ So $f(0)f(4) < 0$. Correct Answer: $A$
8
Consider a rooted n node binary tree represented using pointers. The best upper bound on the time required to determine the number of subtrees having exactly $4$ nodes is $O(n^a\log^bn)$. Then the value of $a+10b$ is __________.
9
10
2*1*2*1=4 break it into determinant of smaller pieces where you are doing it in such a way that you should have to do lesser number of operations
11
by taking common I mean, use only one inverter, not two...and the circuit you designed above gives the cost of 65...
To see more, click for the full list of questions or popular tags.