Re: [algogeeks] Re: Amazon Interview Question

[anshu mishra]

@pacific you are perfectly right but the order is not o(kn) its is
O(k*n*log(n)) because to get the least number u have to use priority queue
nd at every iteration (from 1 to k*n) u have to push and pop one single
element.
-- 
Anshuman Mishra
IIIT Allahabad
-

anshumishra6...@gmail.com
rit2007...@iiita.ac.in

-- 
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] exon chaining

[ganesha]

Can some one help in finding out the bug in the below code.

Input: (left,right,weight) representing intervals
Output: maximum weight of non-overlapping intervals

#include 
#include 
#include 
#include 

struct point
{
int value;
bool isLeft;
long int weight;
int index;
struct point* prev;
};

typedef struct point* NODEPTR;

bool compare (NODEPTR A,NODEPTR B)
{
return (A->value < B->value);
}

int main()
{

int numIntervals;
cin >> numIntervals;

// read the intervals and sort the list
vector points;

for (int i=0; i < numIntervals; i++)
{
NODEPTR p1 = new point;
p1->isLeft = true;
p1->weight = 0;
p1->prev = NULL;
cin >> p1->value;
points.push_back(p1);

NODEPTR p2 = new point;
p2->isLeft = false;
p2->prev = p1;
cin >> p2->value;
cin >> p2->weight;
points.push_back(p2);
}

sort(points.begin(),points.end(),compare);


vector::iterator it;
int idx=1;
for (it=points.begin(); it!=points.end(); ++it)
{
(*it)->index = idx++;
}

/*for (it=points.begin(); it!=points.end(); ++it)
{
if ((*it)->prev != NULL)
cout << (*it)->prev->value << " " << (*it)->value << " 
" << (*it)-
>weight << " " << (*it)->prev->index << endl;
}*/


int score[2*numIntervals + 1];
for (int i=0; i <= 2*numIntervals; i++)
{
score[i] = 0;
}

int i = 1;
for (it=points.begin(); it!=points.end(); ++it)
{
// right end of the interval
if (false == (*it)->isLeft)
{
int j = (*it)->prev->index;

int t1 = score[j] + (*it)->weight;
int t2 = score[i-1];

if (t1 < t2)
score[i] = t2;
else
score[i] = t1;
}
else
{
score[i] = score[i-1];
}

i++;
}

cout << "Max weight is " << score[2*numIntervals] << " " <<
2*numIntervals << endl;

return 0;
}

-- 
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: Extract Top K elements from a List of N elements based on frequency

[Dave]

@Apoorve: I don't believe that you can determine the frequency counts
in-place in O(n).

Dave

On May 9, 8:42 am, Apoorve Mohan  wrote:
> @Dave: Can there be an in-place O(n) solution to this???
>
>
>
>
>
> On Mon, May 9, 2011 at 7:01 PM, Dave  wrote:
> > @Ashish: By compress, I meant to transfer the active entries in the
> > hash table into contiguous elements of an array. Since the hash table
> > itself is probably stored in an array, it just means to go through the
> > hash table array and move the active entries to the front of the
> > array.
>
> > Dave
>
> > On May 9, 1:14 am, Ashish Goel  wrote:
> > > Dave,
> > > w.r.t statement, After all integers are processed, compress out the
> > unused
> > > hash table
> > > entries and find the Kth largest element,
>
> > > I could not understand the compress concept...are you saying something on
> > > counting sort philosophy?
> > > say the list is
>
> > > 5
> > > 4
> > > 4
> > > 3
> > > 3
> > > 3
> > > 2
> > > 2
> > > 2
> > > 2
> > > 1
> > > 1
> > > 1
> > > 1
> > > 1
>
> > > so the hash map will have
>
> > > 5,1 <5 is 1 time>
> > > 4,2,<4 is two time>
> > > 3,3,...
> > > 2,4,...
> > > 1,5...
>
> > > so if the question is to find say 3rd largest element based on frequency,
> > it
> > > would be 4
> > > This essentially means that we probably need dynamic order statistics
> > where
> > > the node contains the starting rank for a particular entry in the RBTree.
> > > Each RBTree node contains the number, its frequency and rank. then this
> > > becomes O(n) +O(lgn) i.e. O(n)
>
> > > Best Regards
> > > Ashish Goel
> > > "Think positive and find fuel in failure"
> > > +919985813081
> > > +919966006652
>
> > > On Sat, May 7, 2011 at 11:03 PM, Dave  wrote:
> > > > @Gaurav: As I understand your solution, you are finding the K largest
> > > > integers based on value, rather than the K with the highest frequency
> > > > of occurrence.
>
> > > > @Amit: Hash the integers into a hash table that includes a field for
> > > > the frequency count. When a new entry is made, set the frequency count
> > > > to 1. When an integer already is in the table, increment its count.
> > > > After all integers are processed, compress out the unused hash table
> > > > entries and find the Kth largest element. The overall algorithm can be
> > > > done in O(n).
>
> > > > Dave
>
> > > > On May 7, 12:06 pm, Gaurav Aggarwal <0007gau...@gmail.com> wrote:
> > > > > It can be done without sorting. Take the first element as pivot
> > > > > element. Calculate its position using Partition algorithm.
> > > > > If its new index is K, then on left side are top K  integers. If
> > index>K,
> > > > > apply algo on left side Else apply algo on right side.
>
> > > > > Best Case: O(1)
> > > > > Worst Case: O(n^2)
>
> > > > > But there are very less chances of worst case. It is when the list is
> > > > > already sorted.
>
> > > > > On Thu, May 5, 2011 at 1:06 AM, amit 
> > wrote:
> > > > > > Hi ,
>
> > > > > > We are give a list of integers now our task is to find the top K
> > > > > > integers in the list based on frequency.
>
> > > > > > Apart from sorting the data can there be any other algorithm?
>
> > > > > > --
> > > > > > 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.
>
> > > > > --
> > > > > Gaurav Aggarwal
> > > > > SCJP- Hide quoted text -
>
> > > > > - Show quoted text -
>
> > > > --
> > > > 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.-Hide quoted text -
>
> > > - Show quoted text -
>
> > --
> > 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.
>
> --
> regards
>
> Apoorve Mohan- Hide quoted text -
>
> - Show quoted text -

-- 
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] Candy_splitting in GCJ

[kumar anurag]

sorry, i mean smallest( not sum of smallest, as smallest means a single
element)
2
5 5
101->5
101->5
--
000  -> xor
=0 hence has a solution
so ans=(total sum -smallest)
total sum=5+5=10
smallest=5 -> as minimun(5,5)=5
so ans=(10-5)=5

2nd ex
3 5 6
011->3
101->3
---xor
110
110->6
--xor
000
=0, so has a solution
so ans=(total sum -smallest)
total sum=3+5+6=14
smallest=5 -> as minimun(3,5,6)=3
so ans=(14-3)=11

Is that clear?


On Mon, May 9, 2011 at 12:04 PM, Nikhil Agarwal
wrote:

> @Anurag  What do you mean by sum of smallest...please explain.In
>
> 2
> 5 5
>
> and
>
> 3
> 3 5 6
>
> On Mon, May 9, 2011 at 12:10 AM, kumar anurag 
> wrote:
>
>> find xor of all elements - if its equal to zeo then Case has solution
>> otherwise NO
>> for finding the soltuion just sort all the elements and find the (sum of
>> all -sum of smallest)..
>>
>>
>>
>> On Sun, May 8, 2011 at 9:50 PM, Kunal Patil  wrote:
>>
>>> Can anybody tell me How to solve candy splitting problem appeared in
>>> Google Code Jam Qualification round?
>>> I know there is solution, if XOR of all elements comes to be zero.
>>> But i wasn't able to proceed from there as I couldn't think of way how to
>>> partition that elements.
>>> (I have read solutions from other contestants but as expected they are
>>> dirty for the one who doesn't know logic behind program)
>>> So plz help...
>>>
>>> --
>>> 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.
>>>
>>
>>
>>
>> --
>> Kumar Anurag
>>
>>  --
>> 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.
>>
>
>
>
> --
> Thanks & Regards
> Nikhil Agarwal
> B.Tech. in Computer Science & Engineering
> National Institute Of Technology, Durgapur,India
> http://tech-nikk.blogspot.com
> http://beta.freshersworld.com/communities/nitd
>
>
>  --
> 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.
>



-- 
Kumar Anurag

-- 
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] Candy_splitting in GCJ

[Nikhil Agarwal]

@Anurag  What do you mean by sum of smallest...please explain.In

2
5 5

and

3
3 5 6

On Mon, May 9, 2011 at 12:10 AM, kumar anurag wrote:

> find xor of all elements - if its equal to zeo then Case has solution
> otherwise NO
> for finding the soltuion just sort all the elements and find the (sum of
> all -sum of smallest)..
>
>
>
> On Sun, May 8, 2011 at 9:50 PM, Kunal Patil  wrote:
>
>> Can anybody tell me How to solve candy splitting problem appeared in
>> Google Code Jam Qualification round?
>> I know there is solution, if XOR of all elements comes to be zero.
>> But i wasn't able to proceed from there as I couldn't think of way how to
>> partition that elements.
>> (I have read solutions from other contestants but as expected they are
>> dirty for the one who doesn't know logic behind program)
>> So plz help...
>>
>> --
>> 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.
>>
>
>
>
> --
> Kumar Anurag
>
>  --
> 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.
>



-- 
Thanks & Regards
Nikhil Agarwal
B.Tech. in Computer Science & Engineering
National Institute Of Technology, Durgapur,India
http://tech-nikk.blogspot.com
http://beta.freshersworld.com/communities/nitd

-- 
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] Re: Extract Top K elements from a List of N elements based on frequency

[Apoorve Mohan]

@Dave: Can there be an in-place O(n) solution to this???

On Mon, May 9, 2011 at 7:01 PM, Dave  wrote:

> @Ashish: By compress, I meant to transfer the active entries in the
> hash table into contiguous elements of an array. Since the hash table
> itself is probably stored in an array, it just means to go through the
> hash table array and move the active entries to the front of the
> array.
>
> Dave
>
> On May 9, 1:14 am, Ashish Goel  wrote:
> > Dave,
> > w.r.t statement, After all integers are processed, compress out the
> unused
> > hash table
> > entries and find the Kth largest element,
> >
> > I could not understand the compress concept...are you saying something on
> > counting sort philosophy?
> > say the list is
> >
> > 5
> > 4
> > 4
> > 3
> > 3
> > 3
> > 2
> > 2
> > 2
> > 2
> > 1
> > 1
> > 1
> > 1
> > 1
> >
> > so the hash map will have
> >
> > 5,1 <5 is 1 time>
> > 4,2,<4 is two time>
> > 3,3,...
> > 2,4,...
> > 1,5...
> >
> > so if the question is to find say 3rd largest element based on frequency,
> it
> > would be 4
> > This essentially means that we probably need dynamic order statistics
> where
> > the node contains the starting rank for a particular entry in the RBTree.
> > Each RBTree node contains the number, its frequency and rank. then this
> > becomes O(n) +O(lgn) i.e. O(n)
> >
> > Best Regards
> > Ashish Goel
> > "Think positive and find fuel in failure"
> > +919985813081
> > +919966006652
> >
> >
> >
> > On Sat, May 7, 2011 at 11:03 PM, Dave  wrote:
> > > @Gaurav: As I understand your solution, you are finding the K largest
> > > integers based on value, rather than the K with the highest frequency
> > > of occurrence.
> >
> > > @Amit: Hash the integers into a hash table that includes a field for
> > > the frequency count. When a new entry is made, set the frequency count
> > > to 1. When an integer already is in the table, increment its count.
> > > After all integers are processed, compress out the unused hash table
> > > entries and find the Kth largest element. The overall algorithm can be
> > > done in O(n).
> >
> > > Dave
> >
> > > On May 7, 12:06 pm, Gaurav Aggarwal <0007gau...@gmail.com> wrote:
> > > > It can be done without sorting. Take the first element as pivot
> > > > element. Calculate its position using Partition algorithm.
> > > > If its new index is K, then on left side are top K  integers. If
> index>K,
> > > > apply algo on left side Else apply algo on right side.
> >
> > > > Best Case: O(1)
> > > > Worst Case: O(n^2)
> >
> > > > But there are very less chances of worst case. It is when the list is
> > > > already sorted.
> >
> > > > On Thu, May 5, 2011 at 1:06 AM, amit 
> wrote:
> > > > > Hi ,
> >
> > > > > We are give a list of integers now our task is to find the top K
> > > > > integers in the list based on frequency.
> >
> > > > > Apart from sorting the data can there be any other algorithm?
> >
> > > > > --
> > > > > 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.
> >
> > > > --
> > > > Gaurav Aggarwal
> > > > SCJP- Hide quoted text -
> >
> > > > - Show quoted text -
> >
> > > --
> > > 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.- Hide quoted text -
> >
> > - Show quoted text -
>
> --
> 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.
>
>


-- 
regards

Apoorve Mohan

-- 
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] Re: If any one have algorithms for interviews by adnan aziz ebook... Please mail ...

[vamsi achyuth]

mail tome plz
vamsiachy...@gmail.com

On 8 May 2011 22:00, UTKARSH SRIVASTAV  wrote:

> mail me also usrivastav...@gmail.com
>
>
> On Sun, May 8, 2011 at 1:08 AM, ArPiT BhAtNaGaR <
> arpitbhatnagarm...@gmail.com> wrote:
>
>> dere is soln first person mail to first person on list n den the one who
>> gets to next & so since we all need it :P
>>
>>
>> On Fri, May 6, 2011 at 11:01 AM, vamsi achyuth wrote:
>>
>>> mail me++;
>>>
>>>
>>> On 6 May 2011 10:52, naresh kumar  wrote:
>>>
 Pleas mail to me also...
 naresh.sac...@gmail.com
 Thanks in advance


 On Fri, May 6, 2011 at 1:46 AM, Ashish Modi wrote:

> Hello,
> Can  you please mail me ashishrmod...@gmail.com
>
> Thanks in advance
>
> --
> With Regards
> Ashish
>
> --
> 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.
>>>
>>
>>
>>
>> --
>> Thanks & Regards
>>
>> Arpit Bhatnagar
>> (Computer Engineering)
>> (MNIT JAIPUR)
>>
>>  --
>> 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.
>>
>
>
>
> --
> *UTKARSH SRIVASTAV
> CSE-3
> B-Tech 2nd Year
> @MNNIT 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.

[algogeeks] Last Call for Papers: The 2011 International Conference on Foundations of Computer Science (FCS'11), USA, July 18-21, 2011

[A. M. G. Solo]

Dear Colleagues:
Please share the announcement below with those who might be interested.
Thank you very much.
Best regards, Organizing Committee

 
 
  CALL FOR PAPERS - Deadline: May 23, 2011
 
  FCS'11
    The 2011 International Conference on
   Foundations of Computer Science
  July 18-21, 2011, Las Vegas, USA
 
 
INVITATION:
This announcement is ONLY for those who MISSED the opportunity to submit
their papers in response to earlier "Call For Papers".
You are invited to submit a full paper (about 7 pages) for consideration
(see instructions below). Full papers will be considered for both,
oral presentation and publication in the conference proceedings as full
papers. In addition, after the conference, selected authors will be asked
to provide an extended version of their papers for publication consideration
in research books to be published and indexed by Springer as well as by
various journals. For a few examples of recent books and journal issues
based on WORLDCOMP (FCS is an important track of WORLDCOMP, a federated
congress in CS and CE), see the links below: (indexed by Medline, Scopus,
EMBASE, BIOSIS, Biological Abstracts, CSA, Biological Sciences and Living
Resources, Biological Sciences, and others):
http://www.springer.com/life+sciences/bioinformatics/book/978-1-4419-7045-9
http://www.springer.com/life+sciences/bioinformatics/book/978-1-4419-5912-6
+ a number of journal special issues published by BMC Genomics:
http://www.biomedcentral.com .
Abstract submissions (one/two-page) will be considered for poster
presentations and one/two-page publication in the proceedings. The
conference proceedings will be made available in printed book as well as
online.
 
INDEXING:
FCS proceedings will be indexed by Inspec / IET / The Institute for
Engineering and Technology, DBLP / CS Bibliography, and others (in the
past, all tracks of the federated congress, WORLDCOMP, in which FCS
is part of have also been included in EI Compendex/Elsevier.)
 
NOTE - Important:
This announcement is ONLY for those who MISSED the opportunity to submit
their papers in response to earlier "Call For Papers". Therefore,
authors who have already submitted papers in response to earlier "Call
For Papers" should IGNORE this announcement. (Those who have been
notified that their papers have been accepted, MUST still follow the
instructions that were emailed to them; including meeting the deadlines
mentioned in the notifications that were sent to them).
 
IMPORTANT DATES:
 
May 23, 2011:   Submission of papers for evaluation
June 6, 2011:   Notification of acceptance/not-acceptance
June 21, 2011:  Registration
July 18-21, 2011:   The 2011 International Conference on Foundations
    of Computer Science (FCS'11)
July 30, 2011:  Camera-Ready Papers Due for publication in the
    Final Edition of the proceedings.
 
SCOPE: Topics of interest include, but are not limited to, the following:
FCS'11 is composed of a number of tracks (keynote presentations,
invited talks, regular research presentations, tutorials, and workshops);
all will be held simultaneously, same location and dates: July 18-21,
2011. See below for the topical list:
 
O  Quantum Computing
O  Game theory and methods
O  Computational number theory
O  Logic in computer science
O  Theory of computing and formal systems
O  Automata and formal languages
O  Optimization methods
O  Coding theory
O  Novel data structures
O  Languages
O  Complexity theory (including circuit complexity)
O  Theory of parallel and distributed computing
O  Graph algorithms and graph drawing
O  Deduction
O  Combinatorics
O  Algorithms
O  Probabilistic and randomized methodologies
O  Approximation methods
O  Parametrized complexity (including Kolmogorov, ...)
O  Non-linear dynamics and chaos
O  Computational biology and bioinformatics
O  Cryptography
O  Novel compression methods
O  Database theory
O  Queuing methods
O  Pansystems
O  Foundations of computer security
O  Model checking and computer-aided verification
O  Models of computation
O  Computational geometry
O  Semantics, concurrency and type theory
O  Scheduling methods
O  Models of internet computing
O  Other emerging topics
 
 
USEFUL WEB LINKS:
 
The DBLP list of accepted papers of FCS 2010 appears at:
http://www.informatik.uni-trier.de/~ley/db/conf/fcs/fcs2010.html
The main web site of FCS'11 can be found at:
http://www.worldacademyofscience.org/worldcomp11/ws/conferences/fcs11
 
 
SUBMISSION OF PAPERS:
 
This announcement is ONLY for those who MISSED the opportunity to
submit their papers in response to earlier "Call For Papers". Therefore,
authors who have already submitted papers in response to earlier "Call
For Papers" should IGNORE this announcement.
 
Authors who submit papers in resp

Re: [algogeeks] Problem

[Supraja Jayakumar]

isnt this  a DP problem ?
I think its there in CLRS.

Let me know.

Cheers
Supraja J

On Wed, May 11, 2011 at 7:55 AM, Harshit Gangal wrote:

> How can we calculate the number of divisors a number have in minimum time
> or having minimum Time Complexity.
>
> --
> Harshit Gangal
> Fourth Year Undergraduate Student
> Dept. of Computer Science
> JIIT, Noida , India
>
>  --
> 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.
>



-- 
U

-- 
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] Urgent need a Business Analyst//Newark, NJ//6-12 Months Contract

[peter req]

*Urgent need a Business Analyst//Newark, NJ//6-12 Months Contract*

*
*

*Please send updated Resume at **pe...@dwlabs.com*

*Job Title:**Business Analyst*

*Duration: 6-12 Months Contract*

*Location: Newark, NJ*

*Rate: $45-50 /hr C2C Max*

*Requires F2F after phone screen*



*Job Discription:*

Looking for a *Business System Analyst III.*

A candidate with Healthcare experience in DWH/BI is required.

Healthcare not required.

Reviews, analyzes, and evaluates business systems and user needs. Formulates
systems to parallel overall business strategies. Writes detailed description
of user needs, program functions, and steps required to develop or modify
computer programs .

Documents algorithms, identifies logical system architecture, specifies
system interfaces, documents operational requirements, develops test plans .

Oversees acceptance testing, develops user guides, provides user training,
and supports the user in development of work processes.

Works under the direction of a team leader or project manager.

Requires a minimum of 3 years experience in gathering and analyzing user
requirements, and the development of functional and operational improvements
to business applications.
*
*
*
*
*Thanks and Regards..*
**
*Peter*

-- 
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] Urgent need a SAP Technical Lead//Dubiln, OH//3-6 Months Contract

[peter req]

*Urgent need a SAP Technical Lead//Dublin, OH//3-6 Months Contract*

*Please send updated Resume at pe...@dwlabs.com*

* *

*Duration: 3-6 Months Contract*

*Location: Dublin, OH*

*Rate: DOE*

* *

*Job role :* *SAP Technical Lead*

*
*

*Required skills:*

 EWM project starting with some design work, configuration and testing.

Leading small team and working with other teams to create deliverables and
execute work on timeline.

Meet milestone timelines, creation of necessary documentation through
process.



Leadership ability, SAP EWM functional and technical experience including
configuration in EWM and related ECC links, knowledge of best practices,
solid collaboration/communication skills to achieve best results.
*
*
*Thanks and Regards..*
**
*Peter*

-- 
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: Problem

[Don]

For small numbers, trial division would work. Be sure to only divide
by prime numbers. When you find one which divides your target,
increment your counter and divide the target by that number as many
times as it works. Then go on to the next prime. When the prime
squared is larger than the target, you are done. The number of
divisors is 2 times the product of the number of times each prime
divided the target.

For large numbers you need to look into methods for factoring large
numbers. You would want to start with a test to determine that the
number is composite. If not, it has 2 divisors. Then try to divide the
number by small primes. Then use one of the factoring algorithms such
as the General Number Field Sieve to find factors.

Don

On May 11, 8:55 am, Harshit Gangal  wrote:
> How can we calculate the number of divisors a number have in minimum time or
> having minimum Time Complexity.
>
> --
> Harshit Gangal
> Fourth Year Undergraduate Student
> Dept. of Computer Science
> JIIT, Noida , India

-- 
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] Urgent need a SAP.SCM.WMS//Mlville, NY//12 Months Contracts

[peter req]

*Urgent need a SAP.SCM.WMS..*

*Please send updated Resume at pe...@dwlabs.com*

* *

*Start date:** 05/15/2011*

*Duration: 12 Months Contract*

*Location: Melville, NY*

*Rate: DOE*

* *

*Job role & skill set:* Package Solution Consultant - SAP.SCM.WMS

* *

*Service area:* SAP-Forecast to Produce & Logistics S2**

*Required skills:* SAP.SCM.WMS

*Pay travel and lodging:* No



*Thanks and Regards..*
**
*Peter*

-- 
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] Urgent need a Teradata DBA//Richmond, VA//7 Months Contract

[peter req]

*Urgent need a Teradata DBA*

*Please send updated Resume at pe...@dwlabs.com*

* *

*Duration: 7 Months Contract*

*Location: Richmond, VA*

*Rate: $45 C2C Max*

* *

*Job Desperation:*

Responsible for the design, development and administration of transactional
and analytical data constructs/structures. Included within those
responsibilities are the areas of data access and delivery technologies.
Includes Oracle, Teradata. DB2, SQL Server, and DMS II.  Duties include
performance tuning, monitoring, software installs and upgrades, UNIX shell
scripting, and physical and logical database design.  Some Oracle and
Teradata databases are very large, with a minimum size of 500 GB and 1000
users. Familiarity with ETL Tools like AbInitio, DataStage, Informatica,
etc. Familiarity with Web Applications.  Hands on experience with Microsoft
Windows XP or higher version.  Hands on experience with Microsoft Office
Word and Excel.

   - Work Experience 5+ years
   - Financial Services Experience 3+ years Experience
   - Knowledge of other Oracle advanced features (RMAN, RAC, fail over
   methodologies)
   - Works independently
   - Familiarity with other data bases, ETL tools, web applications and or
   other programming languages
   - COF Experience - Desired but not required
   - Develops advanced domain specific technology solutions and guides their
   development into a final product
   - ETL experience in implementation and design

Ability to effectively communicate across multiple levels (Executive
Sponsors to team members).**



*Thanks and Regards..*
**
*Peter*

-- 
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] Urgent need a QA Test Lead//Newark Delaware//7+ Months Contract

[peter req]

*Urgent need a QA Test Lead...*

*
*

*Please send updated Resume at pe...@dwlabs.com*


*Start date: 5/16 or 5/23*

*Duration: 7+ Months Contract*

*Location: Newark Delaware*

*Rate: Open*

*
*

*Job Role & Skill set:* QA Test Lead for Bank Conversion.

*Manual Testing Lead Experience* - *test planning, test strategy, test
execution, defect management, testing metrics / reporting, etc.*

*Financial Services experience *- *preferred if back office operations in
capital markets*

*Strong communication / facilitation skills*

*Prior testing leadership roles – supervising people*

*Strong knowledge / experience using Quality Center*

*
*

*Role**:* QA Test Lead

QA Test Lead for Bank Conversion.


* **Skills:*

   - QA
   - Testing
   - Program Management
   - Delivery
   - Project Planning



Financial Services Experience.



* *

*Thanks and Regards..*
**
*Peter*

-- 
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] Regarding the Master's project

[hary rathor]

*II.P1. Design & Implementation of Distributed Computing Algorithms for
Integer Factoring & Discrete Log.*

* *

*II.P2. Design of Algorithms for Secure Cloud Computing & Data Processing.*

* *

*II.P3 Design & Analysis of Post-Quantum Cryptographic Schemes.*

* *
*II.P4. Secure Collaborative Cloud Design.*


-- 
Harish Pranami
Master Of Computer Application ,
Deptt of computer Science,
north campus , university of delhi,
New Delhi   pin no - 110007

-- 
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] Re: FUN TEASER 11 may

[anil chopra]

i will stop imaging.

On Wed, May 11, 2011 at 7:38 PM, Dave  wrote:

> I was on a river boat in Europe, and the emergency drill was to go to
> the upper deck and wait, high and dry, for the boat to sink into the
> muddy river bottom.
>
> Dave
>
> On May 11, 2:09 am, Lavesh Rawat  wrote:
> > *FUN TEASER
> >  *
> > *
> > *
> > **
> > *Imagine you are alone in a boat in the middle of a river. Suddenly the
> boat
> > starts to sink. You don't know swimming and no one is around to help you.
> > How do you get out of the situation?
> > *
> >
> > *Update Your Answers at* : Click
> > Here<
> http://dailybrainteaser.blogspot.com/2011/05/fun-teaser-11-may.html?l...>
> >
> > Solution:
> > Will be updated after 1 day
> >
> > --
> >
> > "Never explain yourself. Your friends don’t need it
> and
> > your enemies won’t believe it" .
>
> --
> 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] Urgent need a SAP.FIN.CO//Melville, NY//12 Months Contract

[peter req]

*Urgent need a SAP.FIN.CO*

*
*

*Please send updated Resume at **peter@gmail.com *

* *

*Start date:** *ASAP

*Duration: 12 Months Contract*

*Location: Melville, NY*

*Rate: DOE*

*
*

*Job Title: *CO Consultant (Landed)* *

*Job role & skill set: Package Solution Consultant - SAP.FIN.CO*

*Service area:* -Record to Report & Controls S7

*Required skills: Assists clients in the selection, implementation, and
support of SAP Enterprise Mgt Controlling Module - Financial.*

*Pay travel and lodging: No*

*
*

*
*
*Thanks and Regards..*
**
*Peter*

-- 
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] Urgent need a SAP.SCM.WMS//Melville, NY//12 Months Contract

[peter req]

*Urgent need a SAP.SCM.WMS..*

*
*

*Please send updated Resume at **peter@gmail.com *

* *

*Start date:** 05/15/2011*

*Duration: 12 Months Contract*

*Location: Melville, NY*

*Rate: DOE*

* *

*Job role & skill set: Package Solution Consultant - SAP.SCM.WMS*

*Service area:* SAP-Forecast to Produce & Logistics S2**

*Required skills: SAP.SCM.WMS*

*Pay travel and lodging: No*
*
*
*Thanks and Regards..*
**
*Peter*

-- 
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: Run for a google years

[Don]

I don't know that it takes exactly 9 operations. I ran the program on
my 3 GHz computer with n=4. It took 17 seconds. 17*3 billion / 2^32 is
11.87 clock cycles per iteration through the loop. A clock cycle is
not the same as an operation, because many machine operations take
more than one clock cycle. If the computer we are using for this
problem can run one iteration of the loop as a single operation, n=49
would be enough. If it takes 9 operations, n=48 would be enough. So it
depends on the computer, and I don't really have enough information to
say which value of n to use. However, n=49 certainly meets the
requirements of the problem, even if it is excessive.
Don

On May 11, 7:11 am, Aamir Khan  wrote:
> On Mon, May 9, 2011 at 8:31 PM, Don  wrote:
> > That would do it if you have a 64-bit type, which most implementations
> > have, but the standard does not require.
> > I think that I can make it shorter and cleaner.
>
> > int main(int argc, char* argv[])
> > {
> >    const int n=49;
> >    char a[n]={0};
> >    int p=0;
>
> >    // This line will run for 10^100 years
> >    for(; p < n; p = ++a[p] ? 0 : p + 1);
>
> >    return 0;
> > }
>
> > The array of 49 bytes provides 392 bits of state, which will take more
> > than the 2^387 cycles available in a google years.
>
> > If the processor takes 9 operations to execute the loop, a value of
> > n=48 would be sufficient.
>
> Can you elaborate the 9 operations that execution of for loop will take.
>
>  Don
>
>
>
>
>
> > On May 7, 12:24 pm, Dave  wrote:
> > > @Don: Here is my solution:
>
> > > unsigned long long int a=1;
> > > unsigned long long int b=0;
> > > unsigned long long int c=0;
> > > unsigned long long int d=0;
> > > unsigned long long int e=0;
> > > unsigned long long int f=0;
> > > unsigned long long int g=0;
> > > unsigned long long int h=0;
> > > /* here is the line "/
> > > while(a)if(!++h)if(!++g)if(!++f)if(!++e)if(!++d)if(!++c)if(!++b)++a;
>
> > > My reasoning is as follows: 1 google years ~= 10^116.5 nanoseconds ~=
> > > 2^387. Thus, incrementing an integer of length 387 bits once every
> > > nanosecond should take a google years to overflow. Seven 64-bit
> > > integers provides 448 bits of state.
>
> > > Dave
>
> > > On May 6, 11:25 am, Don  wrote:
>
> > > > What is the shortest single line in a C program which will take more
> > > > than a google years to execute, but will eventually complete? You are
> > > > permitted to have code before or after the line, but execution of the
> > > > code must remain on that line, meaning no function calls, etc. Assume
> > > > a processor which executes 1 billion operations a second.
>
> > --
> > 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.
>
> --
> Aamir Khan
> Indian Institute of Technology Roorkee,
> Roorkee, Uttarakhand,
> India , 247667
> Phone: +91 9557647357
> email:   aami...@iitr.ernet.in 
>             ak4u2...@gmail.com

-- 
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] Urgent need a Systems Engineer// McGaw Park, IL//2 Months Contract

[peter req]

*Urgent need a Systems Engineer *

*
*

*Please send updated Resume at **peter@gmail.com *

*
*

*Duration: 2 Months Contract*

*Location: McGaw Park, IL*

*Rate: DOE*

*
*

*Required skills:*

Build, Maintenance and support of Windows servers. HP hardware maintenance
requirements.


Windows Server Maintenance, Proof of concept server deployments, Support,
some billable projects , HP hardware maintenance / repair , Server
virtualization on ESX VMWare, HP Chassis maintenance
*
*
*Thanks and Regards..*
**
*Peter*

-- 
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: FUN TEASER 11 may

[Dave]

I was on a river boat in Europe, and the emergency drill was to go to
the upper deck and wait, high and dry, for the boat to sink into the
muddy river bottom.

Dave

On May 11, 2:09 am, Lavesh Rawat  wrote:
> *FUN TEASER
>  *
> *
> *
> **
> *Imagine you are alone in a boat in the middle of a river. Suddenly the boat
> starts to sink. You don't know swimming and no one is around to help you.
> How do you get out of the situation?
> *
>
> *Update Your Answers at* : Click
> Here
>
> Solution:
> Will be updated after 1 day
>
> --
>
>                     "Never explain yourself. Your friends don’t need it and
> your enemies won’t believe it" .

-- 
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] Urgent need a QA Test Lead//Newark Delaware//7+ Months Contract

[peter req]

*Urgent need a QA Test Lead..*

*
*

*Please send updated Resume at **peter@gmail.com *

*
*

*Start: 5/16 or 5/23*

*Duration: 7+ Months Contract*

*Location: Newark Delaware*

*Rate: Open*

*Job Role & Skill set:* QA Test Lead for Bank Conversion**


*Manual Testing Lead Experience *- *test planning, test strategy, test
execution, defect management, testing metrics / reporting, etc.*

*Financial Services experience *- preferred if back office operations in
capital markets

Strong communication / facilitation skills

*Prior testing leadership roles* – supervising people

*Strong knowledge / experience using Quality Center*
*
*
*Thanks and Regards..*
**
*Peter*

-- 
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] Problem

[Harshit Gangal]

How can we calculate the number of divisors a number have in minimum time or
having minimum Time Complexity.

-- 
Harshit Gangal
Fourth Year Undergraduate Student
Dept. of Computer Science
JIIT, Noida , India

-- 
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] Urgent need a Business Analyst -Datawarehousing background.//Newark, NJ//6-12 Months Contract

[peter req]

*Urgent need a Business Analyst//Newark, NJ//6-12 Months Contract*

*
*

*Please send updated Resume at peter@gmail.com *

*Job Title:**Business Analyst*

*Duration: 6-12 Months Contract*

*Location: Newark, NJ*

*Rate: $45-50 /hr C2C Max*

*Requires F2F after phone screen*



*Job Discription:*

Looking for a *Business System Analyst III.*

A candidate with Healthcare experience in DWH/BI is required.

Healthcare not required.

Reviews, analyzes, and evaluates business systems and user needs. Formulates
systems to parallel overall business strategies. Writes detailed description
of user needs, program functions, and steps required to develop or modify
computer programs .

Documents algorithms, identifies logical system architecture, specifies
system interfaces, documents operational requirements, develops test plans .


Oversees acceptance testing, develops user guides, provides user training,
and supports the user in development of work processes.

Works under the direction of a team leader or project manager.

Requires a minimum of 3 years experience in gathering and analyzing user
requirements, and the development of functional and operational improvements
to business applications.


*Thanks and Regards..*
**
*Peter*

-- 
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: GOOGLE INTERVIEW QUESTION

[bittu]

@all geeks ..check out the algo & solution with detailed explanation
here

http://shashank7s.blogspot.com/2011/03/wap-to-find-all-possible-palindromes-in.html

let me know if it will fail for any test  cases

Thanks & Regards
Shashank Mani >> " The Best Way To Escape From The problem is Solve
It"
Computer Science & Engg.
BIT Mesra

-- 
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] Re: Run for a google years

[Aamir Khan]

On Mon, May 9, 2011 at 8:31 PM, Don  wrote:

> That would do it if you have a 64-bit type, which most implementations
> have, but the standard does not require.
> I think that I can make it shorter and cleaner.
>
> int main(int argc, char* argv[])
> {
>const int n=49;
>char a[n]={0};
>int p=0;
>
>// This line will run for 10^100 years
>for(; p < n; p = ++a[p] ? 0 : p + 1);
>
>return 0;
> }
>
> The array of 49 bytes provides 392 bits of state, which will take more
> than the 2^387 cycles available in a google years.
>
> If the processor takes 9 operations to execute the loop, a value of
> n=48 would be sufficient.
>
>
Can you elaborate the 9 operations that execution of for loop will take.

 Don
>
> On May 7, 12:24 pm, Dave  wrote:
> > @Don: Here is my solution:
> >
> > unsigned long long int a=1;
> > unsigned long long int b=0;
> > unsigned long long int c=0;
> > unsigned long long int d=0;
> > unsigned long long int e=0;
> > unsigned long long int f=0;
> > unsigned long long int g=0;
> > unsigned long long int h=0;
> > /* here is the line "/
> > while(a)if(!++h)if(!++g)if(!++f)if(!++e)if(!++d)if(!++c)if(!++b)++a;
> >
> > My reasoning is as follows: 1 google years ~= 10^116.5 nanoseconds ~=
> > 2^387. Thus, incrementing an integer of length 387 bits once every
> > nanosecond should take a google years to overflow. Seven 64-bit
> > integers provides 448 bits of state.
> >
> > Dave
> >
> > On May 6, 11:25 am, Don  wrote:
> >
> > > What is the shortest single line in a C program which will take more
> > > than a google years to execute, but will eventually complete? You are
> > > permitted to have code before or after the line, but execution of the
> > > code must remain on that line, meaning no function calls, etc. Assume
> > > a processor which executes 1 billion operations a second.
> >
> >
>
> --
> 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.
>
>


-- 
Aamir Khan
Indian Institute of Technology Roorkee,
Roorkee, Uttarakhand,
India , 247667
Phone: +91 9557647357
email:   aami...@iitr.ernet.in 
ak4u2...@gmail.com

-- 
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] [brain teaser ] FUN TEASER 11 may

[Lavesh Rawat]

*FUN TEASER
 *
*
*
**
*Imagine you are alone in a boat in the middle of a river. Suddenly the boat
starts to sink. You don't know swimming and no one is around to help you.
How do you get out of the situation?
*

*Update Your Answers at* : Click
Here


Solution:
Will be updated after 1 day


-- 

"Never explain yourself. Your friends don’t need it and
your enemies won’t believe it" .

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