Thier aptitudes contain 11 logic puzzles(one can find these on the net)
and 5 algo questions(easy).
On Thu, Sep 6, 2012 at 1:47 AM, noname wrote:
> hey i hope your test is over can you also please some info about the test
> was the test online or paper and how many questions from each round..
>
hey i hope your test is over can you also please some info about the test
was the test online or paper and how many questions from each round..
how was the interview process what to focus on among DS/OS/OOPS/DBMS..
please elaborate as much possible...
On Wednesday, 22 August 2012 23:23:28 UTC+5:30
hey how was your snapdeal exam you also please give some details ...
On Tuesday, 28 August 2012 22:26:48 UTC+5:30, [we]fork wrote:
>
>
>
> -- Forwarded message --
> From: sachin singh >
> Date: Tue, Aug 28, 2012 at 10:23 PM
> Subject: Snapdeal placement proceedure
> To: algo...@goo
thanks that was a really nice explanation
shashank
On Wed, Sep 5, 2012 at 6:48 PM, Bala wrote:
> Source: http://gcc.gnu.org/onlinedocs/cpp/Macros.html
>
> You may define any valid identifier as a macro, even if it is a C
> keyword. The preprocessor does not know anything about keywords. This
>
Source: http://gcc.gnu.org/onlinedocs/cpp/Macros.html
You may define any valid identifier as a macro, even if it is a C
keyword. The preprocessor does not know anything about keywords. This
can be useful if you wish to hide a keyword such as const from an
older compiler that does not understand it
can you plz explain how it happens ...as valid macro names must not be key
words.
On Wed, Sep 5, 2012 at 6:24 PM, Shashank Jain wrote:
>
> it works
> thanks for your reply
>
>
>
> On Wed, Sep 5, 2012 at 6:19 PM, Bala wrote:
>
>> #define while(x) while(1)
>>
>> Cheers,
>> -Bala
>>
>>
>>
>> On We
it works
thanks for your reply
On Wed, Sep 5, 2012 at 6:19 PM, Bala wrote:
> #define while(x) while(1)
>
> Cheers,
> -Bala
>
>
>
> On Wed, Sep 5, 2012 at 7:45 AM, Shashank Jain
> wrote:
> > Here is a question...and i am badly stuck at it
> >
> > how would you get into the loop
> >
> > int mai
#define while(x) while(1)
Cheers,
-Bala
On Wed, Sep 5, 2012 at 7:45 AM, Shashank Jain wrote:
> Here is a question...and i am badly stuck at it
>
> how would you get into the loop
>
> int main()
> {
>
> while ( 0)
> {
>printf("hello");
>
> }
> return 0;
> }
>
>
> You
Here is a question...and i am badly stuck at it
how would you get into the loop
int main()
{
while ( 0)
{
printf("hello");
}
return 0;
}
You cannot change the while loop and its condition and you have to print
"hello"
--
You received this message because you are su
@Shashi : please check previous discussion on this thread.
On Wed, Sep 5, 2012 at 2:09 PM, shashi kant wrote:
> well in that case there can be simpler ways to do it
> do an inorder traversal while checking prev if not then make it in proper order ,although whole tree has to be
> traversed to fi
well in that case there can be simpler ways to do it
do an inorder traversal while checking prevhttp://thinkndoawesome.blogspot.com/
*System/Software Engineer*
*Hewlett-Packard India Software Operations.
*
On Wed, Sep 5, 2012 at 12:43 PM, atul anand wrote:
> @Shashi : i dont see any differenc
@Shashi : i dont see any differencebcoz only 2 nodes are swapped
..after correcting it...it shud maintain BST property wich automatically
retain original tree
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send ema
Is it required only to retain the BST property ?? or to retain the
original BST (tree)
*Shashi Kant *
***"Think positive and find fuel in failure"*
http://thinkndoawesome.blogspot.com/
*System/Software Engineer*
*Hewlett-Packard India Software Operations.
*
On Tue, Sep 4, 2012 at 1:56 PM, R
13 matches
Mail list logo
