@Divya Jain: In the algorithm I gave, please note that, the *max value in
left subtree* should be *smaller than* the current node's key, which inturn
should be *smaller than* the *min value in right subtree*. That way, my
algorithm would return false for the example which you gave.
On Sun, Jul 4,
occurs, the kernel will get to know that the
time quantum assigned to the current process has expired and then it loads
the next waiting process to execute on the CPU.
Hope this helps.
--
CM Saikanth Varma
On Sun, May 2, 2010 at 10:25 PM, praba garan prabagara...@gmail.com wrote:
@ Pradeep
The answer is indeed 56.
Explanation: Increment operator has highest priority
so (i++)*(i++) will be evaluated as
(7)*(8)=56
This is valid only in C
On Tue, Sep 15, 2009 at 6:45 PM, nitin mathur
nitinkumar.mat...@gmail.comwrote:
@ Tanmoy
Same logic I explained..interviewer didn't give me any
