Bissoy.com
Doctors Medicines MCQs Q&A

How to protect the heap from affecting the memory?

How to protect the heap from affecting the memory? Correct Answer All of the mentioned

Steps to protect the heap from affecting the memory. -> Avoid using pointers for associating two data structures -> Embed pointed child objects into the parent object -> Allocate objects in chunks.

Related Questions

With regard to computer memory, which of the following statement(s) is/are TRUE?  (A) Cache memory is 'volatile' memory. (B) Magnetic memory is 'volatile' memory.  (C) Flash memory is 'volatile' memory. (D) RAM is 'volatile' memory. Choose the correct answer from the option given below:
Select differences between reference type and value type: i. Memory allocated to ‘Value type’ is from heap and reference type is from ‘System. ValueType’ ii. Memory allocated to ‘Value type’ is from ‘System. ValueType’ and reference type is from ‘Heap’ iii. Structures, enumerated types derived from ‘System. ValueType’ are created on stack, hence known as ValueType and all ‘classes’ are reference type because values are stored on heap
An operator delete(i) for a binary heap data structure is to be designed to delete the item in the i-th node. Assume that the heap is implemented in an array and i refers to the i-th index of the array. If the heap tree has depth d (number of edges on the path from the root to the farthest leaf), then what is the time complexity to re-fix the heap efficiently after the removal of the element? 
Consider the following statements: I. The smallest element in a max-heap is always at a leaf node II. The second largest element in a max-heap is always a child of the root node III. A max-heap can be constructed from a binary search tree in Θ(n) time IV. A binary search tree can be constructed from a max-heap in Θ(n) time Which of the above statements are TRUE?
In a federal system why a Judiciary is essential ? a. To enterprete the Constitution b. To protect the Fundamental Rights c. To protect the Supremacy of the Constitution d. To protect Democratic system e. To settle disputes between centre and states f. To protect parliamentary system
A max-heap is a heap where the value of each parent is greater than or equal to the value of its children. Which of the following is a max-heap?
If we implement heap as min-heap, deleting root node (value 1)from the heap. What would be the value of root node after second iteration if leaf node (value 100) is chosen to replace the root at start.
If we implement heap as maximum heap , adding a new node of value 15 to the left most node of right subtree. What value will be at leaf nodes of the right subtree of the heap.
The essential part of Heap sort is construction of max-heap. Consider the tree shown below, the node 24 violates the max-heap property. Once heapify procedure is applied to it, which position will it be in?
A shared variable x, initialized to zero, is operated on by four concurrent processes W, X, Y, Z as follows. Each of the processes W and X reads x from memory, increments by one, stores it to memory, and then terminates. Each of the processes Y and Z reads x from memory, decrements by two, stores it to memory, and then terminates. Each process before reading x invokes the P operation (i.e., wait) on a counting semaphore S and invokes the V operation (i.e., signal) on the semaphore S after storing x to memory. Semaphore S is initialized to two. What is the maximum possible value of x after all processes complete execution?