http://www.sendspace.com/file/wxqx5l
On Oct 7, 10:09 am, saurabh singh saurab...@gmail.com wrote:
It uses the system call brk
On Fri, Oct 7, 2011 at 10:23 AM, praneethn praneeth...@gmail.com wrote:
can somebody provide the link or explain how malloc is implemented
internally as
o/p - fail1
pass2
xplaination - as char range = (-127 to +127) so char c=-64 is ok
so (ci) condition z not true ..so else part got executed .
but u is unsigned so its actual value z , u = some very high + no.
so iu cond is true -- so the final o/p --- fail1 pass2
if u want to
plz suggest any good link that covers the complete basics abt nagle's
algo ...
--
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
@prag .. dude those 2 guys r not frm cs-it 1 more thine udit is
also from our college (MNNIT Allahabad ) .. udit hi vo banda hai
jiska technical sabse achha gaya tha qualcomm me but after 1 hour good
tech round, w/o any reason QUALCOMM rejects udit .. udit z jst
xpressing his
colg ? pkg ???
On Oct 3, 7:36 pm, amit kannaujiya amitkannaujiyan...@gmail.com
wrote:
if any one know regarding oracle finance online test, plz post type of
questions asked in online test .
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
working code :
#includestdio.h
int fib(int n)
{
if(n==1) return 0;
if(n==2) return 1;
return fib(n-1)+fib(n-2);
}
int main()
{
int n,i,sum=0;
printf(enter no of terms\t );
scanf(%d,n);
printf(fibonacci series = \t );
Hey, Kronos India is visiting our college. Any idea about the pattern
of the campus
selection process? As in type of questions asked?
college - MNNIT Allahabad
pkg - 6.48 lpa
Rahul Tiwari
information tech.
MNNIT Allahabad
9838339030
--
You received this message because you
@Don ... optimal one ... +1
On Sep 29, 7:32 pm, Don dondod...@gmail.com wrote:
To search for element T in array A[], start at a point p 0.
If A[p] T, do a binary search on range 0..p.
Otherwise set p = 1 + p * (T - A[0]) / (A[p] - A[0]).
Repeat until A[p] = T. Then the current and previous
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.
--
Rahul Tiwari aka DONE
B Tech Final
@rohit singhal
off-campus or on-campus ?
if on-campus ---mention ur college plz
--
Rahul Tiwari aka DONE
B Tech Final Year
Information Technology
Motilal Nehru National Institute of Technology , Allahabad
9838339030
--
You received this message because you are subscribed
MICROSOFT is inviting off-campus recruitments..jst check MS website for
more info ..
--
Rahul Tiwari aka DONE
B Tech Final Year
Information Technology
Motilal Nehru National Institute of Technology , Allahabad
9838339030
--
You received this message because you are subscribed
11 matches
Mail list logo
