Re: [algogeeks] If any one have algorithms for interviews by adnan aziz ebook... Please mail ...

2011-04-18 Thread Arvinth Deenadayalan
Hi all,
This wil create copy rights violation. Please try to respect the authors note..

On 4/18/11, KK kunalkapadi...@gmail.com wrote:
 Hey plzz mail me too..

 On Apr 14, 9:29 am, Rajeev Kumar rajeevprasa...@gmail.com wrote:
 check this
 link:https://docs.google.com/viewer?a=vpid=explorerchrome=truesrcid=1B5...

 If you have any problem in access,please inform me

 On Thu, Apr 14, 2011 at 1:04 AM, Abhishek Goswami
 zeal.gosw...@gmail.comwrote:









  Hi,
  I tried to open this book in google docs and got message that file is
  not
  avaliable. does this file not available in google docs
  if yes , can anybody share this book again

  On Tue, Mar 22, 2011 at 10:41 PM, Himanshu Neema 
  potential.himansh...@gmail.com wrote:

  Turns out that I cant send file larger than 4 MB , please download it
  from
  here , let me know if you're still unable to download:

 http://dl.dropbox.com/u/2681370/Algorithms%2Bfor%2BInterviews%2B%28sc...

  have fun !

  On Tue, Mar 22, 2011 at 10:21 PM, Himanshu Neema 
  potential.himansh...@gmail.com wrote:

  Enjoy :)

  On Tue, Mar 22, 2011 at 10:09 PM, Saravanan T
  mail2sarava...@gmail.comwrote:

  ++

  On Tue, Mar 22, 2011 at 9:51 PM, Anurag atri
  anu.anurag@gmail.comwrote:

  and me too :)

  On Tue, Mar 22, 2011 at 9:28 PM, Nikhil Mishra
  mishra00...@gmail.comwrote:

  count me too

  On Tue, Mar 22, 2011 at 11:16 AM, kunal srivastav 
  kunal.shrivas...@gmail.com wrote:

  plz send it to me too

  On Tue, Mar 22, 2011 at 11:14 AM, D.N.Vishwakarma@IITR 
  deok...@gmail.com wrote:

  --

  *With Regards
  Deoki Nandan Vishwakarma
  IITR MCA
  Mathematics Department
  *

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

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

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

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

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



-- 
Sent from my mobile device

Arvinth KumarDD

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

2011-04-16 Thread Arvinth Deenadayalan
Please cc me also. Tia.

On 4/16/11, rgap rgap...@gmail.com wrote:
 Send me links too, please

 On Apr 10, 3:14 am, rahul rai raikra...@gmail.com wrote:
 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.



-- 
Sent from my mobile device

Arvinth KumarDD

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

2011-02-04 Thread Arvinth Deenadayalan
Hi all, I guess the bishops problem has a generic solution. The
formula is 2n-2. Where n is the chess board size n * n . Regarding the
arrangement one can place n bishops in one side of the board and on
the opposite side you can place n-2 bishops starting from the position
n/2 to n-2 position, and remaining(n-2)/2 can be used to fill up the
left side. Hope this is correct... Please correct me if I am wrong.

On 2/4/11, Dave dave_and_da...@juno.com wrote:
 Down two opposite sides of the board, except for the two squares on
 the same end:

 2x2: x x
  - -

 3x3: x - x
  x - x
  - - -

 4x4: x - - x
  x - - x
  x - - x
  - - - -

 Dave

 On Feb 4, 12:12 pm, Rahul Verma rahulverma@gmail.com wrote:
 @king
 Can you pls told me that wat would be the position at where bishops
 might place in the 2X2, 3X3, 4X4 chessboard.

 On Feb 4, 8:39 pm, subramania jeeva subramaniaje...@gmail.com wrote:



  Use python for arithmetic operation of large numbers.. :)

  Cheers
            ~ Jeeva ~

  On Fri, Feb 4, 2011 at 8:32 PM, Manmeet Singh mans.aus...@gmail.com
  wrote:
   C/C++ user : Take input in a char array or string(if using C++) : a
   now do string addition. : a = a + a;
   now do string substraction. : a = a - 2.

   Java user : Use BigInt class

   On Fri, Feb 4, 2011 at 8:12 PM, Logic King
   crazy.logic.k...@gmail.comwrote:

   please help me solve the problem on SPOJ

  https://www.spoj.pl/problems/BISHOPS/

   The logic of the problem is very easy i.e. 2*n-2
   but i am getting WA bcoz i am not able to deal with the large
   inputs.[?]
   plz help me how to get this AC.

   #includestdio.h
   int main()
   {
       long long int n,bmax;
       while(scanf(%lld,n)!=EOF)
       {
           if(n==1)
           printf(%d\n,1);
           else
           {
           bmax=(2*n)-2;
           printf(%lld\n,bmax);

           }
       }
   return 0;
   }

   --
   You received this message because you are subscribed to the Google
   Groups
   Algorithm Geeks group.
   To post to this group, send email to algogeeks@googlegroups.com.
   To unsubscribe from this group, send email to
   algogeeks+unsubscr...@googlegroups.comalgogeeks%2Bunsubscribe@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.comalgogeeks%2Bunsubscribe@googlegroups
   .com
   .
   For more options, visit this group at
  http://groups.google.com/group/algogeeks?hl=en.

   325.png
   1KViewDownload- Hide quoted text -

 - Show quoted text -

 --
 You received this message because you are subscribed to the Google Groups
 Algorithm Geeks group.
 To post to this group, send email to algogeeks@googlegroups.com.
 To unsubscribe from this group, send email to
 algogeeks+unsubscr...@googlegroups.com.
 For more options, visit this group at
 http://groups.google.com/group/algogeeks?hl=en.



-- 
Sent from my mobile device

Arvinth KumarDD

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