i think u shuld go thru INDIA BIX OR FRESHERSWORLD.COM
On 4/11/11, Anand anandut2...@gmail.com wrote:
http://anandtechblog.blogspot.com/
On Mon, Apr 11, 2011 at 10:25 AM, abhishek jain
abhi.creat...@gmail.comwrote:
www.careercup.com
http://www.acetheinterview.com/
Thanks,
Abhishek
On
try website:-.www.placementpapers.com
indiabix.com
On 11/15/10, Bittu B bittu.bitt...@gmail.com wrote:
Plz suggest some links for placement aptitude and technical
For companies like Microsoft , Amdocs, Infosys, Accenture etc
--
You received this message
TRY TO DO IN ANDROID CONCEPT THIS IS THE LEADING TECH IN TELECOM FIELD
On 10/19/10, gaurav gupta 1989.gau...@googlemail.com wrote:
Hello Ayush,
If you really want to work and learn something, I would suggest select an
open source project according to interest and do something as your Btech
Create a temp array temp[0..k-1] of size k.
2) Traverse the array arr[k..n-1]. While traversing, keep updating the
smallest element of temp[]
3) Return the smallest of temp[]
Time Complexity: O((n-k)*k).
try it ..for this problem[?]
--
You received this message because you are
if(faster==head||faster-next=
=head)
return slower
else
faster=faster-next-next
slower=slower-next
HERE we hv three poniter faster,headr,slower.
as u hv mentioned that linked list has cycle list so better is that we hv
to use for loop
as :-
if we take headr,link,temp;
if(temp==headr)
{
HI,THANKS 4 INFORMING ABT THIS CONFERENCE BUT MAY I KNOW THD VENU AND
THE PLACE WERE IT IS GOING TO HELD.M I ELIGIBLE TO ATTEND THIS COZ I
M MCA 2ND YEAR STUDENT.
On 3/10/10, A. M. G. Solo amgs...@yahoo.com wrote:
It would be greatly appreciated if this announcement could be
shared
