Just try to answer some questions as well, then you can keep a nice balance.
ps. Only answer the questions you know.
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).
The other person is right
Answer: Medium Dependent Interface Crossover (MDIX)
Explanation:
The technology that is typically implemented on switches to avoid Ethernet connectivity problems is Medium Dependent Interface Crossover(MDIX) For switches with Auto (MDIX) the connection is configured automatically and a crossover or straight-through cable can be used to connect two switches. When this MDIX interface is connected it corrects the connectivity speed and the cabling for proper device functionality.
The function use to get the number of element in a dictionary is len.
<h3>What is a dictionary?</h3>
Dictionaries are used to store data values in key-value pairs. Dictionary are ordered.
Dictionary in python are express as follows:
my_dict = {"name": "Michael", "age": 28, "school": "Oxford"}
Therefore, the length of the element of the dictionary can be gotten using the len() function.
Hence,
print(len(my_dict)) will give you the length of the element.
learn more on dictionary here: brainly.com/question/14120893
#SPJ11
