Recent posts tagged job

Option (D) is answer.The circuit D is the $\text{dual}$ of the function $f(x)$ (i.e., replace $\text{AND}$ by $\text{OR}$ and vice versa)We can find dual of any function ...

Prob of 5 = 4/36 = 1/9 Prob of 7 = 6/36 = 1/6 Prob of 5 and 7 will not occur = 1 - (1/9 + 1/6) = 13/18and now 5 will occur before 7 is p = 1/9 + (13/18)(1/9) + (13/18)^...

U can't get unique binary tree for sure. But this question from ISRO so u may approach like this. Take a heap structure (i.e. complete Binary tree) and fill nodes as give...

FOR COMPLETE SOLUTION SEE HERE :http://www.geeksforgeeks.org/check-for-majority-element-in-a-sorted-array/

how?

in the case of option 1 what is P(A ∩ B) if a and b are not independent?

if a grammar is regular then it will be Context free also [as per chomsky hierarchy] it may be or may be not ambiguous depending on grammar. asS->bS|aXX->bS|aYY->aY|bY|^i...

Is it not necessary that each multivalued attribute should be placed in a separate table ??

it would be 00 not 11 becoz after 1 = 11after 2 = 10after 3 = 01after 4 = 00

sir , it is given that 6 bit instruction in which 4 bit is alloted for adress point of view and 2 one adress is which is 21=2 is one address and remaining 3 bit outoff 4 ...

Yes, you are correct. I had missed the "rising edge" part.

yes yes , so i think then the min table required is 1 , right ?

@Arjun And allocation will be done in heap memory or stack memory ??

My question: Should we include dirty bit and vaild-invalid bit in this calculation ?Please comment

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...

When window scaling happens, a 14 bit shift count is used in TCP header.sir why 14 bit only ?? any reason or just an assumption ??

yes.

Consider the relation R(ABCD) with FD's set F={ AB->CD,C->.A,D->B}which of the following is false ?1.C->A is a partial Dependency2.C->A is a transitive Dependency3.D->B I...

Instead of finding a function 'f' for the first MUX (in terms of z,x and y) and the second MUX (in terms of f , x and y), we can logically find out the answer.We can put ...

Super Key is any set of attributes that uniquely determines a tuple in a relation.Since $E$ is the only key, $E$ should be present in any super key.Excluding $E$, there a...