Towards better heaps
The job scheduler of the operating system in a distributed computing system uses a heap to prioritize tasks. However, since the clients keep signing in and out of the project, the scheduler frequently has to reschedule jobs. To do so, it needs to merge heaps, i.e, build a larger heap using keys from two smaller heaps.
Which of the following is not a heap implementation that efficiently supports this?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
0 solutions
No explanations have been posted yet. Check back later!