Re: [algogeeks] BitWise Operations - For finding next multiple
Actually, it doesn't do what the requester asked even when x is a power of
2, because, e.g., the output for n = 6 and x = 2 is 6, but according to the
examples provided, the output should be 8, the next higher multiple of 2.
You could use (n + x) & ~(x-1) or (n + x) & (-x) for the x = power of two
case.
For general x > 0, the following algorithm is O(log n):
int nextLargerMultiple(int n, int x)
{
int r = n, d = x;
while( r <= d ) d <<= 1;
while( d != x )
{
d >>= 1;
if( r >= d ) r -= d;
}
return n - r + x;
}
Think long division, as you learned to do it with paper and pencil. The
first while loop shifts x left enough that the result is > n. The second
while loop successively shifts x right one place and if
possible subtracts it from n. At the end of the second while loop r is the
remainder; n%x. Subtracting r from n gives the n rounded down to a multiple
of x, and then adding x gives the next larger multiple of x.
Dave
On Thursday, September 13, 2012 9:03:49 AM UTC-5, bharat wrote:
>
> the above code works only for 2,4,8,16 ...
>
> On Thu, Sep 13, 2012 at 7:13 PM, VIHARRI P L V
>
> > wrote:
>
>> Let me give an example.
>>
>> For 17 next multiple of number 5 is 20.
>> For 20 next multiple of number 5 is 25.
>>
>> And give solution for this proeblem also:
>>
>> For 17 next nearest multiple of number 5 is 20.
>> For 20 next nearest multiple of number 5 is 20.
>>
>> *VIHARRI P L V*
>>
>>
>>
>>
>> On Thu, Sep 13, 2012 at 7:09 PM, bharat b
>>
>> > wrote:
>>
>>> @vihari: what is n?
>>>
>>> On Thu, Sep 13, 2012 at 6:32 PM, VIHARRI
>>> > wrote:
>>>
hey for finding next multiple of a number x using bitwise : ( n + x -1
) & ~(x-1) but not working for all numbers
Could some one please explain me.
--
You received this message because you are subscribed to the Google
Groups "Algorithm Geeks" group.
To view this discussion on the web visit
https://groups.google.com/d/msg/algogeeks/-/7C_Nw4RoxmEJ.
To post to this group, send email to algo...@googlegroups.com
.
To unsubscribe from this group, send email to
algogeeks+...@googlegroups.com .
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
>>>
>>> --
>>> You received this message because you are subscribed to the Google
>>> Groups "Algorithm Geeks" group.
>>> To post to this group, send email to algo...@googlegroups.com
>>> .
>>> To unsubscribe from this group, send email to
>>> algogeeks+...@googlegroups.com .
>>> For more options, visit this group at
>>> http://groups.google.com/group/algogeeks?hl=en.
>>>
>>
>> --
>> You received this message because you are subscribed to the Google Groups
>> "Algorithm Geeks" group.
>> To post to this group, send email to algo...@googlegroups.com
>> .
>> To unsubscribe from this group, send email to
>> algogeeks+...@googlegroups.com .
>> For more options, visit this group at
>> http://groups.google.com/group/algogeeks?hl=en.
>>
>
>
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To view this discussion on the web visit
https://groups.google.com/d/msg/algogeeks/-/e0LIWXHAQjMJ.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] BitWise Operations - For finding next multiple
the above code works only for 2,4,8,16 ... On Thu, Sep 13, 2012 at 7:13 PM, VIHARRI P L V wrote: > Let me give an example. > > For 17 next multiple of number 5 is 20. > For 20 next multiple of number 5 is 25. > > And give solution for this proeblem also: > > For 17 next nearest multiple of number 5 is 20. > For 20 next nearest multiple of number 5 is 20. > > *VIHARRI P L V* > > > > > On Thu, Sep 13, 2012 at 7:09 PM, bharat b wrote: > >> @vihari: what is n? >> >> On Thu, Sep 13, 2012 at 6:32 PM, VIHARRI wrote: >> >>> hey for finding next multiple of a number x using bitwise : ( n + x -1 ) >>> & ~(x-1) but not working for all numbers >>> Could some one please explain me. >>> >>> -- >>> You received this message because you are subscribed to the Google >>> Groups "Algorithm Geeks" group. >>> To view this discussion on the web visit >>> https://groups.google.com/d/msg/algogeeks/-/7C_Nw4RoxmEJ. >>> To post to this group, send email to algogeeks@googlegroups.com. >>> To unsubscribe from this group, send email to >>> algogeeks+unsubscr...@googlegroups.com. >>> For more options, visit this group at >>> http://groups.google.com/group/algogeeks?hl=en. >>> >> >> -- >> You received this message because you are subscribed to the Google Groups >> "Algorithm Geeks" group. >> To post to this group, send email to algogeeks@googlegroups.com. >> To unsubscribe from this group, send email to >> algogeeks+unsubscr...@googlegroups.com. >> For more options, visit this group at >> http://groups.google.com/group/algogeeks?hl=en. >> > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algogeeks@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] adobe interview
No... say process 1 set lock variable to 1 and gets pre-empted .. process2 executes the same code and comes to critical section and gets pre-empted.. now process1 resumed.. NOW BOTH ARE IN CRITICAL SECTION .. On Thu, Sep 13, 2012 at 7:14 PM, Ayush Kapoor wrote: > There was a question in written round that there is a global static > variable ‘lock’ initially set to 0 and there was a code segment given. > > while(lock); > lock = 1; > //Critical section > lock = 0; > > Does this solve critical section problem. > > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algogeeks@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] adobe interview
There was a question in written round that there is a global static variable ‘lock’ initially set to 0 and there was a code segment given. while(lock); lock = 1; //Critical section lock = 0; Does this solve critical section problem. -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] BitWise Operations - For finding next multiple
Let me give an example. For 17 next multiple of number 5 is 20. For 20 next multiple of number 5 is 25. And give solution for this proeblem also: For 17 next nearest multiple of number 5 is 20. For 20 next nearest multiple of number 5 is 20. *VIHARRI P L V* On Thu, Sep 13, 2012 at 7:09 PM, bharat b wrote: > @vihari: what is n? > > On Thu, Sep 13, 2012 at 6:32 PM, VIHARRI wrote: > >> hey for finding next multiple of a number x using bitwise : ( n + x -1 ) >> & ~(x-1) but not working for all numbers >> Could some one please explain me. >> >> -- >> You received this message because you are subscribed to the Google Groups >> "Algorithm Geeks" group. >> To view this discussion on the web visit >> https://groups.google.com/d/msg/algogeeks/-/7C_Nw4RoxmEJ. >> To post to this group, send email to algogeeks@googlegroups.com. >> To unsubscribe from this group, send email to >> algogeeks+unsubscr...@googlegroups.com. >> For more options, visit this group at >> http://groups.google.com/group/algogeeks?hl=en. >> > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algogeeks@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] BitWise Operations - For finding next multiple
@vihari: what is n? On Thu, Sep 13, 2012 at 6:32 PM, VIHARRI wrote: > hey for finding next multiple of a number x using bitwise : ( n + x -1 ) & > ~(x-1) but not working for all numbers > Could some one please explain me. > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To view this discussion on the web visit > https://groups.google.com/d/msg/algogeeks/-/7C_Nw4RoxmEJ. > To post to this group, send email to algogeeks@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] java question : How can one writes a function in Java that mocks the super() call without using the super keyword?
@shruti : question is about implementing super() functionality ... @vibhav : ya, I don't need it .. I heard that it is possible .. just to know how .. On Wed, Sep 12, 2012 at 11:55 AM, vaibhav shukla wrote: > whats the need for such a hack > > > On Wed, Sep 12, 2012 at 10:56 AM, bharat b > wrote: > >> >> -- >> You received this message because you are subscribed to the Google Groups >> "Algorithm Geeks" group. >> To post to this group, send email to algogeeks@googlegroups.com. >> To unsubscribe from this group, send email to >> algogeeks+unsubscr...@googlegroups.com. >> For more options, visit this group at >> http://groups.google.com/group/algogeeks?hl=en. >> > > > > -- > best wishes!! > Vaibhav > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algogeeks@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] BitWise Operations - For finding next multiple
hey for finding next multiple of a number x using bitwise : ( n + x -1 ) & ~(x-1) but not working for all numbers Could some one please explain me. -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To view this discussion on the web visit https://groups.google.com/d/msg/algogeeks/-/7C_Nw4RoxmEJ. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: adobe question help
this is from K&R exercise :)
Best Regards
Ashish Goel
"Think positive and find fuel in failure"
+919985813081
+919966006652
On Wed, Sep 12, 2012 at 4:14 PM, Navin Gupta wrote:
> int temp = {[1<<(j-+1)]< Here temp is a number with all the bits set between positions i & j
> [both inclusive]
> temp = ~temp;
> N = N & temp; // here we are clearing all the bits of N from
> position i to j
> temp = temp | M; // now we are taking the bit pattern from M into
> temp in the given positions
> N = N | temp;// now again we are setting the same pattern from
> temp into N.
>
> Note :- clearing bit means bit set to zero , while setting bit means bit
> is 1
>
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To view this discussion on the web visit
> https://groups.google.com/d/msg/algogeeks/-/QTXreMoSy6gJ.
>
> To post to this group, send email to algogeeks@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] java question : How can one writes a function in Java that mocks the super() call without using the super keyword?
if u'r talking about the use of super while calling constructors, u don't need to write anything.. compiler implicitly calls the no-argument constructor of superclass On Wed, Sep 12, 2012 at 10:56 AM, bharat b wrote: > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algogeeks@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] java question : How can one writes a function in Java that mocks the super() call without using the super keyword?
whats the need for such a hack On Wed, Sep 12, 2012 at 10:56 AM, bharat b wrote: > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algogeeks@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- best wishes!! Vaibhav -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Re: adobe question help
int temp = {[1<<(j-+1)]
