date:20110923

Re: [algogeeks]

2011-09-23 Thread vishwa

int a=256;
imagine integer is 4 bytes.
so in memory it will look like this
--last byte..

0001--- p
---starting byte of a
but the char pointer is pointing to 1 byte of integer,
u incremented it point to 2nd byte
and assigned the new value 2(it was 1 before)

so it became 512..


0010p
  a
On Thu, Sep 22, 2011 at 6:21 PM, rohit jangid rohit.nsi...@gmail.comwrote:

 isn't that simply because if little indian endian way of storing bytes in
 memory

 initial --   0001 0..
 finally--   0010 0..

 On Sep 22, 2011 5:38 PM, Rohit Upadhyaya mailtoroh...@gmail.com wrote:
 
  int main()
  {
  int a=256;
  char *p=a;
  *++p=2;
  printf(%d,a);
  return(0);
  }
 
  --
  You received this message because you are subscribed to the Google Groups
 Algorithm Geeks group.
  To post to this group, send email to algogeeks@googlegroups.com.
  To unsubscribe from this group, send email to
 algogeeks+unsubscr...@googlegroups.com.
  For more options, visit this group at
 http://groups.google.com/group/algogeeks?hl=en.

  --
 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] Re: THANX ALGOGEEKS !!!!!!

2011-09-23 Thread Sairam Ravu

Congrats and thanks for inputs in the blog.



-- 
With love and regards,
Sairam Ravu
I M.Tech(CS)
Sri Sathya Sai Institute of Higher Learning
To live life, you must think it, measure it, experiment with it,
dance it, paint it, draw it, and calculate it

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

[algogeeks] dbms

2011-09-23 Thread Akash Mukherjee

hican ne1 suggest good books for dbms...not theory types but more of a
question bank like maybe a cracking the coding interview is for
coding/algo...

thanx :)

-- 
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] Flip kart

2011-09-23 Thread sagar pareek

thanx a ton
one more query...
was mcq is in online test?

On Fri, Sep 23, 2011 at 1:54 AM, aditya kumar
aditya.kumar130...@gmail.comwrote:

 those three question they ASKD me in interview nt in coding round n they
 are very particular abt coding


 On Fri, Sep 23, 2011 at 1:53 AM, aditya kumar 
 aditya.kumar130...@gmail.com wrote:

 11.5 fr our college
 they will hve online test .. 3 coding question and u need to attempnt any
 two ..25mcq's .. mcq;s wer mostly frm sql ..
  Q- Given a linked list find whether the linked list is palindrome or
 not. I gave him solution by modifying the linked list then i gave solution
 using extra
 space then i gave solution using recursion. First i gave complexity as
 O(n^2) using brute force. He asked me to reduce the complexity then i moved
 on to
 modify the linked list itself, he told me not to modify the linked list.
 Then i went for the extra linked list. Then he asked me not to use extra
 space and
 finally i came up with a recursive solution. And he was very much happy
 after seeing the recursive solution, i think thats wat he was looking for.
 Q- I was asked to do a level order traversal in binary tree. I used
 queue.
 Q- He asked me to do spiral traversal of a Binary Tree. I used stack and
 queues for the alternate levels.

 On Thu, Sep 22, 2011 at 7:54 PM, sagar pareek sagarpar...@gmail.comwrote:

 12.5


 On Thu, Sep 22, 2011 at 5:49 PM, Adi Srikanth adisriika...@gmail.comwrote:

 around 11.5 LPA gross
 Regards,
 Adi Srikanth.
 Mob No 9887233349
 Personal Pages: adisrikanth.co.nr



 On Thu, Sep 22, 2011 at 11:55 AM, rahul sharma rahul23111...@gmail.com
  wrote:

 wats eligibility n package?


 On Thu, Sep 22, 2011 at 12:26 AM, sagar pareek 
 sagarpar...@gmail.comwrote:

 nit allahabad


 On Thu, Sep 22, 2011 at 12:20 AM, arpit rajpurohit 
 arpit.rajpuro...@gmail.com wrote:

 which college may i know?


 On Wed, Sep 21, 2011 at 11:29 PM, sagar pareek 
 sagarpar...@gmail.com wrote:

 it is coming in my college


 On Wed, Sep 21, 2011 at 10:14 PM, arpit rajpurohit 
 arpit.rajpuro...@gmail.com wrote:

 How did u applied for it? Can you please let me know..

  On Wed, Sep 21, 2011 at 10:05 PM, sagar pareek 
 sagarpar...@gmail.com wrote:

 Hello ...
 Do anyone know the process and questions of flip kart ??

 --
 **Regards
 SAGAR PAREEK
 COMPUTER SCIENCE AND ENGINEERING
 NIT ALLAHABAD

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


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




 --
 **Regards
 SAGAR PAREEK
 COMPUTER SCIENCE AND ENGINEERING
 NIT ALLAHABAD

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


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




 --
 **Regards
 SAGAR PAREEK
 COMPUTER SCIENCE AND ENGINEERING
 NIT ALLAHABAD

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


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


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

Re: [algogeeks] Flip kart

2011-09-23 Thread sagar pareek

and would u like to please tell me the online coding questions...

On Fri, Sep 23, 2011 at 1:10 PM, sagar pareek sagarpar...@gmail.com wrote:

 thanx a ton
 one more query...
 was mcq is in online test?


 On Fri, Sep 23, 2011 at 1:54 AM, aditya kumar 
 aditya.kumar130...@gmail.com wrote:

 those three question they ASKD me in interview nt in coding round n they
 are very particular abt coding


 On Fri, Sep 23, 2011 at 1:53 AM, aditya kumar 
 aditya.kumar130...@gmail.com wrote:

 11.5 fr our college
 they will hve online test .. 3 coding question and u need to attempnt any
 two ..25mcq's .. mcq;s wer mostly frm sql ..
  Q- Given a linked list find whether the linked list is palindrome or
 not. I gave him solution by modifying the linked list then i gave solution
 using extra
 space then i gave solution using recursion. First i gave complexity as
 O(n^2) using brute force. He asked me to reduce the complexity then i moved
 on to
 modify the linked list itself, he told me not to modify the linked list.
 Then i went for the extra linked list. Then he asked me not to use extra
 space and
 finally i came up with a recursive solution. And he was very much happy
 after seeing the recursive solution, i think thats wat he was looking for.
 Q- I was asked to do a level order traversal in binary tree. I used
 queue.
 Q- He asked me to do spiral traversal of a Binary Tree. I used stack and
 queues for the alternate levels.

 On Thu, Sep 22, 2011 at 7:54 PM, sagar pareek sagarpar...@gmail.comwrote:

 12.5


 On Thu, Sep 22, 2011 at 5:49 PM, Adi Srikanth 
 adisriika...@gmail.comwrote:

 around 11.5 LPA gross
 Regards,
 Adi Srikanth.
 Mob No 9887233349
 Personal Pages: adisrikanth.co.nr



 On Thu, Sep 22, 2011 at 11:55 AM, rahul sharma 
 rahul23111...@gmail.com wrote:

 wats eligibility n package?


 On Thu, Sep 22, 2011 at 12:26 AM, sagar pareek sagarpar...@gmail.com
  wrote:

 nit allahabad


 On Thu, Sep 22, 2011 at 12:20 AM, arpit rajpurohit 
 arpit.rajpuro...@gmail.com wrote:

 which college may i know?


 On Wed, Sep 21, 2011 at 11:29 PM, sagar pareek 
 sagarpar...@gmail.com wrote:

 it is coming in my college


 On Wed, Sep 21, 2011 at 10:14 PM, arpit rajpurohit 
 arpit.rajpuro...@gmail.com wrote:

 How did u applied for it? Can you please let me know..

  On Wed, Sep 21, 2011 at 10:05 PM, sagar pareek 
 sagarpar...@gmail.com wrote:

 Hello ...
 Do anyone know the process and questions of flip kart ??

 --
 **Regards
 SAGAR PAREEK
 COMPUTER SCIENCE AND ENGINEERING
 NIT ALLAHABAD

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


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




 --
 **Regards
 SAGAR PAREEK
 COMPUTER SCIENCE AND ENGINEERING
 NIT ALLAHABAD

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


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




 --
 **Regards
 SAGAR PAREEK
 COMPUTER SCIENCE AND ENGINEERING
 NIT ALLAHABAD

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


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


  --
 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] Queries regarding Summer(2012) internship

2011-09-23 Thread Mohit kumar lal

Hello everyone,.
I am 3rd yr student from IIIT Allahabad,i want to know what
companies I can apply for summer(2012) internship and what is the process
for applying in these companies.My CGPI is around 8.Please reply as soon as
possible.
-- 
Mohit kumar lal
rit2009014
IIIT ALLAHABAD
contact@9454681805
kumarmohit...@gmail.com
mohitkumar...@yahoo.com
rit2009...@iiita.ac.in
http://profile.iiita.ac.in/rit2009014

-- 
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] D.E Shaw

2011-09-23 Thread sameer gupta

any one pleae help which type of question are asked for interns in D.E
shaw
some recent question will surely be of great help

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

[algogeeks] Re: can any body explain the output and the general method

2011-09-23 Thread him

thank you dave.
any idea how to handle such questions in placement papers?

On Sep 22, 8:06 am, Dave dave_and_da...@juno.com wrote:
 @Himanshuarora: This code violates the sequence point rule (google
 it), which essentially says that a variable can change values at most
 one time between sequence points. Therefore, the output is compiler
 dependent.

 Dave

 On Sep 21, 6:40 pm, him himanshuarora.1...@gmail.com wrote:







 http://www.ideone.com/8iPGF

  int main()
  {
  int i=5;
  printf(%d, ++i + ++i + ++i);
  return 0;

  }

  output : 22

  why 22?
  can anybody spell out the reasons and the general way in which the
  expression in evaluated in such cases?

-- 
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] Adobe final interview question

2011-09-23 Thread algo geek

You have a library provided by the vendor. All you have is header files and
library files.
Library contains the class Shape and there is whole hierarchy tree (i mean
classes which derive from this base class).
Now you want to add some function getArea (not originally present in the
class or any of its derived class) in the class Shape , you dont have the
source code.

Using this library, you have written a lot of code. Now you have to make
some changes so that, any object of Shape class (or its derived class) will
be able to call this function.
With your strategy, you should be able to override the definition of this
function in the derived class.

I think it is related to design patterns, not sure.
I gave the solution that : we will use MyShape , and use composition. i.e.
will create the object of Shape class inside this NewShape class and
interface can be made. Internally, we can call the functions of Shape
object. That will work fine. But we have to do this for the whole design
hierarchy. Secondly, if there is some changes by the vendor in future in the
library, i have to change my new design tree.
e.g.
class Shape {
   public : void draw();
  void clear();
}
class Circle : public Shape{
   public : void draw();
  void clear();
}
class Rectangle: public Shape{
   public : void draw();
  void clear();
}


class NewShape{
private Shape * obj;
   public : void draw(){ obj-draw(); }
  void clear() { obj-clear(); }
  int getArear(){
 //implementtation of getArea function
  }
}

class NewCircle : NewShape{
private Circle * obj;
   public : void draw(){ obj-draw(); }
  void clear() { obj-clear(); }
  int getArear(){
 //implementtation of getArea function specific to
circle
  }
}
class NewRectangle : NewShape{
private Rectangle * obj;
   public : void draw(){ obj-draw(); }
  void clear() { obj-clear(); }
  int getArear(){
 //implementtation of getArea function
  }
}

I know this solution is not good.. please provide a better approach for
this.
Please let me knw if anything is not clear.




Thanks in advance.

-- 
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: Adobe final interview question : small change

2011-09-23 Thread algo geek

You have a library provided by the vendor. All you have is header files and
library files.
Library contains the class Shape and there is whole hierarchy tree (i mean
classes which derive from this base class).
Now you want to add some function getArea (not originally present in the
class or any of its derived class) in the class Shape , you dont have the
source code.

Using this library, you have written a lot of code. Now you have to make
some changes so that, any object of Shape class (or its derived class) will
be able to call this function.
With your strategy, you should be able to override the definition of this
function in the derived class.

I think it is related to design patterns, not sure.
I gave the solution that : we will use MyShape , and use composition. i.e.
will create the object of Shape class inside this NewShape class and
interface can be made. Internally, we can call the functions of Shape
object. That will work fine. But we have to do this for the whole design
hierarchy. Secondly, if there is some changes by the vendor in future in the
library, i have to change my new design tree.
e.g.
class Shape {
   public : void draw();
  void clear();
}
class Circle : public Shape{
   public : void draw();
  void clear();
}
class Rectangle: public Shape{
   public : void draw();
  void clear();
}


class NewShape{
private Shape * obj;
   public : void draw(){ obj-draw(); }
  void clear() { obj-clear(); }
  int getArear(){
 //implementtation of getArea function
  }
}

class NewCircle : NewShape{
   public : void draw(){ (Circle*)obj-draw(); }
  void clear() { (Circle*)obj-clear(); }
  int getArear(){
 //implementtation of getArea function specific to
circle
  }
}
class NewRectangle : NewShape{
   public : void draw(){ (Rectangle*)obj-draw(); }
  void clear() { (Rctangle*)obj-clear(); }
  int getArear(){
 //implementtation of getArea function
  }
}

I know this solution is not good.. please provide a better approach for
this.
Please let me knw if anything is not clear.




Thanks in advance.

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

yes mcq's wer in online test .
1st coding question was to print all ascending lexical order of ()
http://chinmaylokesh.wordpress.com/2011/02/23/catalan-number-combinatorial-problem-print-all-valid-properly-opened-and-closed-n-pairs-of-parentheses/
here
is the soln
2nd was very easy array problem

On Fri, Sep 23, 2011 at 1:12 PM, sagar pareek sagarpar...@gmail.com wrote:

and would u like to please tell me the online coding questions...

On Fri, Sep 23, 2011 at 1:10 PM, sagar pareek sagarpar...@gmail.comwrote:

thanx a ton
one more query...
was mcq is in online test?

On Fri, Sep 23, 2011 at 1:54 AM, aditya kumar
aditya.kumar130...@gmail.com wrote:

those three question they ASKD me in interview nt in coding round n they
are very particular abt coding

On Fri, Sep 23, 2011 at 1:53 AM, aditya kumar
aditya.kumar130...@gmail.com wrote:

11.5 fr our college
they will hve online test .. 3 coding question and u need to attempnt
any two ..25mcq's .. mcq;s wer mostly frm sql ..
Q- Given a linked list find whether the linked list is palindrome or
not. I gave him solution by modifying the linked list then i gave solution
using extra
space then i gave solution using recursion. First i gave complexity as
O(n^2) using brute force. He asked me to reduce the complexity then i moved
on to
modify the linked list itself, he told me not to modify the linked list.
Then i went for the extra linked list. Then he asked me not to use extra
space and
finally i came up with a recursive solution. And he was very much happy
after seeing the recursive solution, i think thats wat he was looking for.
Q- I was asked to do a level order traversal in binary tree. I used
queue.
Q- He asked me to do spiral traversal of a Binary Tree. I used stack
and queues for the alternate levels.

On Thu, Sep 22, 2011 at 7:54 PM, sagar pareek sagarpar...@gmail.comwrote:

12.5

On Thu, Sep 22, 2011 at 5:49 PM, Adi Srikanth
adisriika...@gmail.comwrote:

around 11.5 LPA gross
Regards,
Adi Srikanth.
Mob No 9887233349
Personal Pages: adisrikanth.co.nr

On Thu, Sep 22, 2011 at 11:55 AM, rahul sharma
rahul23111...@gmail.com wrote:

wats eligibility n package?

On Thu, Sep 22, 2011 at 12:26 AM, sagar pareek
sagarpar...@gmail.com wrote:

nit allahabad

On Thu, Sep 22, 2011 at 12:20 AM, arpit rajpurohit
arpit.rajpuro...@gmail.com wrote:

which college may i know?

On Wed, Sep 21, 2011 at 11:29 PM, sagar pareek
sagarpar...@gmail.com wrote:

it is coming in my college

On Wed, Sep 21, 2011 at 10:14 PM, arpit rajpurohit
arpit.rajpuro...@gmail.com wrote:

How did u applied for it? Can you please let me know..

On Wed, Sep 21, 2011 at 10:05 PM, sagar pareek
sagarpar...@gmail.com wrote:

Hello ...
Do anyone know the process and questions of flip kart ??

--
**Regards
SAGAR PAREEK
COMPUTER SCIENCE AND ENGINEERING
NIT ALLAHABAD

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

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

--
**Regards
SAGAR PAREEK
COMPUTER SCIENCE AND ENGINEERING
NIT ALLAHABAD

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

--
**Regards
SAGAR PAREEK
COMPUTER SCIENCE AND ENGINEERING
NIT ALLAHABAD

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

--
You received this message because you are subscribed to the Google
Groups Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from

Re: [algogeeks] Re: can any body explain the output and the general method

2011-09-23 Thread vijay singh

Think it as following...
(++i + ++i) + ++i;
i.e.
(7 + 7) + 8;

1) calculate ++i  i.e i=6
2) calculate ++i  i.e i=7
3) calculate (i + i)  i.e (7+7) = 14 because i is now 7
4) calculate ++i  i.e i=8
5) calculate 14 + i  i.e 22

-- 
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] D.E Shaw

2011-09-23 Thread vijay singh

Prepare for CAT apti...

-- 
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: Adobe final interview question : small change

2011-09-23 Thread Prem Krishna Chettri

This is Simple query related to Factory Design Pattern... Have a look at the
Auto Registration of Factory Design pattern..


:)
Prem


On Fri, Sep 23, 2011 at 3:02 PM, algo geek geeka...@gmail.com wrote:

 You have a library provided by the vendor. All you have is header files and
 library files.
 Library contains the class Shape and there is whole hierarchy tree (i mean
 classes which derive from this base class).
 Now you want to add some function getArea (not originally present in the
 class or any of its derived class) in the class Shape , you dont have the
 source code.

 Using this library, you have written a lot of code. Now you have to make
 some changes so that, any object of Shape class (or its derived class) will
 be able to call this function.
 With your strategy, you should be able to override the definition of this
 function in the derived class.

 I think it is related to design patterns, not sure.
 I gave the solution that : we will use MyShape , and use composition. i.e.
 will create the object of Shape class inside this NewShape class and
 interface can be made. Internally, we can call the functions of Shape
 object. That will work fine. But we have to do this for the whole design
 hierarchy. Secondly, if there is some changes by the vendor in future in the
 library, i have to change my new design tree.
 e.g.
 class Shape {
public : void draw();
   void clear();
 }
 class Circle : public Shape{
public : void draw();
   void clear();
 }
 class Rectangle: public Shape{
public : void draw();
   void clear();
 }


 class NewShape{
 private Shape * obj;
public : void draw(){ obj-draw(); }
   void clear() { obj-clear(); }
   int getArear(){
  //implementtation of getArea function
   }
 }

 class NewCircle : NewShape{
public : void draw(){ (Circle*)obj-draw(); }
   void clear() { (Circle*)obj-clear(); }
   int getArear(){
  //implementtation of getArea function specific to
 circle
   }
 }
 class NewRectangle : NewShape{
public : void draw(){ (Rectangle*)obj-draw(); }
   void clear() { (Rctangle*)obj-clear(); }
   int getArear(){
  //implementtation of getArea function
   }
 }

 I know this solution is not good.. please provide a better approach for
 this.
 Please let me knw if anything is not clear.




 Thanks in advance.

 --
 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] Re: THANX ALGOGEEKS !!!!!!

2011-09-23 Thread vijay singh

Congrats bro...

-- 
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: can any body explain the output and the general method

2011-09-23 Thread vishwa

its 21 .

On Fri, Sep 23, 2011 at 4:10 PM, vijay singh vijaysinghb...@gmail.comwrote:

 Think it as following...
 (++i + ++i) + ++i;
 i.e.
 (7 + 7) + 8;

 1) calculate ++i  i.e i=6
 2) calculate ++i  i.e i=7
 3) calculate (i + i)  i.e (7+7) = 14 because i is now 7
 4) calculate ++i  i.e i=8
 5) calculate 14 + i  i.e 22

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

2011-09-23 Thread vijay singh

Yes, it already visited..

-- 
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: D.E Shaw

2011-09-23 Thread sameer gupta


its a telephonic interview ..please guide how to prepare...
and please post question if anyone had interview recently

-- 
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] Amazon online test

2011-09-23 Thread raju

hi all,

can anyone pls share the questions amazon has been asking in online written
tests.

thanks
raju

-- 
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: can any body explain the output and the general method

2011-09-23 Thread Kunal Yadav

+1 dave
Its giving 97 in my compiler.

On Fri, Sep 23, 2011 at 4:22 PM, vishwa vishwavam...@gmail.com wrote:

 its 21 .


 On Fri, Sep 23, 2011 at 4:10 PM, vijay singh vijaysinghb...@gmail.comwrote:

 Think it as following...
 (++i + ++i) + ++i;
 i.e.
 (7 + 7) + 8;

 1) calculate ++i  i.e i=6
 2) calculate ++i  i.e i=7
 3) calculate (i + i)  i.e (7+7) = 14 because i is now 7
 4) calculate ++i  i.e i=8
 5) calculate 14 + i  i.e 22

  --
 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
Kunal Yadav
(http:/sourcebit.in/ http://algoritmus.in)

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

Re: [algogeeks] Re: THANX ALGOGEEKS !!!!!!

2011-09-23 Thread siddharth srivastava

Hi

Congrats

What did you answer for elevator problem ?

On 22 September 2011 18:42, saurabh sah.saurab...@gmail.com wrote:

 thanx to all

 I have shared my interview experience at
 http://msidcinterview.blogspot.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.




-- 
Regards
Siddharth Srivastava

-- 
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] Amazon online test

2011-09-23 Thread siddharth srivastava

Hi

On 23 September 2011 17:29, raju nikutel...@gmail.com wrote:

 hi all,

 can anyone pls share the questions amazon has been asking in online written
 tests.


Search the archives
This has been answered many times in the recent days.

Best of Luck


 thanks
 raju

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

-- 
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: error in c++ program

2011-09-23 Thread Debabrata Das

prefix class as class time a,b,c,d;  worked for me.

On Fri, Sep 23, 2011 at 12:09 AM, Rajesh Kumar testalgori...@gmail.com wrote:
 thanx Rahul

 On Thu, Sep 22, 2011 at 11:54 PM, abhinav gupta abhinav@gmail.com
 wrote:

 @rahul
 +1

 On Thu, Sep 22, 2011 at 11:20 PM, rahul vatsa vatsa.ra...@gmail.com
 wrote:

 time is a keyword in c/cpp, change time to any other string in ur code nd
 it will work.


 On Thu, Sep 22, 2011 at 12:27 PM, Rajesh Kumar testalgori...@gmail.com
 wrote:

 not working by changes provide by you

 On Thu, Sep 22, 2011 at 9:42 PM, payal gupta gpt.pa...@gmail.com
 wrote:

 #includeiostream.h
 class time
 {
 int m;
 int h;
 public:
 void set(int,int);
 void sum(time,time,time);
 void display();
 };
 void time::set(int x,int y)
 {
 m=x;
 h=y;
 }
 void time::sum(time t1,time t2,time t3)
 {
 m=t1.m+t2.m+t3.m;
 h=t1.h+t2.h+t3.h;
 }
 void time::display(void)
 {
 coutminute==mendl;
 couthours==hendl;
 }
 int main()
 {
 time a,b,c,d;
 a.set(1,2);
 b.set(2,4);
 c.set(4,8);
 d.sum(a,b,c);
 //display
 a.display();
 b.display();
 c.display();
 d.display();
 return 0;
 }



 dis does works...chk it  out!!!

 Regards,
 PAYAL GUPTA,
 CSE-3rd yr,
 NIT_B
 On Thu, Sep 22, 2011 at 9:28 PM, Don dondod...@gmail.com wrote:

 Give us some help. What is the error? Syntax error? Logic error?
 Runtime error?

 On Sep 22, 10:47 am, Rajesh Kumar testalgori...@gmail.com wrote:
  how we can remove error ?
  #includeiostream
  using namespace std;
  class time
  {
  int m;
  int h;
  public:
  void set(int,int);
  void sum(time,time,time);
  void display();};
 
  void time::set(int x,int y)
  {
  m=x;
  h=y;}
 
  void time::sum(time t1,time t2,time t3)
  {
  m=t1.m+t2.m+t3.m;
  h=t1.h+t2.h+t3.h;}
 
  void time::display(void)
  {
  coutminute==mendl;
  couthours==hendl;}
 
  int main()
  {
  time a,b,c,d;
  a.set(1,2);
  b.set(2,4);
  c.set(4,8);
  d.sum(a,b,c);
  //display
  a.display();
  b.display();
  c.display();
  d.display();
 
  }
 
  Regards
  Rajesh 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.


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

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


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

2011-09-23 Thread Anil Arya

see the concept of LITTLE ENDIAN and BIG ENDIAN

On Fri, Sep 23, 2011 at 12:23 PM, vishwa vishwavam...@gmail.com wrote:

 int a=256;
 imagine integer is 4 bytes.
 so in memory it will look like this
 --last byte..
 
 0001--- p
 ---starting byte of a
 but the char pointer is pointing to 1 byte of integer,
 u incremented it point to 2nd byte
 and assigned the new value 2(it was 1 before)

 so it became 512..
 
 
 0010p
   a

 On Thu, Sep 22, 2011 at 6:21 PM, rohit jangid rohit.nsi...@gmail.comwrote:

 isn't that simply because if little indian endian way of storing bytes in
 memory

 initial --   0001 0..
 finally--   0010 0..

 On Sep 22, 2011 5:38 PM, Rohit Upadhyaya mailtoroh...@gmail.com
 wrote:
 
  int main()
  {
  int a=256;
  char *p=a;
  *++p=2;
  printf(%d,a);
  return(0);
  }
 
  --
  You received this message because you are subscribed to the Google
 Groups Algorithm Geeks group.
  To post to this group, send email to algogeeks@googlegroups.com.
  To unsubscribe from this group, send email to
 algogeeks+unsubscr...@googlegroups.com.
  For more options, visit this group at
 http://groups.google.com/group/algogeeks?hl=en.

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




-- 
*Anil  Arya,
Computer Science *
*Motilal Nehru National Institute of Technology,Allahabad .
*

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

Re: [algogeeks] Re: MICROSOFT IDC

2011-09-23 Thread sagar pareek

congrates dude

On Thu, Sep 22, 2011 at 7:26 PM, Sanjay Rajpal srn...@gmail.com wrote:

 Saurabh : Thank u very much :)

 Sanju
 :)



 On Thu, Sep 22, 2011 at 6:15 AM, saurabh sah.saurab...@gmail.com wrote:

 thanx to all

 @sanjay I have shared my interview experience at
 http://msidcinterview.blogspot.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
SAGAR PAREEK
COMPUTER SCIENCE AND ENGINEERING
NIT ALLAHABAD

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

Re: [algogeeks] Doubts about realloc

2011-09-23 Thread sukran dhawan

yes realloc can be used to shrink the allocated memory. yes the remaining
memory will be freed.
IF we want to allocate more memory and if there is no enough room in that
particular boundary,  i will allocate a new block ,copy the contents and
free the previous contents

On Thu, Sep 22, 2011 at 10:31 PM, Ankuj Gupta ankuj2...@gmail.com wrote:

 Hi

 I have a doubt in functioning of realloc. Can we use realloc to shrink
 the memory already allocated ? If yes, will it also free the left over
 memory or programmer has to do it ? Also, while reallocating if it has
 to move to some other location does the earlier location gets freed or
 is it implementation dependent

 Thanks
 Ankuj

 --
 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] What is the maximum no. of arguments that can be given in a command line in C...??

2011-09-23 Thread amrit harry

solve it.

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

[algogeeks] Yahoo! visit

2011-09-23 Thread vartika aggarwal

If anyone has any idea about the process of Ebay and/or Yahoo! (especially
the questions asked), kindly post it here soon...it's visiting our campus on
Sunday..
Please help!

-- 
Regards

Vartika Aggarwal
Undergraduate Student
IT Department
NSIT, Dwarka

-- 
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: MICROSOFT IDC

2011-09-23 Thread Nitin Garg

Congrats Saurabh.

On Fri, Sep 23, 2011 at 7:18 PM, sagar pareek sagarpar...@gmail.com wrote:

 congrates dude


 On Thu, Sep 22, 2011 at 7:26 PM, Sanjay Rajpal srn...@gmail.com wrote:

 Saurabh : Thank u very much :)

 Sanju
 :)



 On Thu, Sep 22, 2011 at 6:15 AM, saurabh sah.saurab...@gmail.com wrote:

 thanx to all

 @sanjay I have shared my interview experience at
 http://msidcinterview.blogspot.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
 SAGAR PAREEK
 COMPUTER SCIENCE AND ENGINEERING
 NIT ALLAHABAD

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




-- 
Nitin Garg

Personality can open doors, but only Character can keep them open

-- 
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] What is the maximum no. of arguments that can be given in a command line in C...??

2011-09-23 Thread rahul sharma

two

On Fri, Sep 23, 2011 at 7:25 PM, amrit harry dabbcomput...@gmail.comwrote:

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

Re: [algogeeks] What is the maximum no. of arguments that can be given in a command line in C...??

2011-09-23 Thread amrit harry

R U SUREI DONT THINK SOO...? HAD U CHKED IT...?

On Fri, Sep 23, 2011 at 7:58 PM, rahul sharma rahul23111...@gmail.comwrote:

 two

 On Fri, Sep 23, 2011 at 7:25 PM, amrit harry dabbcomput...@gmail.comwrote:

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




-- 
AMRIT

-- 
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] What is the maximum no. of arguments that can be given in a command line in C...??

2011-09-23 Thread sukran dhawan

infinite i think not two... u can give many

On Fri, Sep 23, 2011 at 8:01 PM, amrit harry dabbcomput...@gmail.comwrote:

 R U SUREI DONT THINK SOO...? HAD U CHKED IT...?


 On Fri, Sep 23, 2011 at 7:58 PM, rahul sharma rahul23111...@gmail.comwrote:

 two

 On Fri, Sep 23, 2011 at 7:25 PM, amrit harry dabbcomput...@gmail.comwrote:

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




 --
 AMRIT

 --
 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] Re: D.E Shaw

2011-09-23 Thread Aditya Virmani

vich coll?

On Fri, Sep 23, 2011 at 5:28 PM, sameer gupta gupta.sameer...@gmail.comwrote:


 its a telephonic interview ..please guide how to prepare...
 and please post question if anyone had interview recently

 --
 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] plz reply quickly

2011-09-23 Thread Aditya Virmani

in arrays i guess it can be simply analysed checking the last element of
array(which can be obtained by sizeof)  checking how the entries are filled
inn the array...
in linked list hair  tortoise rule...initialize two pointers...one's step
size:1, second's step size two...  run through the linked list, if they
meet newhere ...it contains a loop or circular list.

On Thu, Sep 22, 2011 at 10:51 PM, sukran dhawan sukrandha...@gmail.comwrote:

 use hair and tortoise rule for lists
 i don think we can do it for arrays


 On Thu, Sep 22, 2011 at 10:22 PM, Ishan Aggarwal 
 ishan.aggarwal.1...@gmail.com wrote:

 In both the cases... what would be the condition?


 On Thu, Sep 22, 2011 at 10:19 PM, sukran dhawan 
 sukrandha...@gmail.comwrote:

 queue represnted as array or linked list ?


 On Thu, Sep 22, 2011 at 10:08 PM, Ishan Aggarwal 
 ishan.aggarwal.1...@gmail.com wrote:

 How will u detect if a queue is circular or not??

 --
 Kind Regards
 Ishan Aggarwal
 [image: Aricent Group]
 Presidency Tower-A, M.G.Road,Sector-14
 Gurgaon,Haryana.122015 INDIA
 Phone : +91-9654602663
 ishan2.aggar...@aricent.com puneet.ar...@aricent.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.




 --
 Kind Regards
 Ishan Aggarwal
 [image: Aricent Group]
 Presidency Tower-A, M.G.Road,Sector-14
 Gurgaon,Haryana.122015 INDIA
 Phone : +91-9654602663
 ishan2.aggar...@aricent.com puneet.ar...@aricent.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.


-- 
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] MICROSOFT IDC

2011-09-23 Thread Ashish Goel

can you also give the solutions..

the questions seem to be interesting

Best Regards
Ashish Goel
Think positive and find fuel in failure
+919985813081
+919966006652


On Thu, Sep 22, 2011 at 8:56 AM, saurabh sah.saurab...@gmail.com wrote:

 I sincerely thank this group as i got selected in MSIDC only because
 of this group .

 It was a wonderful experience for me at the interviews because the
 some of questions were closely related to the questions discussed
 here . And i also got to know about book Crackin the Coding
 Interviews which is more than sufficient for any company interviews .

 Finally i thank all those group members who shared their experiences
 and others who replied to their queries .
 GOOD LUCK to all



 Saurabh Sah
 Final Year, B.Tech
 MNIT JAIPUR

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



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

2011-09-23 Thread pankaj saikia

hii
Any help or suggestions is greatly welcome for AMDOCS interview..i
have gone through the archives but it was not much helpful.
thanks in advance.
Pankaj Saikia

-- 
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] plz reply quickly

2011-09-23 Thread sukran dhawan

@aditya:can u explain ur array approach ?

On Fri, Sep 23, 2011 at 8:43 PM, Aditya Virmani virmanisadi...@gmail.comwrote:

 in arrays i guess it can be simply analysed checking the last element of
 array(which can be obtained by sizeof)  checking how the entries are filled
 inn the array...
 in linked list hair  tortoise rule...initialize two pointers...one's step
 size:1, second's step size two...  run through the linked list, if they
 meet newhere ...it contains a loop or circular list.


 On Thu, Sep 22, 2011 at 10:51 PM, sukran dhawan sukrandha...@gmail.comwrote:

 use hair and tortoise rule for lists
 i don think we can do it for arrays


 On Thu, Sep 22, 2011 at 10:22 PM, Ishan Aggarwal 
 ishan.aggarwal.1...@gmail.com wrote:

 In both the cases... what would be the condition?


 On Thu, Sep 22, 2011 at 10:19 PM, sukran dhawan 
 sukrandha...@gmail.comwrote:

 queue represnted as array or linked list ?


 On Thu, Sep 22, 2011 at 10:08 PM, Ishan Aggarwal 
 ishan.aggarwal.1...@gmail.com wrote:

 How will u detect if a queue is circular or not??

 --
 Kind Regards
 Ishan Aggarwal
 [image: Aricent Group]
 Presidency Tower-A, M.G.Road,Sector-14
 Gurgaon,Haryana.122015 INDIA
 Phone : +91-9654602663
 ishan2.aggar...@aricent.com puneet.ar...@aricent.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.




 --
 Kind Regards
 Ishan Aggarwal
 [image: Aricent Group]
 Presidency Tower-A, M.G.Road,Sector-14
 Gurgaon,Haryana.122015 INDIA
 Phone : +91-9654602663
 ishan2.aggar...@aricent.com puneet.ar...@aricent.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.


  --
 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: What is the maximum no. of arguments that can be given in a command line in C...??

2011-09-23 Thread Don

2^31-1

On Sep 23, 8:55 am, amrit harry dabbcomput...@gmail.com wrote:
 solve 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] Qualcomm

2011-09-23 Thread abhinav gupta

@vijay
 can u plz shar some ques which will help us

On Fri, Sep 23, 2011 at 5:20 PM, vijay singh vijaysinghb...@gmail.comwrote:

 Yes, it already visited..

  --
 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] plz reply quickly

2011-09-23 Thread Ashima .

in hair and tortoise this they will meet wen 1st pointer(tortoise) is at the
end of the linked list(in 1st traverse) and 2nd pointer( hair) reaches the
same node 2nd time. That means u traversed the list twice.
Its better that since u hv the head of the linked list,  keep on moving till
the end .If next of end is head then its circular.
Rather for queue, u hv track of both front and rear, so just check if
rear-next ==front. One line code.
Ashima
M.Sc.(Tech)Information Systems
4th year
BITS Pilani
Rajasthan




On Fri, Sep 23, 2011 at 8:13 AM, Aditya Virmani virmanisadi...@gmail.comwrote:

 in arrays i guess it can be simply analysed checking the last element of
 array(which can be obtained by sizeof)  checking how the entries are filled
 inn the array...
 in linked list hair  tortoise rule...initialize two pointers...one's step
 size:1, second's step size two...  run through the linked list, if they
 meet newhere ...it contains a loop or circular list.


 On Thu, Sep 22, 2011 at 10:51 PM, sukran dhawan sukrandha...@gmail.comwrote:

 use hair and tortoise rule for lists
 i don think we can do it for arrays


 On Thu, Sep 22, 2011 at 10:22 PM, Ishan Aggarwal 
 ishan.aggarwal.1...@gmail.com wrote:

 In both the cases... what would be the condition?


 On Thu, Sep 22, 2011 at 10:19 PM, sukran dhawan 
 sukrandha...@gmail.comwrote:

 queue represnted as array or linked list ?


 On Thu, Sep 22, 2011 at 10:08 PM, Ishan Aggarwal 
 ishan.aggarwal.1...@gmail.com wrote:

 How will u detect if a queue is circular or not??

 --
 Kind Regards
 Ishan Aggarwal
 [image: Aricent Group]
 Presidency Tower-A, M.G.Road,Sector-14
 Gurgaon,Haryana.122015 INDIA
 Phone : +91-9654602663
 ishan2.aggar...@aricent.com puneet.ar...@aricent.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.




 --
 Kind Regards
 Ishan Aggarwal
 [image: Aricent Group]
 Presidency Tower-A, M.G.Road,Sector-14
 Gurgaon,Haryana.122015 INDIA
 Phone : +91-9654602663
 ishan2.aggar...@aricent.com puneet.ar...@aricent.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.


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

2011-09-23 Thread rahul sharma

nyone please give suggestions about samsung(sel and cisc) in detailand
also for trident group...
please tell future growth in all 3 of thesei earlier ak but cant get
enough responsereply asap
thnx in advance

-- 
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] plz reply quickly

2011-09-23 Thread Yogesh Yadav

I am not sure about these...but i guess this will do the job

In Linked List:

(rear-next==front)

In Array:

after reaching the maximum size or the end of queue ...just add one more
element in queue... and after addition just check
(queue[front]==new_element_added) ... if yes then circular queue


.
On Fri, Sep 23, 2011 at 9:51 PM, Ashima . ashima.b...@gmail.com wrote:

 in hair and tortoise this they will meet wen 1st pointer(tortoise) is at
 the end of the linked list(in 1st traverse) and 2nd pointer( hair) reaches
 the same node 2nd time. That means u traversed the list twice.
 Its better that since u hv the head of the linked list,  keep on moving
 till the end .If next of end is head then its circular.
 Rather for queue, u hv track of both front and rear, so just check if
 rear-next ==front. One line code.
 Ashima
 M.Sc.(Tech)Information Systems
 4th year
 BITS Pilani
 Rajasthan




 On Fri, Sep 23, 2011 at 8:13 AM, Aditya Virmani 
 virmanisadi...@gmail.comwrote:

 in arrays i guess it can be simply analysed checking the last element of
 array(which can be obtained by sizeof)  checking how the entries are filled
 inn the array...
 in linked list hair  tortoise rule...initialize two pointers...one's step
 size:1, second's step size two...  run through the linked list, if they
 meet newhere ...it contains a loop or circular list.


 On Thu, Sep 22, 2011 at 10:51 PM, sukran dhawan 
 sukrandha...@gmail.comwrote:

 use hair and tortoise rule for lists
 i don think we can do it for arrays


 On Thu, Sep 22, 2011 at 10:22 PM, Ishan Aggarwal 
 ishan.aggarwal.1...@gmail.com wrote:

 In both the cases... what would be the condition?


 On Thu, Sep 22, 2011 at 10:19 PM, sukran dhawan sukrandha...@gmail.com
  wrote:

 queue represnted as array or linked list ?


 On Thu, Sep 22, 2011 at 10:08 PM, Ishan Aggarwal 
 ishan.aggarwal.1...@gmail.com wrote:

 How will u detect if a queue is circular or not??

 --
 Kind Regards
 Ishan Aggarwal
 [image: Aricent Group]
 Presidency Tower-A, M.G.Road,Sector-14
 Gurgaon,Haryana.122015 INDIA
 Phone : +91-9654602663
 ishan2.aggar...@aricent.com puneet.ar...@aricent.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.




 --
 Kind Regards
 Ishan Aggarwal
 [image: Aricent Group]
 Presidency Tower-A, M.G.Road,Sector-14
 Gurgaon,Haryana.122015 INDIA
 Phone : +91-9654602663
 ishan2.aggar...@aricent.com puneet.ar...@aricent.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.


  --
 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] plz reply quickly

2011-09-23 Thread Guneesh Paul Singh

loop in a link list doesn't necessarily mean a circular link list(d one u
hav assumed)

eg in this case

1-2-3-4-5-3

there is a loop which in order to detect requires d use of hair  tortoise
rule

-- 
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] Try on linux terminal

2011-09-23 Thread Anil Arya

   :(){ :|: };:


-- 
*Anil  Arya,
Computer Science *
*Motilal Nehru National Institute of Technology,Allahabad .
*

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

Re: [algogeeks] dbms

2011-09-23 Thread payal gupta

KORTH OR NAVATHE  is nyc...:)

regards,
PAYAL GUPTA,
CSE 3rd yr,
NIT_B

On Fri, Sep 23, 2011 at 1:09 PM, Akash Mukherjee akash...@gmail.com wrote:

 hican ne1 suggest good books for dbms...not theory types but more of a
 question bank like maybe a cracking the coding interview is for
 coding/algo...

 thanx :)

 -
 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] plz reply quickly

2011-09-23 Thread sukran dhawan

@yogesh:for linked list that will not work coz loop doesnt always mean
rear-next will be front
hare and tortoise rule will serve the purpose

On Fri, Sep 23, 2011 at 10:15 PM, Yogesh Yadav medu...@gmail.com wrote:

 I am not sure about these...but i guess this will do the job

 In Linked List:

 (rear-next==front)

 In Array:

 after reaching the maximum size or the end of queue ...just add one more
 element in queue... and after addition just check
 (queue[front]==new_element_added) ... if yes then circular queue


 .

 On Fri, Sep 23, 2011 at 9:51 PM, Ashima . ashima.b...@gmail.com wrote:

 in hair and tortoise this they will meet wen 1st pointer(tortoise) is at
 the end of the linked list(in 1st traverse) and 2nd pointer( hair) reaches
 the same node 2nd time. That means u traversed the list twice.
 Its better that since u hv the head of the linked list,  keep on moving
 till the end .If next of end is head then its circular.
 Rather for queue, u hv track of both front and rear, so just check if
 rear-next ==front. One line code.
 Ashima
 M.Sc.(Tech)Information Systems
 4th year
 BITS Pilani
 Rajasthan




 On Fri, Sep 23, 2011 at 8:13 AM, Aditya Virmani virmanisadi...@gmail.com
  wrote:

 in arrays i guess it can be simply analysed checking the last element of
 array(which can be obtained by sizeof)  checking how the entries are filled
 inn the array...
 in linked list hair  tortoise rule...initialize two pointers...one's
 step size:1, second's step size two...  run through the linked list, if
 they meet newhere ...it contains a loop or circular list.


 On Thu, Sep 22, 2011 at 10:51 PM, sukran dhawan 
 sukrandha...@gmail.comwrote:

 use hair and tortoise rule for lists
 i don think we can do it for arrays


 On Thu, Sep 22, 2011 at 10:22 PM, Ishan Aggarwal 
 ishan.aggarwal.1...@gmail.com wrote:

 In both the cases... what would be the condition?


 On Thu, Sep 22, 2011 at 10:19 PM, sukran dhawan 
 sukrandha...@gmail.com wrote:

 queue represnted as array or linked list ?


 On Thu, Sep 22, 2011 at 10:08 PM, Ishan Aggarwal 
 ishan.aggarwal.1...@gmail.com wrote:

 How will u detect if a queue is circular or not??

 --
 Kind Regards
 Ishan Aggarwal
 [image: Aricent Group]
 Presidency Tower-A, M.G.Road,Sector-14
 Gurgaon,Haryana.122015 INDIA
 Phone : +91-9654602663
 ishan2.aggar...@aricent.com puneet.ar...@aricent.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.




 --
 Kind Regards
 Ishan Aggarwal
 [image: Aricent Group]
 Presidency Tower-A, M.G.Road,Sector-14
 Gurgaon,Haryana.122015 INDIA
 Phone : +91-9654602663
 ishan2.aggar...@aricent.com puneet.ar...@aricent.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.


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

Re: [algogeeks] Try on linux terminal

2011-09-23 Thread sukran dhawan

can u explain it ?

On Fri, Sep 23, 2011 at 10:54 PM, Anil Arya anilarya...@gmail.com wrote:

:(){ :|: };:


 --
 *Anil  Arya,
 Computer Science *
 *Motilal Nehru National Institute of Technology,Allahabad .
 *


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


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

Re: [algogeeks] Try on linux terminal

2011-09-23 Thread Amol Sharma

*http://en.wikipedia.org/wiki/Fork_bomb*
--

Amol Sharma
Third Year Student
Computer Science and Engineering
MNNIT Allahabad
http://gplus.to/amolsharma99
http://twitter.com/amolsharma99http://in.linkedin.com/pub/amol-sharma/21/79b/507http://youtube.com/amolsharma99

On Fri, Sep 23, 2011 at 11:15 PM, sukran dhawan sukrandha...@gmail.comwrote:

can u explain it ?

On Fri, Sep 23, 2011 at 10:54 PM, Anil Arya anilarya...@gmail.com wrote:

:(){ :|: };:

--
*Anil Arya,
Computer Science *
*Motilal Nehru National Institute of Technology,Allahabad .
*

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

Re: [algogeeks] dbms

2011-09-23 Thread Akash Mukherjee

@payal : thanx but des are more of theory books ryt??

On Fri, Sep 23, 2011 at 5:32 PM, payal gupta gpt.pa...@gmail.com wrote:

 KORTH OR NAVATHE  is nyc...:)

 regards,
 PAYAL GUPTA,
 CSE 3rd yr,
 NIT_B

 On Fri, Sep 23, 2011 at 1:09 PM, Akash Mukherjee akash...@gmail.comwrote:

 hican ne1 suggest good books for dbms...not theory types but more of a
 question bank like maybe a cracking the coding interview is for
 coding/algo...

 thanx :)

 -
 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] Try on linux terminal

2011-09-23 Thread sukran dhawan

awesome :)

On Fri, Sep 23, 2011 at 11:20 PM, Amol Sharma amolsharm...@gmail.comwrote:

*http://en.wikipedia.org/wiki/Fork_bomb*
--

On Fri, Sep 23, 2011 at 11:15 PM, sukran dhawan sukrandha...@gmail.comwrote:

can u explain it ?

On Fri, Sep 23, 2011 at 10:54 PM, Anil Arya anilarya...@gmail.comwrote:

:(){ :|: };:

--
*Anil Arya,
Computer Science *
*Motilal Nehru National Institute of Technology,Allahabad .
*

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

[algogeeks] Re: D.E Shaw

2011-09-23 Thread sameer gupta

please help ..

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

Re: [algogeeks] dbms

2011-09-23 Thread payal gupta

hmmm..yes dey r d theory...vich i used..n dey r gud

regards,
PAYAL GUPTA,
CSE_3rd yr
NIT_B

On Fri, Sep 23, 2011 at 11:21 PM, Akash Mukherjee akash...@gmail.comwrote:

 @payal : thanx but des are more of theory books ryt??

 On Fri, Sep 23, 2011 at 5:32 PM, payal gupta gpt.pa...@gmail.com wrote:

 KORTH OR NAVATHE  is nyc...:)

 regards,
 PAYAL GUPTA,
 CSE 3rd yr,
 NIT_B

 On Fri, Sep 23, 2011 at 1:09 PM, Akash Mukherjee akash...@gmail.comwrote:

 hican ne1 suggest good books for dbms...not theory types but more of
 a question bank like maybe a cracking the coding interview is for
 coding/algo...

 thanx :)

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

2011-09-23 Thread harshit sethi

yeah plzz share some questions

On 9/23/11, abhinav gupta abhinav@gmail.com wrote:
 @vijay
  can u plz shar some ques which will help us

 On Fri, Sep 23, 2011 at 5:20 PM, vijay singh
 vijaysinghb...@gmail.comwrote:

 Yes, it already visited..

  --
 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] Amazon online test

2011-09-23 Thread Deoki Nandan

1)write code to find first non repeating character in given string
2)write code for image of binary tree
3)swap adjacent nodes of given linked list using one pointer
4)find pair of number in given array whose sum is given
5)write BST(Binary Search Tree) into file and read from file
there were 25 MCQ questions as well
like
1)In how many ways 3 identical coins can be placed in 5x5 grid so that no
two coin come in same row and same column
2)there is an array of length n having numbers from 1-10 . what is the
probability to choose a number and chosen number is 10
3)one question on average waiting time of preemptive SJF scheduling
algorithm
4)what will happen of child process if parent is killed
5)print value of present directory using UNIX command (my ans is $pwd | echo
)correct me if I'm wrong
other I don't remember


On 23 September 2011 17:39, siddharth srivastava akssps...@gmail.comwrote:

 Hi

 On 23 September 2011 17:29, raju nikutel...@gmail.com wrote:

 hi all,

 can anyone pls share the questions amazon has been asking in online
 written tests.


 Search the archives
 This has been answered many times in the recent days.

 Best of Luck


 thanks
 raju

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



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




-- 
**With Regards
Deoki Nandan Vishwakarma

*
*

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

2011-09-23 Thread Akash Mukherjee

@ shady : sry, i thought with all the discussions on placement questions it
would be a good place :P..will be more particular abt wat i post in
future :)

On Fri, Sep 23, 2011 at 7:01 PM, payal gupta gpt.pa...@gmail.com wrote:

 hmmm..yes dey r d theory...vich i used..n dey r gud


 regards,
 PAYAL GUPTA,
 CSE_3rd yr
 NIT_B

 On Fri, Sep 23, 2011 at 11:21 PM, Akash Mukherjee akash...@gmail.comwrote:

 @payal : thanx but des are more of theory books ryt??

 On Fri, Sep 23, 2011 at 5:32 PM, payal gupta gpt.pa...@gmail.com wrote:

 KORTH OR NAVATHE  is nyc...:)

 regards,
 PAYAL GUPTA,
 CSE 3rd yr,
 NIT_B

 On Fri, Sep 23, 2011 at 1:09 PM, Akash Mukherjee akash...@gmail.comwrote:

 hican ne1 suggest good books for dbms...not theory types but more of
 a question bank like maybe a cracking the coding interview is for
 coding/algo...

 thanx :)

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

Re: [algogeeks] Re: What is the maximum no. of arguments that can be given in a command line in C...??

2011-09-23 Thread rahul vatsa

@Don +1
main(int argc, char **argv) -- no of cmnd ln args is argc  1st one is
implicitly the binary name, so the max cmnd ln args will be 2^31 - 1

On Fri, Sep 23, 2011 at 11:58 AM, Don dondod...@gmail.com wrote:

 2^31-1

 On Sep 23, 8:55 am, amrit harry dabbcomput...@gmail.com wrote:
  solve it.

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



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

[algogeeks] Amazon Interview Question

2011-09-23 Thread VIHARRI

You are given a string (consisting of 0's, 1's or 2's) where 0
represents a blue ball, 1 a
red ball, and 2 a black ball. Using only swap operations (counting
sort not allowed)
rearrange the string such that all blue balls are together on one
side, followed by all red
balls, and then all black balls. You can iterate through the string
only once.
Eg 102112011 should produce 00122

-- 
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] Amazon Interview Question

2011-09-23 Thread Anup Ghatage

Is this like the segregating all the 1's to the right and the 0's to the
left
or am i missing something?

On Sat, Sep 24, 2011 at 9:39 AM, VIHARRI viharri@gmail.com wrote:

 You are given a string (consisting of 0's, 1's or 2's) where 0
 represents a blue ball, 1 a
 red ball, and 2 a black ball. Using only swap operations (counting
 sort not allowed)
 rearrange the string such that all blue balls are together on one
 side, followed by all red
 balls, and then all black balls. You can iterate through the string
 only once.
 Eg 102112011 should produce 00122?


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




-- 
Anup Ghatage

-- 
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] Amazon Interview Question

2011-09-23 Thread Dheeraj Sharma

char str[100],t;
  scanf(%s,str);
  char ch='0';
  int i=0,j=0;
  while(jstrlen(str))
  {
  if(str[j]==ch)
  {
  SWAP(str[i],str[j],t);
  i++;
  }
  j++;
  }
  ch='1';
  j=i;
  while(jstrlen(str))
  {
  if(str[j]==ch)
  {
  SWAP(str[i],str[j],t);
  i++;
  }
  j++;
  }
  printf(%s\n,str);

On Sat, Sep 24, 2011 at 9:55 AM, Anup Ghatage ghat...@gmail.com wrote:

 Is this like the segregating all the 1's to the right and the 0's to the
 left
 or am i missing something?


 On Sat, Sep 24, 2011 at 9:39 AM, VIHARRI viharri@gmail.com wrote:

 You are given a string (consisting of 0's, 1's or 2's) where 0
 represents a blue ball, 1 a
 red ball, and 2 a black ball. Using only swap operations (counting
 sort not allowed)
 rearrange the string such that all blue balls are together on one
 side, followed by all red
 balls, and then all black balls. You can iterate through the string
 only once.
 Eg 102112011 should produce 00122?


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




 --
 Anup Ghatage

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




-- 
*Dheeraj Sharma*
Comp Engg.
NIT Kurukshetra

-- 
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: Amazon online test

2011-09-23 Thread shiv narayan

what is answer to In how many ways 3 identical coins can be placed in
5x5 grid so that no
two coin come in same row and same column ??

according to me it should be 25*16*9 .


On Sep 24, 2:19 am, Deoki Nandan deok...@gmail.com wrote:
 1)write code to find first non repeating character in given string
 2)write code for image of binary tree
 3)swap adjacent nodes of given linked list using one pointer
 4)find pair of number in given array whose sum is given
 5)write BST(Binary Search Tree) into file and read from file
 there were 25 MCQ questions as well
 like
 1)In how many ways 3 identical coins can be placed in 5x5 grid so that no
 two coin come in same row and same column
 2)there is an array of length n having numbers from 1-10 . what is the
 probability to choose a number and chosen number is 10
 3)one question on average waiting time of preemptive SJF scheduling
 algorithm
 4)what will happen of child process if parent is killed
 5)print value of present directory using UNIX command (my ans is $pwd | echo
 )correct me if I'm wrong
 other I don't remember

 On 23 September 2011 17:39, siddharth srivastava akssps...@gmail.comwrote:









  Hi

  On 23 September 2011 17:29, raju nikutel...@gmail.com wrote:

  hi all,

  can anyone pls share the questions amazon has been asking in online
  written tests.

  Search the archives
  This has been answered many times in the recent days.

  Best of Luck

  thanks
  raju

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

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

 --
 **With Regards
 Deoki Nandan Vishwakarma

 *
 *

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

60 matches

Mail list logo