Solution :
A friend of mine have an old version of computer PC having the following components :
Input devices
Model name of the keyboard -- PUNTA , model number -- P-KB515
Model name of the mouse -- PUNTA, model number -- P-KB515
Output devices
Speaker : COMPAQ
Monitor : ACER, Model Number --- EB192Q
Storage : 500 MB capacity hard disk
RAM : 2 GB
Processor : Intel Pentium dual E1260 at the rate 1.80 GHz
It is provided with audio jacks
Answer:
Explanation:
We start from the bottom-most and rightmost internal node of min Heap and then heapify all internal modes in the bottom-up way to build the Max heap.
To build a heap, the following algorithm is implemented for any input array.
BUILD-HEAP(A)
heapsize := size(A)
for i := floor(heapsize/2) downto 1
do HEAPIFY(A, i)
end for
Convert the given array of elements into an almost complete binary tree.
Ensure that the tree is a max heap.
Check that every non-leaf node contains a greater or equal value element than its child nodes.
If there exists any node that does not satisfy the ordering property of max heap, swap the elements.
Start checking from a non-leaf node with the highest index (bottom to top and right to left).
Answer:
i do not know
Explanation:
but it helps to communication
<span>Landforms that could be created at convergent boundaries would consist of: volcanoes, mountains, trenches, volcanic islands, and even deserts could result from effects of converging boundaries. The landforms are mountains.</span>
