you dont need that much to do this problem
modify merge method in mergesort to calculate the sum in nlgn
think about it it's quite easy
you must have heard of Count Inversion problem , this is similar to that
problem
On Tue, Apr 10, 2012 at 6:49 AM, bharath kannan wrote:
> I dont know if it can
Hi,
Regd OS,
1.deadlock
2.diff between linux, windows and solaris in terms of internals design
3.diff between mutex and semaphore
4.spin lock
5.interrupts
6.steps in page fault handling
6.steps involved in booting an os
7.what is kernel
8.paging & segmentation
9.process scheduling algorithms
10.
Thanks Bharat and Ashish;
Sorry my knowledge is so basic, I'm not yet with you.
The example they gave was:
% film.txt
...
Tin men (1987) / DeBoy, David/Blumenfeld, Alan/ --- /Geppi,
Cindy/Hershey, Barbara
Titanic (1997) /Mazin, Stan/...DiCaprio, Leonardo/.../Winslet, Kate/...
To Die For (1995
use double hash
On Friday, 6 April 2012 22:50:14 UTC+5:30, Rose wrote:
>
> Thanks all of you. I'm new to algorithms and data structure and I'm new in
> this forum.
> I have an assignment but not sure yet:
>
> A. Describe a data structure which can effectively answer the following
> questions:
>
