Realloc will resize a block of memory larger or smaller. If it
requires that the block be moved, it will copy the contents of the old
memory into the new location and free the old memory.
Don
On Sep 22, 12:01 pm, Ankuj Gupta ankuj2...@gmail.com wrote:
Hi
I have a doubt in functioning of
@aditi
For the first question.
The answer will be ((0.97 *2) + (0.03*2) +(0.03*100)) i.e 5 ns.
The reason is that cache is accessed in the case of miss as well, so
we need to include that time as well.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks
In memory heirachy, whenever some data is to be read, first data is to
be searched in M1, if the data is found in M1 then system returns the
value from there and counted as a hit. If the value is not found in
M1 i.e. Miss for M1 then it accesses M2 and returns the value from
there. Since nothing
@aditi since in the hierarchy m1 comes first so if it is a hit then we dont
need to check m2 but in case of a miss 0.03*2 seconds are wasted while
searching in m1 then that value is looked for in m2
so i suppose the best answer is given by rohit jain. unless there is some
missing data
On Tue, Aug
@Rohit and Rohit : Thnk u so much:)
On Tue, Aug 9, 2011 at 5:50 PM, Rohit Srivastava access2ro...@gmail.comwrote:
@aditi since in the hierarchy m1 comes first so if it is a hit then we dont
need to check m2 but in case of a miss 0.03*2 seconds are wasted while
searching in m1 then that value