Answer:
Heap is useful when you want to find max/min element in the given list
BinarySearchTree is used if you need sorted elements of the list
Explanation:
Heap is Good at finding Min/Max and it's time complexity is (O(1)), while BST is good at all finds (O(logN)). Insert is O(logN) for Heap and BSTstructures..
Max Heap ensures that elements on higher levels are greater than elements at lower level
MinHeap ensures that elements on higher levels are lesser than elements at lower level
BST gives sorted elements by following order (left,root,right).If we want sorted elements we can go with BST
<span>Wireless networks usually use radio (b) signals to send data. </span>
Answer:
Sorry, this is too vague to understand as you don’t have any charts, graphs, or anything
Explanation:
Answer:
Given address = 94EA6
tag = 0 * 94 ( 10010100 )
line = 0 * 1 D 4 ( 111010100 )
word position = 0*6 ( 110 )
Explanation:
using the direct mapping method
Number of lines = 512
block size = 8 words
word offset = 
= 3 bit
index bit = 
= 9 bit
Tag = 20 - ( index bit + word offset ) = 20 - ( 3+9) = 8 bit
Given address = 94EA6
tag = 0 * 94 ( 10010100 )
line = 0 * 1 D 4 ( 111010100 )
word position = 0*6 ( 110 )
