algogeeks@googlegroups.com wrote:
>============================================================================= >Today's Topic Summary >============================================================================= > >Group: algogeeks@googlegroups.com >Url: http://groups.google.com/group/algogeeks/topics > > - [No Subject] [6 Updates] > http://groups.google.com/group/algogeeks/t/77f49f4393ef068a > - spoj [2 Updates] > http://groups.google.com/group/algogeeks/t/95164757a844c91a > - find the sum of very large binary sequence in < O(n) [1 Update] > http://groups.google.com/group/algogeeks/t/fb031565f775ab76 > - suggestions? [3 Updates] > http://groups.google.com/group/algogeeks/t/6d41d2b8b0cb4a21 > - [No Subject] [1 Update] > http://groups.google.com/group/algogeeks/t/9361cc7061e8f971 > > >============================================================================= >Topic: [No Subject] >Url: http://groups.google.com/group/algogeeks/t/77f49f4393ef068a >============================================================================= > >---------- 1 of 6 ---------- >From: Ratan <success.rata...@gmail.com> >Date: Feb 12 06:57PM +0530 >Url: http://groups.google.com/group/algogeeks/msg/f2f4de469d55a958 > >int i=2,x; >x=(i++ + i++) * (i++ + ++i); >printf("%d",x); > >o/p: 24 >plzzz justify this output....... >-- >-- >Ratan | 3rd Year | Information Technology | NIT ALLAHABAD > > >---------- 2 of 6 ---------- >From: shady <sinv...@gmail.com> >Date: Feb 12 07:30PM +0530 >Url: http://groups.google.com/group/algogeeks/msg/d7809371a635dcc5 > >output is compiler dependent. >search archives for more info. > > > >---------- 3 of 6 ---------- >From: Rahul <raikra...@gmail.com> >Date: Feb 12 10:14PM +0530 >Url: http://groups.google.com/group/algogeeks/msg/86bd15bb688ee7ff > >rather than saying compiler dependent >I would say >please read sequence point rules >please about JSF c standards >and MISRA c standards > > > >---------- 4 of 6 ---------- >From: Kartik Sachan <kartik.sac...@gmail.com> >Date: Feb 12 11:03PM +0530 >Url: http://groups.google.com/group/algogeeks/msg/3729ac61d4f47b4e > >its a compiler depentent... > > >---------- 5 of 6 ---------- >From: Ratan <success.rata...@gmail.com> >Date: Feb 13 03:56PM +0530 >Url: http://groups.google.com/group/algogeeks/msg/32bc7ca46180a7e2 > >can any1 explain the working of the above expression in any of the >compiler..... I jzz want to knw how the computation takes place in gcc >compiler.. > > >-- >-- >Ratan | 3rd Year | Information Technology | NIT ALLAHABAD > > >---------- 6 of 6 ---------- >From: Rahul <raikra...@gmail.com> >Date: Feb 13 04:09PM +0530 >Url: http://groups.google.com/group/algogeeks/msg/41a4e8d138b0618b > >Here you go then : >++ i becomes 3 >second bracket becomes 5 ( 3+2) > > >first bracket is 4 > >4 * 5 = 20 >But you are adding ONE to i FOUR times >hence the answer you get is 4 plus the computation of previous line > >Hope I AM correct : > > > > > > >============================================================================= >Topic: spoj >Url: http://groups.google.com/group/algogeeks/t/95164757a844c91a >============================================================================= > >---------- 1 of 2 ---------- >From: atul anand <atul.87fri...@gmail.com> >Date: Feb 13 10:49AM +0530 >Url: http://groups.google.com/group/algogeeks/msg/eedbdcdc61531ec2 > >what problem are you facing ...??? > >On Thu, Feb 9, 2012 at 12:01 PM, UTKARSH SRIVASTAV > > >---------- 2 of 2 ---------- >From: UTKARSH SRIVASTAV <usrivastav...@gmail.com> >Date: Feb 13 01:41PM +0530 >Url: http://groups.google.com/group/algogeeks/msg/2fb31a88aad68cd > >not abe to get solution > > >-- >*UTKARSH SRIVASTAV >CSE-3 >B-Tech 3rd Year >@MNNIT ALLAHABAD* > > > >============================================================================= >Topic: find the sum of very large binary sequence in < O(n) >Url: http://groups.google.com/group/algogeeks/t/fb031565f775ab76 >============================================================================= > >---------- 1 of 1 ---------- >From: rspr <ravishanker....@gmail.com> >Date: Feb 12 11:12PM -0800 >Url: http://groups.google.com/group/algogeeks/msg/bc60eb7eeec4c33b > >I have two binary sequences x and y (100000 bits long)...I am taking a >bool array to store it.....I have to implement the summation >operation( at most 400000 summation operation)...while the bits patter >in changing in x and y....in my approach before performing a sum I am >taking care of a. to check is sequence A or B is changed b. is the sum >operations are continuous....so i have not to sum up it again bcz in >between there is no change in A and B > >But the output is killing....what could be the better approach to >implement the sum operation. > > > >============================================================================= >Topic: suggestions? >Url: http://groups.google.com/group/algogeeks/t/6d41d2b8b0cb4a21 >============================================================================= > >---------- 1 of 3 ---------- >From: Arun Vishwanathan <aaron.nar...@gmail.com> >Date: Feb 12 07:58AM -0800 >Url: http://groups.google.com/group/algogeeks/msg/174eaf89cb832e67 > >hi, > >I need to a final project in a course called Parallel Programming. Does >anyone have suggestions for a good topic to take up in this??Some >challenging problem maybe that is computationally intensive but can benefit >from multicore and parallel processing. > >Thanks! > > >-- > "People often say that motivation doesn't last. Well, neither does bathing >- that's why we recommend it daily." > > >---------- 2 of 3 ---------- >From: Gene <gene.ress...@gmail.com> >Date: Feb 12 03:17PM -0800 >Url: http://groups.google.com/group/algogeeks/msg/3ff6d30cbd1911d8 > >If you want to do something of practical importance that has not >already been done many times, you can look at parallel collision >detection. Collision detection is very important in physical >simulations (as in mechanical design tools, CGI, and computer games). > > > > >---------- 3 of 3 ---------- >From: Arun Vishwanathan <aaron.nar...@gmail.com> >Date: Feb 12 09:27PM -0800 >Url: http://groups.google.com/group/algogeeks/msg/5939fb64a0cb6e6a > >Thanks Gene! > > >-- > "People often say that motivation doesn't last. Well, neither does bathing >- that's why we recommend it daily." > > > >============================================================================= >Topic: [No Subject] >Url: http://groups.google.com/group/algogeeks/t/9361cc7061e8f971 >============================================================================= > >---------- 1 of 1 ---------- >From: manish patel <manispatel...@gmail.com> >Date: Feb 12 09:07PM +0530 >Url: http://groups.google.com/group/algogeeks/msg/aaac67c5f26765ad > >Let the source and destination vertices be s and t. > >We need to compute Best[s,t,10]. Best[x,y,t] is best path between x to y of >t hops. > >The recurrence is > > >Best[u,v,m] = min_{over all u'} [ max {Distance(u,u'), Best[u',v, m-1]} ] > >Best[u,v,1] is easy to calculate. > >-Courtesy: http://www.careercup.com > > > >-- >With Regards > >Manish Patel >BTech >Computer Science And Engineering >National Institute of Technology -Allahabad > > > > >-- >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.
