Hey Friends,
I faced the interview of winshuttle today and these questions were asked to
me:
Q1. Design DS of Google Crawler.
Q2. Find max diameter of circle placed inside the area surrounded by points
(x, y) given that when points are joined they form a closed loop.
Q3. Design algo and DS to find the minimum length of Fence required to cover
scattered points (all co-ordinates given) in a plane.
Q4. Difference between line 1 and line 2 in below mentioned code.
Class A{
}
int main()
{
A obj;//line1
obj=new A();//line 2
}
At which step memory is allocated to the object and of what type (heap or
stack)
Q5. given an infinite array containing only 0's and 1's in sorted manner.
Give algo to find the position where first 1 appeared with minimum
complexity (Interviewer gave hint to use random number generator algo, don't
know why).
Please reply with some solutions.
--
Regards
Ravi Maggon
B.E. CSE, 4th Year
Thapar University
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
