Re: [algogeeks] Re: Directi

2011-08-19 Thread NIKHIL JAIN
some more questions apart from them

1. area of the largest square such that it lies only on the black square of
chess such that the side of the chess square is 2 cm.
2. there is a rectangle area such that in it m number of roads are moving
from east to west and n number of roads are moving from north to
south how many number of men are needed to be placed at the intersection
to roads so that all the roads are monitored
ans : max(m,n)
3. one question on the cron job command in which given the sequence we have
to tell the meaning what will it do
sequence is 15 * * * 2,3,4 comand like that not exactly
4. one question is on the threads that is what threads don't share in the
processes
5. one question is on the fork() function
6. on equestion is on the recursive and non recursive dns method to resolve
the hostname to ip

-- 
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: directi prepration

2011-08-09 Thread NIKHIL JAIN
thnx

can you please tell some of the written questions so that i will have an
idea what kind of questions are being asked by them

-- 
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: directi prepration

2011-08-09 Thread NIKHIL JAIN
can any dce student give an idea whats the procedure and what are the
questions asked by directi recruitment group

-- 
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] GS on campus

2011-08-06 Thread NIKHIL JAIN
which college

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

2011-08-03 Thread NIKHIL JAIN
are they what they have asked recently and they consider c/c++ as a part of
apti or have a pure c/c++ paper and apti paper

-- 
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] Min Enqueue Dequeue in O(1)

2011-06-07 Thread NIKHIL JAIN
it with the change that now it is min

On Tue, Jun 7, 2011 at 10:47 PM, NIKHIL JAIN  wrote:

> i think sliding window is based on
>
> On Tue, Jun 7, 2011 at 9:26 PM, ross  wrote:
>
>> Design a Queue (strictly fifo) to support findmin, enqueue, dequeue in
>> o(1).
>> extra space allowed.
>> (for a stack, its trivial with 2 stacks) Can the same approach be
>> applied for a queue?
>>
>> --
>> 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] Min Enqueue Dequeue in O(1)

2011-06-07 Thread NIKHIL JAIN
i think sliding window is based on

On Tue, Jun 7, 2011 at 9:26 PM, ross  wrote:

> Design a Queue (strictly fifo) to support findmin, enqueue, dequeue in
> o(1).
> extra space allowed.
> (for a stack, its trivial with 2 stacks) Can the same approach be
> applied for a queue?
>
> --
> 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] box packing

2011-06-04 Thread NIKHIL JAIN
but is my logic correct i have tried it for some cases

On Sat, Jun 4, 2011 at 4:20 PM, Vipul Kumar  wrote:

> For rotation case, take all the orientation of a box in account and
> now apply the same algo
>
> On Sat, Jun 4, 2011 at 3:13 PM, Piyush Sinha 
> wrote:
> > For the rotation case, sort on the basis of volume...
> >
> > On 6/4/11, NIKHIL  wrote:
> >> given the boxes with dimentions in form (L,B,H)
> >> find the sequence in which the boxes can be stored inside the other.
> >>
> >> for eg.
> >>
> >> a=4,4,5
> >> b=3,4,3
> >> c=3,4,6
> >> d=2,3,2
> >>
> >> a(b(d))
> >> without rotation :
> >> is this correct logic
> >>
> >> sort on the basis of length and breadth and height
> >> then find lis on the basis of height starting from the bottom most box
> >> in the sorted sequence
> >>
> >> what for rotation case
> >>
> >> --
> >> You received this message because you are subscribed to the Google
> Groups
> >> "Algorithm Geeks" group.
> >> To post to this group, send email to algogeeks@googlegroups.com.
> >> To unsubscribe from this group, send email to
> >> algogeeks+unsubscr...@googlegroups.com.
> >> For more options, visit this group at
> >> http://groups.google.com/group/algogeeks?hl=en.
> >>
> >>
> >
> >
> > --
> > *Piyush Sinha*
> > *IIIT, Allahabad*
> > *+91-8792136657*
> > *+91-7483122727*
> > *https://www.facebook.com/profile.php?id=10655377926 *
> >
> > --
> > You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> > To post to this group, send email to algogeeks@googlegroups.com.
> > To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com.
> > For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
> >
> >
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, send email to algogeeks@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
>

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send 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] partitioning the array

2011-05-07 Thread NIKHIL JAIN
still not getting the correct output

-- 
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] partitioning the array

2011-05-07 Thread NIKHIL JAIN
87
100
28
67
68
41
67
1
for this output should be 229 230

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