Implement a function getbits, that returns the(right adjusted) n bits that begin at position p of an integer. Assume bit position 0 is at the right end and that n and p are sensible positive values.

You are given n real numbers in an array. A number in the array is called a decimal dominant if it occurs more than n/10 times in the array. Give an O(n) time algorithm to determine if the given array has a decimal dominant.

toss the coin 2 times the pssible outcomes are {HH,TT,HT,TH}

ReplyDeleteconsider only two outcomes as valid HT and TH...

P(HT)=P(TH)

@ankit agreed..:)

ReplyDelete