Get Advice on Live Video Call
Earn $ Cash $ with
consultations on Bissoy App

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.

Correct Answer: 2
As the root is deleted and node with value 100 is used as replaced one. There is a violation of property that root node must have value less than its children. So there will be shuffling of node with value 100 with node of value 2. And thus 2 becomes root. And it will remain to be at root after all the possible operations. So the value at root will be 2.

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 following lines talks about deleting a node in a binary tree.(the tree property must not be violated after deletion) i) from root search for the node to be deleted ii) iii) delete the node at what must be statement ii) and fill up statement iii)

Two men and women are entrusted with a task. The second man needs three hours more to cope up with the job than the second man and the woman would need working together. The first man, working alone, would need as much time as second man and the woman working together. The first man working alone, would spend eight hours less than the double period of the time second man would spend working alone. How much time would the two men and the women need to complete the task if they all asked together?

8 observations are clustered into 3 clusters using K-Means clustering algorithm. After first iteration clusters, C1, C2, C3 has following observations:
C1: {(2,2), (4,4), (6,6)}
C2: {(0,4), (4,0),(2,5)}
C3: {(5,5), (9,9)}
What will be the cluster centroids if you want to proceed for second iteration?

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?

Statement 1: When a node is split during insertion, the middle key is promoted to the parent as well as retained in right half-node. Statement 2: When a key is deleted from the leaf, it is also deleted from the non-leaf nodes of the tree.

The worst case complexity of deleting any arbitrary node value element from heap is __________

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

Two cyclists start biking from a trail start 3 hours apart. The second cyclist travels at 10 miles per hour and starts 3 hours after the first cyclist who is traveling at 6 miles per hour. How much time will pass before the second cyclist catches up with the first from the time the second cyclist started biking?

Two cyclists start biking from a trail's start 3 hours apart . The second cyclist travels at 10 miles per hours and starts 3 hours after the first cyclist who is traveling at 6 miles per hour. How much time will pass before the second cyclist catches up with the first from the time the second cyclist started biking?