[algogeeks] Re: Google Interview Question
for eg 10, 9 most signifacnt digit of 10 is 1 and 9 is 9 so after sorting based on most significant digit is 10,9 output 910 2nd ex 2,3,5,78 most significant digit is 2,3,5,7 so out put is 78532 On May 29, 12:59 am, Vishal Jain wrote: > Can this work... > > Lets say I have following numbers > 8 9 7 4 2 121 23 21 24 27 35 79 2334 6785 > > Now repeat the last number to make all the number of equal length... > 1211 2333 2111 2444 2777 3555 7999 2334 6785 > > Sort the following numbers in descending order. > 7999 6785 ... > > Now merge the numbers based on their actual value. > 987976785.. > > I have not testing this entirely, but after seeing solution(Multiplying by > 10) at top, I though this might work better. > > Thanks & Regards > Vishal Jain > MNo: +91-9540611889 > Tweet @jainvis > Blog @ jainvish.blogspot.com > Success taste better when target achieved is bigger. > > P *We have a responsibility to the environment.* > > *Before printing this e-mail or any other document, let's ask > ourselves whether we need a hard copy.* > > > > > > > > On Sun, May 29, 2011 at 12:58 PM, Ashish Goel wrote: > > Radix/bucket sort.. > > > won't that help? > > > Best Regards > > Ashish Goel > > "Think positive and find fuel in failure" > > +919985813081 > > +919966006652 > > > On Fri, May 27, 2011 at 7:15 PM, wrote: > > >> how about this case: > > >> 9, 100 -> 9100 > >> 100 9 > >> 9100 > > >> 2, 3, 9, 78 --> > >> 78 9 3 2 > >> 9 78 3 2 > > >> I guess solution should be:- > >> sort the array of numbers in an ascending order and then check for the > >> first element in the array, if there is any other element greater than it, > >> shift all the elements one right and place that element in the left most > >> space. > > >> On Fri, May 27, 2011 at 9:37 AM, wujin chen wrote: > > >>> @Piyush， how to deal with this case :100 , 10 > > >>> 2011/5/27 Piyush Sinha > > we can work out if we sort according to the leftmost integer > > On 5/27/11, adityasir...@gmail.com wrote: > > are you kidding me. Just simple sort wont work. > > > On Fri, May 27, 2011 at 9:31 AM, radha krishnan < > > radhakrishnance...@gmail.com> wrote: > > >> sort :) > > >> On Fri, May 27, 2011 at 6:57 PM, ross > wrote: > > >>> Hi all, > > >>> Given an array of elements find the largest possible number that can > >>> be formed by using the elements of the array. > > >>> eg: 10 9 > >>> ans: 910 > > >>> 2 3 5 78 > > >>> ans: 78532 > > >>> 100 9 > > >>> ans: 9100 > > >>> -- > >>> 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. > > -- > *Piyush Sinha* > *IIIT, Allahabad* > *+91-8792136657* > *+91-7483122727* > *https://www.facebook.com/profile.php?id=10655377926* > > -- > 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 ema
Re: [algogeeks] Re: solve these puzzles.....very very urgent......thnx in advance
@youngboy you have to choose one value for variable only this is un specified condition otherwise the problem will become silly problem On Sat, Nov 27, 2010 at 2:09 PM, youngboy wrote: > some one cracked answer for N=X-Y-Z As 2 and they given explination as > follow > exp: > • 0-9 digits The basic idea is to get maximum value so if > alok > chooses anything more than or equal to 3 then he going to end up only > with a maximum of 1... example if he takes 3 and banu will choose > either y or z coz if she chooses ...x then alok will suggest remaining > values as 0 and 0... now for the second try he has to choose a value > more than 3 or else bhanu will choose that value for x and N will > become negative at the end if he chooses 4 then banu will assign > it to x thus keeping the value of X to 1.. and if chooses 5 then she > ll assign it z.. Thus value is kept to maximum of 1 > Now lets say alok chooses 2 banu will try to put it to y or z > now alok chooses 4.. then she ll choose it for x.. thus keeping the > value of N to 2.. if alok chooses 5 on second try then she ll assign > for z thus again keeping the value down to 2. > > So only 2 can be Achieved as maximum value for N if they both play > optimally. > • > > > On 27 Nov, 13:30, youngboy wrote: > > 1) Alok and Bhanu play the following min-max game. Given the > > expression, > > > > N = 12 + X*(Y - Z) > > > > where X, Y and Z are variables representing single digits (0 to 9), > > Alok would like to > > maximize N while Bhanu would like to minimize it. Towards this end, > > Alok chooses > > a single digit number and Bhanu substitutes this for a variable of her > > choice (X, Y or > > Z). Alok then chooses the next value and Bhanu, the variable to > > substitute the value. > > Finally Alok proposes the value for the remaining variable. Assuming > > both play to their > > optimal strategies, the value of N at the end of the game would be > > > > a)12 > > b)30 > > c)93 > > d)-69 > > > > 2) same question N=X-Y-Z > > > > 3)same question N=N = 38 + X*(Y – Z) > > > > plz provide me clear explination > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algoge...@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. > > -- www.tcyonline.com -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@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: Will miracle ever print ?
@aravind thanks yarr
E.srinivas
m.c.a nit durgapur
On Mon, Aug 30, 2010 at 12:34 AM, Aravind wrote:
> @srinivas ok it prints miracle.. this is hw the code will look after
> macro substitution...
> if (1 || 1 == -1 || 1 && 1 || 1 != 0)
>
> On Mon, Aug 30, 2010 at 12:18 AM, srinivas reddy > wrote:
>
>> @aravind no aravind it's working plz run my code and check it
>>
>>
>> On Mon, Aug 30, 2010 at 12:12 AM, Aravind wrote:
>>
>>> @srinivas i think miracle will not be printedas n||n is n , so m==p
>>> is n == -n and this is not possible.
>>>
>>>
>>> On Mon, Aug 30, 2010 at 12:00 AM, srinivas reddy <
>>> srinivaseev...@gmail.com> wrote:
>>>
>>>> @ aravind i wrote the code without macro isn't right plz check it..
>>>>
>>>>
>>>> On Sun, Aug 29, 2010 at 11:56 PM, Aravind
>>>> wrote:
>>>>
>>>>> @srinivas the macro will replace the 'data' with 1 || 1 and this will
>>>>> make the if condition true and print miracle.
>>>>>
>>>>>
>>>>> On Sun, Aug 29, 2010 at 11:24 PM, srinivas reddy <
>>>>> srinivaseev...@gmail.com> wrote:
>>>>>
>>>>>> @aravind this is slight modification to your one and this is
>>>>>> generalized one if it is not the way plz inform me
>>>>>>
>>>>>> #include
>>>>>> void main()
>>>>>> {
>>>>>> int m,n,p;
>>>>>> printf("enter data");
>>>>>> scanf("%d",&n);
>>>>>> m=n||n;
>>>>>> p=-n||-n;
>>>>>> if(m==p && n!=0)
>>>>>> printf("miracle");
>>>>>> }
>>>>>>
>>>>>> here i replace data with m and -data with n so the code is working
>>>>>> properlyy i think
>>>>>>
>>>>>>
>>>>>>
>>>>>> On Sun, Aug 29, 2010 at 11:04 PM, srinivas reddy <
>>>>>> srinivaseev...@gmail.com> wrote:
>>>>>>
>>>>>>> @aravind i think u are right code plzz
>>>>>>>
>>>>>>>
>>>>>>>
>>>>>>> On Sun, Aug 29, 2010 at 10:59 PM, Aravind <
>>>>>>> aravind.aravin...@gmail.com> wrote:
>>>>>>>
>>>>>>>> #define int 1 ||
>>>>>>>> #define data 1 || 1
>>>>>>>>
>>>>>>>> having theses macros will print miracle
>>>>>>>> if macros are allowed
>>>>>>>>
>>>>>>>> On Sun, Aug 29, 2010 at 10:20 PM, Manjunath Manohar <
>>>>>>>> manjunath.n...@gmail.com> wrote:
>>>>>>>>
>>>>>>>>> it will never print..and @ above..the != will never be evaluated
>>>>>>>>> ..because of the short circuiting &&
>>>>>>>>>
>>>>>>>>> --
>>>>>>>>> You received this message because you are subscribed to the Google
>>>>>>>>> Groups "Algorithm Geeks" group.
>>>>>>>>> To post to this group, send email to algoge...@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.
>>>>>>>>>
>>>>>>>>
>>>>>>>>
>>>>>>>>
>>>>>>>> --
>>>>>>>> The Power to Believe in yourself, will become the power to change
>>>>>>>> Fate.
>>>>>>>>
>>>>>>>> --
>>>>>>>> You received this message because you are subscribed to the Google
>>>>>>>> Groups "Algorithm Geeks" group.
>>>>>>>> To post to this group, send email to algoge...@googlegroups.com.
>>>>>>>> To unsubscribe from this group, send email to
>>>>>>>> algogeeks+unsubscr...@googlegroups.com
>>>>>>>> .
>>>>
[algogeeks] @aravind
plz first of all run my code it's working -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@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: Will miracle ever print ?
@aravind no aravind it's working plz run my code and check it
On Mon, Aug 30, 2010 at 12:12 AM, Aravind wrote:
> @srinivas i think miracle will not be printedas n||n is n , so m==p is
> n == -n and this is not possible.
>
>
> On Mon, Aug 30, 2010 at 12:00 AM, srinivas reddy > wrote:
>
>> @ aravind i wrote the code without macro isn't right plz check it..
>>
>>
>> On Sun, Aug 29, 2010 at 11:56 PM, Aravind wrote:
>>
>>> @srinivas the macro will replace the 'data' with 1 || 1 and this will
>>> make the if condition true and print miracle.
>>>
>>>
>>> On Sun, Aug 29, 2010 at 11:24 PM, srinivas reddy <
>>> srinivaseev...@gmail.com> wrote:
>>>
>>>> @aravind this is slight modification to your one and this is generalized
>>>> one if it is not the way plz inform me
>>>>
>>>> #include
>>>> void main()
>>>> {
>>>> int m,n,p;
>>>> printf("enter data");
>>>> scanf("%d",&n);
>>>> m=n||n;
>>>> p=-n||-n;
>>>> if(m==p && n!=0)
>>>> printf("miracle");
>>>> }
>>>>
>>>> here i replace data with m and -data with n so the code is working
>>>> properlyy i think
>>>>
>>>>
>>>>
>>>> On Sun, Aug 29, 2010 at 11:04 PM, srinivas reddy <
>>>> srinivaseev...@gmail.com> wrote:
>>>>
>>>>> @aravind i think u are right code plzz
>>>>>
>>>>>
>>>>>
>>>>> On Sun, Aug 29, 2010 at 10:59 PM, Aravind >>>> > wrote:
>>>>>
>>>>>> #define int 1 ||
>>>>>> #define data 1 || 1
>>>>>>
>>>>>> having theses macros will print miracle
>>>>>> if macros are allowed
>>>>>>
>>>>>> On Sun, Aug 29, 2010 at 10:20 PM, Manjunath Manohar <
>>>>>> manjunath.n...@gmail.com> wrote:
>>>>>>
>>>>>>> it will never print..and @ above..the != will never be evaluated
>>>>>>> ..because of the short circuiting &&
>>>>>>>
>>>>>>> --
>>>>>>> You received this message because you are subscribed to the Google
>>>>>>> Groups "Algorithm Geeks" group.
>>>>>>> To post to this group, send email to algoge...@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.
>>>>>>>
>>>>>>
>>>>>>
>>>>>>
>>>>>> --
>>>>>> The Power to Believe in yourself, will become the power to change
>>>>>> Fate.
>>>>>>
>>>>>> --
>>>>>> You received this message because you are subscribed to the Google
>>>>>> Groups "Algorithm Geeks" group.
>>>>>> To post to this group, send email to algoge...@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 algoge...@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.
>>>>
>>>
>>>
>>>
>>> --
>>> The Power to Believe in yourself, will become the power to change Fate.
>>>
>>> --
>>> You received this message because you are subscribed to the Google Groups
>>> "Algorithm Geeks" group.
>>> To post to this group, send email to algoge...@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 algoge...@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.
>>
>
>
>
> --
> The Power to Believe in yourself, will become the power to change Fate.
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, send email to algoge...@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 algoge...@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: Will miracle ever print ?
@ aravind i wrote the code without macro isn't right plz check it..
On Sun, Aug 29, 2010 at 11:56 PM, Aravind wrote:
> @srinivas the macro will replace the 'data' with 1 || 1 and this will make
> the if condition true and print miracle.
>
>
> On Sun, Aug 29, 2010 at 11:24 PM, srinivas reddy > wrote:
>
>> @aravind this is slight modification to your one and this is generalized
>> one if it is not the way plz inform me
>>
>> #include
>> void main()
>> {
>> int m,n,p;
>> printf("enter data");
>> scanf("%d",&n);
>> m=n||n;
>> p=-n||-n;
>> if(m==p && n!=0)
>> printf("miracle");
>> }
>>
>> here i replace data with m and -data with n so the code is working
>> properlyy i think
>>
>>
>>
>> On Sun, Aug 29, 2010 at 11:04 PM, srinivas reddy <
>> srinivaseev...@gmail.com> wrote:
>>
>>> @aravind i think u are right code plzz
>>>
>>>
>>>
>>> On Sun, Aug 29, 2010 at 10:59 PM, Aravind
>>> wrote:
>>>
>>>> #define int 1 ||
>>>> #define data 1 || 1
>>>>
>>>> having theses macros will print miracle
>>>> if macros are allowed
>>>>
>>>> On Sun, Aug 29, 2010 at 10:20 PM, Manjunath Manohar <
>>>> manjunath.n...@gmail.com> wrote:
>>>>
>>>>> it will never print..and @ above..the != will never be evaluated
>>>>> ..because of the short circuiting &&
>>>>>
>>>>> --
>>>>> You received this message because you are subscribed to the Google
>>>>> Groups "Algorithm Geeks" group.
>>>>> To post to this group, send email to algoge...@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.
>>>>>
>>>>
>>>>
>>>>
>>>> --
>>>> The Power to Believe in yourself, will become the power to change Fate.
>>>>
>>>> --
>>>> You received this message because you are subscribed to the Google
>>>> Groups "Algorithm Geeks" group.
>>>> To post to this group, send email to algoge...@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 algoge...@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.
>>
>
>
>
> --
> The Power to Believe in yourself, will become the power to change Fate.
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, send email to algoge...@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 algoge...@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: Will miracle ever print ?
@aravind this is slight modification to your one and this is generalized one
if it is not the way plz inform me
#include
void main()
{
int m,n,p;
printf("enter data");
scanf("%d",&n);
m=n||n;
p=-n||-n;
if(m==p && n!=0)
printf("miracle");
}
here i replace data with m and -data with n so the code is working properlyy
i think
On Sun, Aug 29, 2010 at 11:04 PM, srinivas reddy
wrote:
> @aravind i think u are right code plzz
>
>
>
> On Sun, Aug 29, 2010 at 10:59 PM, Aravind wrote:
>
>> #define int 1 ||
>> #define data 1 || 1
>>
>> having theses macros will print miracle
>> if macros are allowed
>>
>> On Sun, Aug 29, 2010 at 10:20 PM, Manjunath Manohar <
>> manjunath.n...@gmail.com> wrote:
>>
>>> it will never print..and @ above..the != will never be evaluated
>>> ..because of the short circuiting &&
>>>
>>> --
>>> You received this message because you are subscribed to the Google Groups
>>> "Algorithm Geeks" group.
>>> To post to this group, send email to algoge...@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.
>>>
>>
>>
>>
>> --
>> The Power to Believe in yourself, will become the power to change Fate.
>>
>> --
>> You received this message because you are subscribed to the Google Groups
>> "Algorithm Geeks" group.
>> To post to this group, send email to algoge...@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 algoge...@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: Will miracle ever print ?
@aravind i think u are right code plzz On Sun, Aug 29, 2010 at 10:59 PM, Aravind wrote: > #define int 1 || > #define data 1 || 1 > > having theses macros will print miracle > if macros are allowed > > On Sun, Aug 29, 2010 at 10:20 PM, Manjunath Manohar < > manjunath.n...@gmail.com> wrote: > >> it will never print..and @ above..the != will never be evaluated ..because >> of the short circuiting && >> >> -- >> You received this message because you are subscribed to the Google Groups >> "Algorithm Geeks" group. >> To post to this group, send email to algoge...@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. >> > > > > -- > The Power to Believe in yourself, will become the power to change Fate. > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algoge...@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 algoge...@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] solutions
sorry friends here i am mentioning only the solutions explanation is not possible to give all the questions if you need it plz post the question then i will send it *1*. the value of E is 4. *2*. the occupation of mr.horton is doctor *3*. thevalue of G is 2 A->8,1 B->9 G->2 E->4 C>1,8 D>6,3 F-->3,6 *4.* anitha should take from second file (i think it's very good one out of all). *5.* 3 hours ago ramesh did ramesh light the two candles. *6.* 8 members * 7. 1)E 2)A 3)B 4)C 5)B *so these are the solutions friends i hope that these two exams are helps you at least a little bit. * * -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@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] reasoning
today there will be a test on reasoning at night 10:00 PM. -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@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: Permutation of Array.
@aravind prasad cool man check this case consider the case 12 122 so if u arrange sub string(i.e; 12) as the first one so u have the best value 12 122 ok its good now suppose the case is 21 211 so according to the above way the solution is 21 211 which is not best so you have to add some more things good luck... from: srinivasa reddy eevuri M.C.A NIT DURGAPUR On Sun, Aug 22, 2010 at 11:08 AM, aravind prasad wrote: > @srinivas reddy > > i suppose u took my algo wrongly.. > > consider ur eg: 2,242 > > first digits== 2,2(same) > > 2nd digits== 2,4(here 2 remains as it is as there is no futher digit for no > 2) > > now arrange==> 2242(output)... > > my algo works correctly here too.. > > correct me if am wrong.. > > > > On Sun, Aug 22, 2010 at 10:41 AM, srinivas reddy > wrote: > > @aravind prasad > > > > ho can u arrange the numbers > > 2,202 > > > > suppose if u arrange 202 2 > > ok u wiil get the least value > > > > now 2,242 > > if u arrange in same manner as above u will get 242 2 > > which is not smallest one... > > > > so better luck next time. > > > > On Sun, Aug 22, 2010 at 8:41 AM, Aravind Prasad > wrote: > >> > >> for the method of comparison in insertion sort,, consider > >> > >> 1)compare the first digit of all nos and sort them > >> > >> 2)if they are same, go for next digit... > >> > >> > >> correct me if am wrong... > >> > >> > >> On Aug 21, 7:00 pm, Chonku wrote: > >> > Treat each number as string and make a trie out of it. For the first > >> > input > >> > [55,31,312,33], it would look like the following > >> > . > >> > /\ > >> > 3/ 5\ > >> >1/ 3\5\ > >> > 31/ 2\ 33\ \55 > >> >312\ > >> > Once we have a trie, just print it out by based on the smallest number > >> > first. In this case, the print would go as follows. > >> > > >> > 313123355 > >> > > >> > On Sat, Aug 21, 2010 at 12:53 PM, Nikhil Agarwal > >> > wrote: > >> > > >> > > >> > > >> > > Suppose the test is like: > >> > > >> > > 21 71 217 > >> > > after sorting and msb appending we get: 217 712 217 > >> > > sort: 217 217 712 > >> > > >> > > here we have 2 same elements 217 and 217 so we remove the 7 from the > >> > > following logic: > >> > > >> > > 1.if msb > lsb we delete from the 2nd 217.else > >> > > 2.we delete 7 from 1st one. > >> > > >> > > so this gives 2121771 > >> > > >> > > if it wud have been 41 200 412->412 200 412->200 412 412 > >> > > here we will remove 2 from last one.giving 20041241 instead of > >> > > 20041412 . > >> > > >> > > On Sat, Aug 21, 2010 at 12:26 PM, BALARUKESH SIVARAMAN < > >> > > sbalarukesh1...@gmail.com> wrote: > >> > > >> > >> @Nikhil > >> > >> I am clear with your first 2 algos but not with the change u > >> > >> introduced > >> > >> ie., adding a check. please give a working example > >> > > >> > >> -- > >> > >> You received this message because you are subscribed to the Google > >> > >> Groups > >> > >> "Algorithm Geeks" group. > >> > >> To post to this group, send email to algoge...@googlegroups.com. > >> > >> To unsubscribe from this group, send email to > >> > >> > >> > >> algogeeks+unsubscr...@googlegroups.com > >> > >> .com> > >> > >> . > >> > >> For more options, visit this group at > >> > >>http://groups.google.com/group/algogeeks?hl=en. > >> > > >> > > -- > >> > > Thanks & Regards > >> > > Nikhil Agarwal > >> > > Senior Undergraduate > >> > > Computer Science & Engineering, > >> > > National Institute Of Technology, Durgapur,India > >> > >http://tech-nikk.blogspot.com > >> > >http://beta.fresherswo
Re: [algogeeks] Re: Permutation of Array.
@aravind prasad ho can u arrange the numbers 2,202 suppose if u arrange 202 2 ok u wiil get the least value now 2,242 if u arrange in same manner as above u will get 242 2 which is not smallest one... so better luck next time. On Sun, Aug 22, 2010 at 8:41 AM, Aravind Prasad wrote: > for the method of comparison in insertion sort,, consider > > 1)compare the first digit of all nos and sort them > > 2)if they are same, go for next digit... > > > correct me if am wrong... > > > On Aug 21, 7:00 pm, Chonku wrote: > > Treat each number as string and make a trie out of it. For the first > input > > [55,31,312,33], it would look like the following > > . > > /\ > > 3/ 5\ > >1/ 3\5\ > > 31/ 2\ 33\ \55 > >312\ > > Once we have a trie, just print it out by based on the smallest number > > first. In this case, the print would go as follows. > > > > 313123355 > > > > On Sat, Aug 21, 2010 at 12:53 PM, Nikhil Agarwal > > wrote: > > > > > > > > > Suppose the test is like: > > > > > 21 71 217 > > > after sorting and msb appending we get: 217 712 217 > > > sort: 217 217 712 > > > > > here we have 2 same elements 217 and 217 so we remove the 7 from the > > > following logic: > > > > > 1.if msb > lsb we delete from the 2nd 217.else > > > 2.we delete 7 from 1st one. > > > > > so this gives 2121771 > > > > > if it wud have been 41 200 412->412 200 412->200 412 412 > > > here we will remove 2 from last one.giving 20041241 instead of 20041412 > . > > > > > On Sat, Aug 21, 2010 at 12:26 PM, BALARUKESH SIVARAMAN < > > > sbalarukesh1...@gmail.com> wrote: > > > > >> @Nikhil > > >> I am clear with your first 2 algos but not with the change u > introduced > > >> ie., adding a check. please give a working example > > > > >> -- > > >> You received this message because you are subscribed to the Google > Groups > > >> "Algorithm Geeks" group. > > >> To post to this group, send email to algoge...@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 > > > Senior Undergraduate > > > 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 algoge...@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 algoge...@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 algoge...@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] Permutation of Array.
@Divya chandrasekhar your algorithm doesn't satisfy the condition like
{130,11}
we can give so many examples like this so the solution may come like this
follow these rules:
1.imagine that all the numbers are equal length.(i.e;if the numbers are not
equal lenth just add 0's at right hand side to the numbers which have less
number of digits)
2.now arrange all these numbers in ascending order.
3.now remove the additionally added zero numbers from the numbers to get
original numbers
soon i wiil write the code
On Fri, Aug 20, 2010 at 2:34 AM, Divya Chandrasekar wrote:
> Never mind. This algo doesn't work properly. Apologies.
>
>
> On Thu, Aug 19, 2010 at 3:34 PM, Divya Chandrasekar
> wrote:
>
>> By the algo I gave :
>>
>> 1. Grouping -
>> 3 digits - 111
>> 1 digit - 6,5,9
>>
>> 2. Sorting within each bucket
>> 3 digits - 111
>> 1 digit - 5,6,9
>>
>> 3. Concatenation by descending order of number of digits, and increasing
>> order within each digit bucket -
>> Grouping would then be - 3 digit numbers in sorted order followed by 1
>> digit numbers in sorted order
>> 111 5 6 9
>>
>> Is there a number smaller than 111569 that can be formed with the set
>> given?
>>
>> Also, I am not sure about the complexity of this algo.
>>
>>
>> On Thu, Aug 19, 2010 at 1:56 PM, BALARUKESH SIVARAMAN <
>> sbalarukesh1...@gmail.com> wrote:
>>
>>> @Divya :
>>> Does the algo you gave work for the set { 6,5,9,111} ?
>>> I hope it doesnt... Correct me if i am wrong
>>>
>>> --
>>> You received this message because you are subscribed to the Google Groups
>>> "Algorithm Geeks" group.
>>> To post to this group, send email to algoge...@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 algoge...@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 algoge...@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] Array Problem
add one more thing to the solution suggested by nikhil i.e;count the number
of elements in array 1 and number of elements in array2 if these two values
are equal then after follow the algo proposed by nikhil agarwal..
On Wed, Aug 18, 2010 at 8:50 PM, Rais Khan wrote:
> @Chonku: Your algo seems to fail with following input.
> Arr1[]= {1,6}
> Arr2[]={7}
>
>
>
>
> On Wed, Aug 18, 2010 at 8:42 PM, Rais Khan wrote:
>
>> @Nikhil: Your algo seems to fail with following input. What do you say?
>> Arr1[]= {1,2,3}
>> Arr2[]={6}
>>
>>
>>
>>
>> On Wed, Aug 18, 2010 at 7:17 AM, Nikhil Agarwal <
>> nikhil.bhoja...@gmail.com> wrote:
>>
>>> Sum all the elements of both the arrays..let it be s1 and s2
>>> Multiply the elements and call as m1 and m2
>>> if(s1==s2) &&(m1==m2)
>>> return 1;else
>>> return 0;
>>>
>>> O(n)
>>>
>>> On Tue, Aug 17, 2010 at 11:33 PM, amit wrote:
>>>
Given two arrays of numbers, find if each of the two arrays have the
same set of integers ? Suggest an algo which can run faster than NlogN
without extra space?
--
You received this message because you are subscribed to the Google
Groups "Algorithm Geeks" group.
To post to this group, send email to algoge...@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
>>> Senior Undergraduate
>>> 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 algoge...@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 algoge...@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 algoge...@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] Longest SubSequence with Sum < K
sorry man to say that in your example so many solutions exist and one more
thing is problem is not clear try to give clear idea
On Tue, Aug 17, 2010 at 11:47 PM, amit wrote:
> Given an array, find the longest subarray which the sum of the
> subarray less or equal then the given MaxSum
> int[] FindMaxSumArray(int[] array, int maxsum)
> for example, given array: {1, -2, 4, 5, -2, 6, 7}
> maxsum=7
> the result would be: {1,-2, -2, 6}
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, send email to algoge...@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 algoge...@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] REQ;SAP FI/CO resource with Cash Disbursement experience&Insurance Industry Experience
*Hi,* *Please find the requirement below and answer ASAP with updated resume and contact details to** srini...@osairtech.com** ..Thanks a lot...** **** **Resumes with the following information will be given preference.** **Full Name:** **Current Location:** **Relocation:** **Availability:** **Work Authorization in US:** **Contact Number:** **Email:** **Rate on C2C:** **Please ensure all candidates have all skills listed under "Required Skills" on their resume* *SAP FI/CO resource with Cash Disbursement experience Client: ALL STATE Duration: 6 Months (likely to go much longer) Start: ASAP (flexible) Location: IL Rate;open ** Must have:* *Hands on Cash Disbursement Insurance Industry Experience 5 years SAP FI/CO 2 years Insurance Industry Experience We can secure interviews ASAP and have them start after the new year. – this is a 3 months + assignment Below mentioned is a bit more on the current Job requirement. Someone with SAP FI and the following CD experience is an ideal fit. Required Skills: Able to apply knowledge of insurance business processes and map them to SAP Collections and Disbursement Subledger. Familiar with data uploads, use of third party interfaces for legacy applications in Collections and Disbursement Subledger and work with customized reports. Understand business scenario requirements of Invoicing and perform the following Configuration and run the transactions. · Master data (Business Partner, Contract account and Contract account relationship, Insurance Object and Relationship and account creation Variant) · Maintain Main and Sub Transactions · Automatic G/L account determination in Collections and Disbursement · Configuration of Incoming payment ( Electronic Bank Account statement, Payment Lot, Clearing control and Clearing Variants) · Configuration of Returns and Execution of Return lots · Configuration of Payment program. - -- Regards, Srinivas Malreddy Osair Technologies * --~--~-~--~~~---~--~~ 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 -~--~~~~--~~--~--~---
[algogeeks] REQ;Crystal Reports Developer - LOCALS to MN
*HI,* *Please find the requirement below and answer ASAP with updated resume and contact details to srini...@osairtech.com ..Thanks a lot... Resumes with the following information will be given preference. Full Name: Current Location: Relocation: Availability: Work Authorization in US: Contact Number: Email: Rate on C2C: Please ensure all candidates have all skills listed under "Required Skills" on their resume* Crystal Reports Developer - LOCALS to MN Client : Cargill Location : Minnetonka, MN Duration: 8 months - LOCALS ONLY Rate : open This leaves us with the need for a Crystal developer starting on or around January 5, 2009. The expected duration of the contract would be full-time through approximately August 2009. Please let me know if you have any candidates you would like considered. A few more details about the need: Ability to multi-task and handle complex matters with minimal supervision and with excellent follow up skills Excellent communication skills (written, verbal, and presentation) Communication and understanding of complex instructions, information, and/or concepts Crystal Enterprise/Crystal Server - Version 11 Crystal Report Writer PL-SQL Syntax Business Intelligence Tools experience -- Regards, Srinivas Malreddy Osair Technologies --~--~-~--~~~---~--~~ 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 -~--~~~~--~~--~--~---
[algogeeks] REQ;Functional SAP FI/CO resource with Cash Disbursement experience.
HI, *Please find the requirement below and answer ASAP with updated resume and contact details to** [EMAIL PROTECTED] ..Thanks a lot...* ** *Resumes with the following information will be given preference.* * **Full Name:* *Current Location:* *Relocation:* *Availability:* *Work Authorization in US:* *Contact Number:* *Email:* *Rate on C2C:** * *Please ensure all candidates have all skills listed under "Required Skills" on their resume* * Functional SAP FI/CO resource with Cash Disbursement experience. Must have: Hands on Cash Disbursement Insurance Industry Experience 5 years SAP FI/CO 2 years Insurance Industry Experience Duration: 6 Months (likely to go much longer) Start: come first of the year Location: (Northbrook, IL) -- Regards, Srinivas Malreddy Osair Technologies * --~--~-~--~~~---~--~~ 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 [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~--~~~~--~~--~--~---
[algogeeks] REQ; Mainframe Prog/Analyst In-Person interview (Prefer Local NJ/NYC candidates).
*Hi, *** *Please find the requirement below and answer ASAP with updated resume and contact details to** [EMAIL PROTECTED] ..Thanks a lot...*** **** *Resumes with the following information will be given preference.*** * **Full Name:*** *Current Location:*** *Relocation:*** *Availability:*** *Work Authorization in US:*** *Contact Number:*** *Email:*** *Rate on C2C:** *** *Please ensure all candidates have all skills listed under "Required Skills" on their resume.*** ** *Need - Mainframe Prog/Analyst (NYC 6 mths + ext) Rate;open * *MUST HAVE - Claims (Healthcare) exp CICS (Cobol/II)/BMS, VSAM, Abend-Aid, CA 7/11, Dbug-aid, Easytrieve, Expediter, File-aid, Flowchart, IBM Utilities, IDCAMS, ISPF, IMS, OS/JES/JCL, Librarian, TSO/ISPF, Xpediter. Require In-Person interview (Prefer Local NJ/NYC candidates).* -- Regards, Srinivas Malreddy Osair Technologies --~--~-~--~~~---~--~~ 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 [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~--~~~~--~~--~--~---
[algogeeks] REQ;Lawson Technical
*Hi, * *Please find the requirement below and answer ASAP with updated resume and contact details to [EMAIL PROTECTED] <[EMAIL PROTECTED]>*..Thanks a lot... * **** *Resumes with the following information will be given preference.*** * **Full Name:*** *Current Location:*** *Relocation:*** *Availability:*** *Work Authorization in US:*** *Contact Number:*** *Email:*** *Rate on C2C:** *** *Please ensure all candidates have all skills listed under "Required Skills" on their resume.* *Title: Lawson Technical* *Location: Bridgewater NJ* *Duration: 3 months* * * *Lawson Technical Developer with version 8.x experience also with a strong iSeries, RPG and AS400 background.* -- Regards, Srinivas Malreddy Osair Technologies --~--~-~--~~~---~--~~ 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 [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~--~~~~--~~--~--~---
[algogeeks] REQ;ATG Architect
*Hi, *** *Please find the requirement below and answer ASAP with updated resume and contact details to** [EMAIL PROTECTED] ..Thanks a lot...*** **** *Resumes with the following information will be given preference.*** * **Full Name:*** *Current Location:*** *Relocation:*** *Availability:*** *Work Authorization in US:*** *Contact Number:*** *Email:*** *Rate on C2C:** *** *Please ensure all candidates have all skills listed under "Required Skills" on their resume.* ** * ATG Architect Various US Locations 4+ Months Rate;Depending on Experience · 8+ years Java / J2EE Programming experience · 2+ years recent experience working with ATG Commerce · Must have experience working on large, e-commerce platforms * Regards, Srinivas Malreddy Osair Technologies --~--~-~--~~~---~--~~ 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 [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~--~~~~--~~--~--~---
[algogeeks] REQ;Test Lead with Filenet exp
*Hi, Please find the requirement below and answer ASAP with updated resume and contact details to [EMAIL PROTECTED] <[EMAIL PROTECTED]> a lot... ** Resumes with the following information will be given preference. **Full Name: Current Location: Relocation: Availability: Work Authorization in US: Contact Number: Email: Rate on C2C: Please ensure all candidates have all skills listed under "Required Skills" on their resume. **Test Lead with Filenet exp Location: Falmouth, ME Duration: 9 months Rate: open skills: Must be strong in Filenet Must have at least 5+ yrs of Testing Must have excellent communication skills - -- Regards, Srinivas Malreddy Osair Technologies* --~--~-~--~~~---~--~~ 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 [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~--~~~~--~~--~--~---
[algogeeks] Technical competencies: 12 months in Colorado. The rates are a challenge-target $45/hr.
* Hi, Please find the requirement below and answer ASAP with updated resume and contact details to [EMAIL PROTECTED] ...Thanks a lot... Resumes with the following information will be given preference. Full Name: Current Location: Relocation: Availability: Work Authorization in US: Contact Number: Email: Rate on C2C: Please ensure all candidates have all skills listed under "Required Skills" on their resume * *Position 2* *Technical competencies:* *12 months in Colorado. The rates are a challenge-target $45/hr.* * * *Extensive knowledge of software development lifecycle and the Agile programming model.* *Extensive knowledge of MySQL databases.* *Thorough understanding of Storage Architecture and theory; SCSI SATA, and SAS Superior troubleshooting, problem solving and diagnostic skills. Extensive knowledge with HP partner products such as LSI, Adaptec.* *Extensive experience in Windows 2003, Windows 2008 (Longhorn), Linux (RedHat & SUSE), HP-UX 11.23/11iv2, and HP-UX 11.31/11iv3 and especially in I/O presentation/configuration in these environments.* *Supplier should have experience on high technology products such as servers, storage products etc.* *Test Engineer with "mySQL database" emphasis.* * * *Supplier shall provide test suite input to expand overall test coverage. Upon approval of said test suites, the Consultant shall establish test setups at HP facilities, plan, construct, and execute tests that qualify new devices or software into existing product lines, demonstrate that known software discrepancies have been resolved within a specific software release, and that the existing hardware and software functionality of existing product lines have not been degraded* *Supplier shall design and develop test scripts using an approved scripting language to automate and analyze the results of tests in the approved test suites.* *Supplier shall design, modify, and maintain a database and graphical user interface (GUI) used for managing test execution data and test results.* *Supplier shall design methods to analyze the performance and health of the hardware and software being tested to assure that the hardware, software and tests are running correctly.Supplier shall be required to develop and demonstrate expertise using HP test tools such as the Hazard test tool which is used to qualify HP's EVA Array Controller products.* *Supplier shall provide technical analysis to define, improve, and document enhanced testing procedures. Supplier shall propose hardware, firmware, and software needed to establish a robust testing environment for all assigned array controllers/products.* * * *Supplier shall identify issues, problems, and recommended solutions associated with any equipment configurations, software project planning, scheduling, execution, and integration activities to the HP Project Manager, or designate.* * * *Supplier shall review documentation of assigned products and recommend changes to improve the quality and accuracy of this documentation. Supplier shall recommend changes to these documents as these software products are updated. Supplier shall forward all recommendations to the HP Project Manager, or designate, for review and consideration.* * * *Supplier shall participate in technical meetings and provide problem reports and technical feedback to the development team. Supplier shall identify issues associated with quality and functionality to improve the overall effectiveness of the testing organization and the associated scripts/tools being used to perform the testing. * *Supplier shall assist the HP T&V Group in the development of the product test strategy for a new EVA product. * *Supplier shall assist HP T&V management in the execution of the test strategy, including the allocation of test responsibilities across HP sites and outside development partners, the development of test plans, and project tracking (schedule progress, test completion status, and metrics reporting). * ** * Regards, Srinivas Malreddy Osair Technologies * --~--~-~--~~~---~--~~ 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 [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~--~~~~--~~--~--~---
[algogeeks] REQ;Technical competencies 12 months in Colorado The rates are a challenge-target $45/hr
* Hi, Please find the requirement below and answer ASAP with updated resume and contact details to [EMAIL PROTECTED] ...Thanks a lot... Resumes with the following information will be given preference. Full Name: Current Location: Relocation: Availability: Work Authorization in US: Contact Number: Email: Rate on C2C: Please ensure all candidates have all skills listed under "Required Skills" on their resume * ** *Position 1* ** *Technical competencies* * 12 months in Colorado* *The rates are a challenge-target $45/hr* ** *Extensive knowledge of software development lifecycle and the Agile programming model.* *Extensive knowledge of Java and the object-oriented approach to software development.* *Extensive knowledge of Graphical User Interface (GUI) programming concepts. * *Thorough understanding of Storage Architecture and theory; SCSI SATA, and SAS. * *Superior troubleshooting, problem solving and diagnostic skills. Extensive knowledge with HP partner products such as LSI, Adaptec.* *Extensive experience in Windows 2003, Windows 2008 (Longhorn), Linux (RedHat & SUSE), HP-UX 11.23/11iv2, and HP-UX 11.31/11iv3 and especially in I/O presentation/configuration in these environments.* * * *Supplier should have experience on high technology products such as servers, storage products etc.* * * *Supplier shall provide test suite input to expand overall test coverage. Upon approval of said test suites, the Consultant Test Engineer with "Java GUI" emphasis: * *shall establish test setups at HP facilities, plan, construct, and execute tests that qualify new devices or software into existing product lines, demonstrate that known software discrepancies have been resolved within a specific software release, and that the existing hardware and software functionality of existing product lines have not been degraded* * * *The HP Project Manager, or designate, shall provide to Supplier the product release schedules and milestones to be completed in order to accomplish a successful product release. * * * *Supplier shall design and develop test scripts using an approved scripting language to automate and analyze the results of tests in the approved test suites.* *Supplier shall design, modify, and maintain a database and graphical user interface (GUI) used for managing test execution data and test results.* *Supplier shall design methods to analyze the performance and health of the hardware and software being tested to assure that the hardware, software and tests are running correctly.* *Supplier shall be required to develop and demonstrate expertise using HP test tools such as the Hazard test tool which is used to qualify HP's EVA Array Controller products.* * * *Supplier shall perform targeted regression testing at HP Project Manager or designate's direction, when controller firmware, software, test case, or device drivers change.* * * *Supplier shall provide technical analysis to defineSupplier shall provide technical analysis to define, improve, and document enhanced testing procedures. Supplier shall propose hardware, firmware, and software needed to establish a robust testing environment for all assigned array controllers/products.* * * *Supplier shall identify issues, problems, and recommended solutions associated with any equipment configurations, software project planning, scheduling, execution, and integration activities to the HP Project Manager, or designate.* * * *Supplier shall review documentation of assigned products and recommend changes to improve the quality and accuracy of this documentation. Supplier shall recommend changes to these documents as these software products are updated. Supplier shall forward all recommendations to the HP Project Manager, or designate, for review and consideration.* * * *Supplier shall participate in technical meetings and provide problem reports and technical feedback to the development team. Supplier shall identify issues associated with quality and functionality to improve the overall effectiveness of the testing organization and the associated scripts/tools being used to perform the testing. * *Supplier shall assist the HP T&V Group in the development of the product test strategy for a new EVA product. * *Supplier shall assist HP T&V management in the execution of the test strategy, including the allocation of test responsibilities across HP sites and outside development partners, the development of test plans, and project tracking (schedule progress, test completion status, and metrics reporting). * * * ** Regards, Srinivas Malreddy Osair Technologies --~--~-~--~~~---~--~~ 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 [EMAIL PROTECTED] For more options, visit
[algogeeks] REQ;J2EE Developer - Medtronic - Mounds View, MN - 1 year - LOCAL CANDIDATES ONLY!
Hi, *Please find the requirement below and answer ASAP with updated resume and contact details to [EMAIL PROTECTED] ...Thanks a lot...* ** *Resumes with the following information will be given preference.* *Full Name:* *Current Location:* *Relocation:* *Availability:* *Work Authorization in US:* *Contact Number:* *Email:* *Rate on C2C:* *Please ensure all candidates have all skills listed under "Required Skills" on their resume* *Location: Mounds View, MN* *Duration: 1 year* *Description:* * Job Title : Programmer Analyst * * Job Duties : Conducts analysis of systems specifications ,Handles multiple programming and analyst assignments concurrently,Develops code according to specifications and conducts unit testing * *Skill Sets:* *Required:* *Desired:* *Database:* *Oracle* *E-Commerce Applications:* *J2EE* * * *Eclipse* * * *Ant* * * *Hibernate* * * *Junit* * * *Toad for Oracle* * * *Spring* *Education Level:* *Undergraduate Degree* *GUI/Development Tools:* *Java* * * *SQL * *Industry Experience:* *3 - 5 Years* *Oral Communication:* *Excellent* *Program Languages:* *SQL* * * *JavaScript* * * *Java* * * *HTML* * * *PL-SQL* * * *XML* *Technical Development Specialties:* *Agile practices* *Written Communication:* *Excellent* *E-Commerce Applications:* *Struts* *Industry Experience:* *Greater than 5 Years* *Internet Platforms:* *Netscape Iplanet Web Server* * * *Change BEA WEB Logic to read: BEA WebLogic Server* *Operating System(s):* *Solaris* *Program Languages:* *DHTML* * * *UML* * * *Unix Shell Script* *Technical Development Specialties:* *Test-driven development* * * *Refactoring* * * *XP practices* *Written Communication:* *Legible Handwriting* * * *Request Notes : Local Candidates only. Please limit resumes to 3 pages. Limit 3 resumes per supplier to start. This person will be developing applications for the WebSolutions group. Agile development methodology experience required. J2EE experience required, experience with MVC frameworks, Spring, and Hibernate are required. AJAX experience is preferred. BEA Weblogic experience is preferred.* * Regards, Srinivas Malreddy Osair Technologies * * * --~--~-~--~~~---~--~~ 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 [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~--~~~~--~~--~--~---
[algogeeks] REQ;Java,WebSphere System/Production Support - - St. Paul, MN - 2 YEAR CONTRACT
* Hi, Please find the requirement below and answer ASAP with updated resume and contact details to [EMAIL PROTECTED] <[EMAIL PROTECTED]> ...Thanks a lot... Resumes with the following information will be given preference. Full Name: Current Location: Relocation: Availability: Work Authorization in US: Contact Number: Email: Rate on C2C: Please ensure all candidates have all skills listed under "Required Skills" on their resume * *Location: St. Paul, MN* *Duration: 2 years* *Rate: Keep as LOW as possible* *Description:* - *Need 4 people to rotate 24/7. During regular business hours the staff would need to be in the office. On evening and weekends they will have a page and can do the work remotely. * - *The support team will consist of a specialist per system. They currently have 3 systems and another mission critical system is coming soon. * - *The goal is to make sure the system stays up and runs smoothly. If there are issues, they'll get call and will use Remedy to produce tickets. They expect a 15-20 minute turn around time to keep production up. * - *When calls are low and it's not busy, the team will be doing enhancements * - *Skills they are looking for are Java, WebSphere (WAS 6.0 - WebSphere Application Server), SQL Server 2005 and the OS is 2003. This will all revolve around transportation, shipping and receiving and the transactions that go with S/R. EXCELLENT COMMUNICATION SKILLS ARE CRITICAL!!! * - *They would expect a 2-year resource agreement. PLEASE DO NOT SUBMIT ANYONE WHO CANNOT COMMIT 2 YEARS – Short vacations are understood * - *The plan would be a 2-week knowledge transfer with the existing staff (maybe a little more.)* -- Regards, Srinivas Malreddy Osair Technologies --~--~-~--~~~---~--~~ 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 [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~--~~~~--~~--~--~---
