Recent posts tagged announcement

1
I'm having hard time understanding how following series converges ; 1 + 2/5 + 3/5^2 + 4/5^3 + 5/5^4 + ............ infinity
2
11 bit per char for 300 char - 3300 bits so 3300 bits per sec ( i guess ) :P
3
@ pranay I think its typo ...it is just asking for max no of tuples in join..that 4 has no meaning with respect to question
4
but 0-23 includes 0-7 rt?
5
Answer is (D).$\textsf{socket()}$ creates a new socket of a certain socket type, identified by an integer number, and allocates system resources to it.$\textsf{bind()}$...
7
so what will be the correct answer
9
Or you want to say there may be need of some dynamic allocation inside the activation record. So we allocate it to heap area.
11
yes correct i miss that one.:D
12
∅ is an empty set {∅} is a set containing ∅ so IMO ∅⊑{∅ }{ }=∅ is an empty set it can be thought as empty bag containing nothing...
13
Just one confusion when u will find the size of the stack wont u traverse the entire linked list if I do implementation of stack using linked list then till the pointer b...
15
lt x->0 ( 6^x-2^x-3^x+1)/x^2=(6^xln6-2^xln2-3^xln3)/2x using l-hospital=(6^x(ln6)^2-2^x(ln2)^2-3^x(ln3)^2)/2 again using l-hospital=((ln6)^2-(ln2)^2-(ln3)^2)/2=((ln...
16
answer of of 4.12 is c) 10 as in DVR the routers rely completely on their neighbour Routers .So N2 , N4 will send their distance vector to N3 and N3 will find out that i...
17
Formula for no.of calls in f(n) =2f(n)-1 when f(0)=1only applied fibonacci serieswhere f(0)=1f(1)=1f(2)=2 i,e (f(0)+f(1))f(3)=3............f(7)=21so no.of calls 2(21)-1...
20
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 ...
22
For example if we consider {name, rollno} rollno. here RHS is a subset of LHS , This type of dependency are called trivialThey are implicit.
23
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$
24
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...
26
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
27
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.