[algogeeks] Re: flux redirction
Hi BOUNAIM, Where do u want to redirct ur output to? One option would be writing to a file. Questoin not clear. On Apr 10, 3:18 pm, BOUNAIM Oussama bounaim.ouss...@gmail.com wrote: Hi, I m looking for a way to redirecte my program output and input in windows thank you, sorry for my english -- 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 ] 11april
* New Door Puzzle Rearrange the letters in 'new door' to make one word. I will only accept 1 answer. * *Update Your Answers at* : Click Herehttp://dailybrainteaser.blogspot.com/2011/04/11april.html?lavesh=lavesh 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.
Re: [algogeeks] Re: flux redirction
i have found the solution it consists of using and like in linux c:exec.exe inout thank you On Mon, Apr 11, 2011 at 8:58 AM, sravanreddy001 sravanreddy...@gmail.comwrote: Hi BOUNAIM, Where do u want to redirct ur output to? One option would be writing to a file. Questoin not clear. On Apr 10, 3:18 pm, BOUNAIM Oussama bounaim.ouss...@gmail.com wrote: Hi, I m looking for a way to redirecte my program output and input in windows thank you, sorry for my english -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Finding subarray
I didnt get the step 3. Could you please elaborate this(dry run be good to
understand and bringing it for generic solution).
Also how best the complexity will be .
*Subhransu Panigrahi
*
*Mobile:* *+91-9840931538*
*Email:* subhransu.panigr...@gmail.com
On Mon, Apr 11, 2011 at 12:27 AM, ArPiT BhAtNaGaR
arpitbhatnagarm...@gmail.com wrote:
well i hav deviced a approach :
well say we hav sorted array {-1 -3 2 3 3 5 9 13 24}
say we hav to seach 6
take sum of all neg no store it -4 means we can atmost reduce any no
by 4 units means in any case we cant take no greater than 10-4=6 for finding
6.
now locate the upto position just less than we r searching for here 9
now sum up all positive upto 9 3+2+3+3+5 ie 16 now
WE hav 3 sets
(1) negative no sum
(2) postive no less than requred sum
(3) greater no set we can easily check here since only of
this set less than 10 is useful so we hav 9 check for 9 -1 -3 here
we get 6.
either way we hav 16 -4 need some thing done here
NOT PURE SOLN JUST AN IDEA THOUGH GOOD TO BE SHARE
On Thu, Mar 31, 2011 at 1:06 AM, Subhransupanigrahi
subhransu.panigr...@gmail.com wrote:
could you please point to some similar
I just want to validate the approach which I am thinking of.
Sent from my iPhone
On Mar 31, 2011, at 0:59, hammett hamm...@gmail.com wrote:
We did :-) Dynamic programming seems as the best way to approach this
kind of problem.
On Wed, Mar 30, 2011 at 12:56 AM, Subhransu
subhransu.panigr...@gmail.com wrote:
For this X = {-1,4,2,3}
Nearest will be 4 then remain is 1 but the there is no 1 so again in
recursion nearest number is 2 then it search for suitable number where
the
sum is zero so 3 is not suitable then it will pick the next closest
number
to 2 which is one and make it (5= 4 + 2 -1 )
I just propose one approach you guys also can think a better one.
Subhransu Panigrahi
Mobile: +91-9840931538
Email: subhransu.panigr...@gmail.com
On Wed, Mar 30, 2011 at 12:55 PM, Saikat Debnath
crazysai...@gmail.com
wrote:
@ Subhranshu : Your approach will fail for a case let X = {-1,4,2,3}
and
your sum is 5. You will get nearest element 4, but there is no 1 in
the set.
A DP solution will be like this :
Let a[i][j] be the 1 if using the first i elements we can get sum of
j,
and 0 otherwise. Initialise a[0][j] = 0, a[i][0] = 1;
Now a[i][j] = a[i-1][j] | a[i-1][ j - X[i] ], where X[i] is ith
element of
set X.
On Wed, Mar 30, 2011 at 12:35 PM, hammett hamm...@gmail.com wrote:
I'd try a tabular approach. Check dynamic programming. Samples like
LCS may give you a click.
On Tue, Mar 29, 2011 at 11:46 PM, Subhransu
subhransu.panigr...@gmail.com wrote:
set of integers in an array X that the sum equals a given number N
Eg. X = {-1, -3, 5, 13, 2, 24, 9, 3, 3}
Lets say the number 5 which can be formed in the following manner 5=
2
+ 3
(the values from array). If there is no match it has to return
invalid numbers.
We also have to see the complexity of the solution.
I thought of one approach but not sure if there is more approach
where
the
complexity will be minimal.
Lets say sort the array and now take number and find the closest
number
for
that.
Then in a recursion manner search for another( Lets say number '5',
it
search the list and found closest match
will be 3. Then recursively search for 3 now where closest match is
2)
Any algo with better complexity will be appreciated.
Subhransu Panigrahi
Email: subhransu.panigr...@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.
--
Cheers,
hammett
http://hammett.castleproject.org/
--
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
Re: [algogeeks] SEXY HOT PHOTOS
@Praveen * * * Don't worry abt these.Just report spam in gmail.Google will take care of him.If every one reported spam,he will be blocked* On Mon, Apr 11, 2011 at 3:15 PM, Praveen Kumar praveen97...@gmail.comwrote: Will the group owner or manager or moderator please ban this sexy bitch? On Mon, Apr 11, 2011 at 3:03 PM, SUNITHA BUSETTY sunitha.buse...@gmail.com wrote: hot lipkiss http://hotactressstoyou.blogspot.com/2011/04/lipkiss-2.html lipkiss in without dress http://hotactressstoyou.blogspot.com/2011/04/lipkiss.html seepika padukone sexy back look http://hotactressstoyou.blogspot.com/2011/04/deepika-padukone.html sexy katrina kaif http://hotactressstoyou.blogspot.com/2011/04/katrina-kaif.html beauty keerthi chawla http://hotactressstoyou.blogspot.com/2011/04/keerthi-chawla.html saloni sexy photos http://hotactressstoyou.blogspot.com/2011/04/saloni.html deeksha seth in a hot saree http://hotactressstoyou.blogspot.com/2011/04/deeksha-seth.html asin hot wallpapers http://hotactressstoyou.blogspot.com/2011/04/asin.html ramba in a red dress http://hotactressstoyou.blogspot.com/2011/04/ramba.html sexy ilieana is in scert http://hotactressstoyou.blogspot.com/2011/04/ileana.html -- 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. -- Thank You Rajeev Kumar -- 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] SEXY HOT PHOTOS
Will the group owner or manager or moderator please ban this sexy bitch? On Mon, Apr 11, 2011 at 3:03 PM, SUNITHA BUSETTY sunitha.buse...@gmail.comwrote: hot lipkiss http://hotactressstoyou.blogspot.com/2011/04/lipkiss-2.html lipkiss in without dress http://hotactressstoyou.blogspot.com/2011/04/lipkiss.html seepika padukone sexy back look http://hotactressstoyou.blogspot.com/2011/04/deepika-padukone.html sexy katrina kaif http://hotactressstoyou.blogspot.com/2011/04/katrina-kaif.html beauty keerthi chawla http://hotactressstoyou.blogspot.com/2011/04/keerthi-chawla.html saloni sexy photos http://hotactressstoyou.blogspot.com/2011/04/saloni.html deeksha seth in a hot saree http://hotactressstoyou.blogspot.com/2011/04/deeksha-seth.html asin hot wallpapers http://hotactressstoyou.blogspot.com/2011/04/asin.html ramba in a red dress http://hotactressstoyou.blogspot.com/2011/04/ramba.html sexy ilieana is in scert http://hotactressstoyou.blogspot.com/2011/04/ileana.html -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Sites for Interview Questions
www.careercup.com http://www.acetheinterview.com/ Thanks, Abhishek On Mon, Apr 11, 2011 at 3:25 PM, Akash Agrawal akash.agrawa...@gmail.comwrote: http://tech-queries.blogspot.com Regards, Akash Agrawal http://tech-queries.blogspot.com/ On Tue, Jan 18, 2011 at 10:09 PM, rahul rai raikra...@gmail.com wrote: http://www.ocf.berkeley.edu/~wwu/riddles/intro.shtml Rahul K Rai rahulpossi...@gmail.com On Tue, Jan 18, 2011 at 9:27 PM, Yellow Sapphire pukhraj7...@gmail.comwrote: Hi, Can someone suggest good books/websites/blogs for interview related questions. thanks-- YS -- 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. -- 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] Sites for Interview Questions
http://anandtechblog.blogspot.com/ On Mon, Apr 11, 2011 at 10:25 AM, abhishek jain abhi.creat...@gmail.comwrote: www.careercup.com http://www.acetheinterview.com/ Thanks, Abhishek On Mon, Apr 11, 2011 at 3:25 PM, Akash Agrawal akash.agrawa...@gmail.comwrote: http://tech-queries.blogspot.com Regards, Akash Agrawal http://tech-queries.blogspot.com/ On Tue, Jan 18, 2011 at 10:09 PM, rahul rai raikra...@gmail.com wrote: http://www.ocf.berkeley.edu/~wwu/riddles/intro.shtml Rahul K Rai rahulpossi...@gmail.com On Tue, Jan 18, 2011 at 9:27 PM, Yellow Sapphire pukhraj7...@gmail.comwrote: Hi, Can someone suggest good books/websites/blogs for interview related questions. thanks-- YS -- 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. -- 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] Re: Permutation of a string
This solution is incorrect.you are only considering ordered
permutations of all the rotations of the list ignoring random
permutations.
for eg in abcd you are missing random permutation like acbd.
here we need implementation of next_permutation() function of c++.
this http://wordaligned.org/articles/next-permutation might be
helpful.
Happy coding
On Apr 9, 12:13 am, Manish Pathak pathak@gmail.com wrote:
#include stdio.h
#include string.h
#include stdlib.h
int fact(int n);
void main()
{
char a[20],st_char;
static int i,j,k,n,ctr,main_ctr;
printf(Enter the string : );
//gets(a);
scanf(%s,a);
n=strlen(a);
if(n=1)
{
printf(please enter a valid string );
exit(0);
}
//label :
while(main_ctrn) //loop till length
{
for(i=0;i=n-2;++i) //loop to print first character of string ex abc,acb
{
ctr=0;
printf(\n);
printf(%c,a[0]);
for(j=i+1;j=n-1;j++) //take
{
printf(%c,a[j]);
ctr++;
}
if(ctr!=n-1)
{
for(k=1;k=i;k++)// print characters that left in above loop ex
from above i=2 print a[0], then j=3 print a[3], means to print a[1] and a[2]
{
printf(%c,a[k]);
ctr++;
}
}
}
st_char=a[0]; //ex for abc string this change as a[0]=b;
for(i=0;i=n-2;i++) //a[1]=c;
a[i]=a[i+1]; //a[2]=a;
a[n-1]=st_char;
main_ctr++;}
printf(\nDesigned by Manish Pathak );
}
--
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: 11april
one word On Apr 11, 12:58 pm, Lavesh Rawat lavesh.ra...@gmail.com wrote: * New Door Puzzle Rearrange the letters in 'new door' to make one word. I will only accept 1 answer. * *Update Your Answers at* : Click Herehttp://dailybrainteaser.blogspot.com/2011/04/11april.html?lavesh=lavesh 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.
Re: [algogeeks] ONLY FOR MEN
these all are coming as sparm in google group, so admin should blocked them so further no one can sparm us... On Fri, Apr 8, 2011 at 4:07 PM, Vishnutej Mylavarapu mylavarapu.vishnu...@gmail.com wrote: Hello, I dont think this is the right place for u to post these kinda things. Also,if the admin of this group is still active,kindly delete this user from the group. Thnx. -Vishnutej On Fri, Apr 8, 2011 at 4:04 PM, Manikanta Babu manikantabab...@gmail.comwrote: Hello Sunitha, Can you please stop posting these kind of things into this google group. Please go to some other appropriate group. Thanks, Mani On Fri, Apr 8, 2011 at 3:56 PM, SUNITHA BUSETTY sunitha.buse...@gmail.com wrote: hot lipkiss http://hotactressstoyou.blogspot.com/2011/04/lipkiss-2.html lipkiss in without dress http://hotactressstoyou.blogspot.com/2011/04/lipkiss.html seepika padukone sexy back look http://hotactressstoyou.blogspot.com/2011/04/deepika-padukone.html sexy katrina kaif http://hotactressstoyou.blogspot.com/2011/04/katrina-kaif.html beauty keerthi chawla http://hotactressstoyou.blogspot.com/2011/04/keerthi-chawla.html saloni sexy photos http://hotactressstoyou.blogspot.com/2011/04/saloni.html deeksha seth in a hot saree http://hotactressstoyou.blogspot.com/2011/04/deeksha-seth.html asin hot wallpapers http://hotactressstoyou.blogspot.com/2011/04/asin.html ramba in a red dress http://hotactressstoyou.blogspot.com/2011/04/ramba.html sexy ilieana is in scert http://hotactressstoyou.blogspot.com/2011/04/ileana.html -- 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, Mani http://www.sanidapa.com - The music Search engine -- 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. -- *-Vishnutej Mylavarapu.* -- 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 Umesh kewat iiit hyderabad -- 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: Interview Question
but according to the question,ptr is pointing to the second node in this case On Fri, Apr 8, 2011 at 8:55 PM, Anurag atri anu.anurag@gmail.comwrote: if innitially temp is pointing to A then there is no problem in deleting the middle node .. On Fri, Apr 8, 2011 at 4:49 PM, murthy.krishn...@gmail.com murthy.krishn...@gmail.com wrote: hii, Small correction For the second case, Consider, A - B - C - NULL Initially temp is pointing to A. Accor 2 me he has asked to reverse d list to make it as C - A by deleting B, which can be done like this, temp-next = temp-next-next; // A-C-NULL temp-next-next = temp; //A-C-A temp = temp-next; //C-A-C temp-next-next = NULL; //C-A-NULL Correct me, If am wrong Thanks, On Fri, Apr 8, 2011 at 4:47 PM, murthy.krishn...@gmail.com murthy.krishn...@gmail.com wrote: For the second case, Consider, A - B - C - NULL Accor 2 me he has asked to reverse d list to make it as C - A by deleting B, which can be done like this, temp-next = temp-next-next; // A-C-NULL temp-next-next = temp; //A-C-A temp = temp-next; //C-A-C temp-next-next = NULL; //C-A-NULL Correct me, If am wrong Thanks, now temp is poiting to On Fri, Apr 8, 2011 at 2:13 PM, cegprakash cegprak...@gmail.comwrote: for the second case it is possible only if the node contains the previous node's address. Else there should be data movement -- 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. -- P.V.N.S.S. Krishna Murthy, Intern at Broadcom Private Limited, Bangalore, Contact no:- +919845812996. -- P.V.N.S.S. Krishna Murthy, Intern at Broadcom Private Limited, Bangalore, Contact no:- +919845812996. -- 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 Anurag Atri II year Computer Engineering Delhi College Of Engineering -- 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, Kamakshi kamakshi...@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] no of occurance in two square matrix
if there is a matrix A[][] of order m and another matrix B[][] of order n such that (mn) you have to find the occurance of matrix B[][] in matrix A[][]. A[5][5]=1,2,3,4,5 5,4,1,9,7 2,1,7,3,4 6,4,8,2,7 0,2,4,5,8 B[3][3]=1,9,7 7,3,4 8,2,7 -- 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] website feedback
nice idea! :) 2011/4/8 Seçkin Can Şahin seckincansa...@gmail.com I developed a website/facebookapp. I would appreciate it if you could give feedback about it. http://apps.facebook.com/wouldloveto/ -- 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. -- Umer -- 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] [brain teaser ] 8april
a is monkey..B is human On Fri, Apr 8, 2011 at 10:33 PM, balaji a peshwa.bal...@gmail.com wrote: Both say liesA is monkey and B is a human... On Friday, April 8, 2011, Lavesh Rawat lavesh.ra...@gmail.com wrote: Island Puzzle There are people and strange monkeys on this island, and you can not tell who is who. They speak either only the truth or only lies. Who are the following two guys? A: B is a lying monkey. I am human. B: A is telling the truth. Update Your Answers at : Click Here http://dailybrainteaser.blogspot.com/2011/04/8april.html?lavesh=lavesh 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. -- Regards, Kamakshi kamakshi...@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] [Off Topic] TEDxNSIT on April 17, 2011
TEDxNSIT comes back to NSIT this year on Sunday, 17th of April 2011 starting at 9.30 am. Our web presence can be seen here http://tedxnsit.com/ You can register on this page here http://tedxnsit.com/register.php or directly on the Google Doc linked here https://spreadsheets.google.com/viewform?hl=enpli=1formkey=dDllcHg3QlZzeFFLRXhmZENBT3Fjd1E6MA#gid=0 Our Facebook page: http://www.facebook.com/pages/TEDxNSIT/100939426612501 Our Twitter account: http://twitter.com/TEDxNSIT NSIT was the first institute in Delhi to organise the TEDx event last year. Our eclectic speaker list comprised of Mr. Phil Maymin, Assistant Professor, NYU; Dr.J. Neelakantan, ex-Additional Commissioner of Income Tax, Kerala currently faculty at Indian Revenue Services Academy, Nagpur; Dr.Arun Mehta- Software Developer for Disabled kids; Mr. NG Shankar- President, Corporate Audit, Aditya Birla Group; Mr.Dinesh Kapur- Hindustan Times Climate Change Champion; Mr.Prateek Singhal- Ex Mckinsey Employee,now at Harvard Kennedy School of Government among others. This year- a much improved speaker list awaits you with the following confirmed speakers :- -Dr. Isher Judge Aluwalia, Chairperson, Indian Council for Research on International Economic Relations; -Mr KK Muhammad,Superintendent Archaeologist,ASI -Prof. Rinku Lamba, Max Weber Fellow, JNU; -Jai Arjun Singh, Noted Author and Film Critic; -Prof. B. Jayaram, Head, Super Computing Facility, IIT Delhi; -Neha Aggarwal, International Level Table Tennis Player -Shruti Pandey from the Ford Foundation -Kriti Monga of Turmeric Design -Swapnil Kant Dixit is the Executive Director for Tata Jagriti Yatra. being some of our speakers The full list of speakers and their bios can be found here: http://tedxnsit.com/speakers.php Talks are on with people like Dr. Mohan Guruswamy from the Centre for Policy Alternatives as well as Som Mittal- the President of NASSCOM who will confirm either way by Thursday! The event is free to attend but we expect you to fill in the form as thoroughly as possible! We hope a lot of you can attend this :) -- 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] [Off Topic] ICube Summit- 15th-16th April 2011
At NSIT we have always believed that apart from promoting research and development faculties among students, an institute's responsibility also lies in infusing a spirit of innovation amongst its students. With this vision, iCube was realised to spark entrepreneurial abilities among it's meritorious students by focusing on three areas-- Ideation, Innovation and Incubation. In keeping with our goal, the three day summit will see flagship events like the Innovator Showcase, where innovators from every sphere of life will present their innovations to a large audience of students seeking to be inspired and people looking to fund them. This is where the best start ups in the country show their ideas and their viability to VC's, Angel investors and industry professionals. Also being organized is the Corporate Quiz, North India's biggest business quiz and a Business Plan Competition where finalists get entrepreneurship guidelines and possible funding funder the aegis of the government's Technopreneur Promotion Programme. We'll also be having consulting and economics workshops and advertising and marketing events. The ICube Summit, to be held on 15th-16th April 2011 is an initiative that shall bring together the best start ups in Delhi, look for funding via venture capitalists, indulge in university wide innovator and gadget showcases whilst organizing North India's biggest business quiz and a Business Plan Competition where finalists get entrepreneurship guidelines and possible funding from TEPP, a government initiative to support and help budding entrepreneurs to innovate and incubate. Possibly the most important thing to note is that we are out to give huge prizes in both cash and kind- and this is one department we will surely not let you down! Our web presence can be found here http://icube.nsitonline.in/ and on facebook via the E-CELL facebook page http://www.facebook.com/ecell.nsit The specific events can be found here Business Plan Competition http://icube.nsitonline.in/business-plan/ Marketing Strategy http://icube.nsitonline.in/marketing-strategy/ Gamut http://icube.nsitonline.in/gamut/ The Corporate Quiz http://icube.nsitonline.in/corporate-quiz/ Freakonomics http://icube.nsitonline.in/freakonomics/ Ad Mad http://icube.nsitonline.in/admad/ Case Study http://icube.nsitonline.in/case-study/ Also we are organizing 3 workshops to explain to larger audience the workings of the RTI http://icube.nsitonline.in/rti-workshop/, a case study workshop http://icube.nsitonline.in/case-study-workshop/ and a B- Plan workshop http://icube.nsitonline.in/b-plan-workshop/ And finally, one of the flagship events of this E-Summit looks at innovators from every field. http://icube.nsitonline.in/innovators-showcase/ Come be a part of this attempt to ideate,innovate and incubate! -- 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] Compiler Design Help
None has been published . If you want i can give you a two links to video courses , and some set of solved questions . Which will be good for compiler design help On 4/10/11, Harshal hc4...@gmail.com wrote: someone please share the solution manual of compiler design by Aho (aka dragon book)... I would be very grateful. Thanks.. -- Harshal. -- 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. -- Rahul -- 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.
