Answer:
False
Explanation:
The RAM does lose its memory when you turn off the computer, unlike hard drive which is slower but keeps memory
Answer: Stratified sample
Explanation:
For preparing samples of various data of companies and enterprises we need to apply probability distribution to different samples of data. Here in the question we are to apply a representative sample from a list of 200 customers who have complained about errors in their statement. So here we can apply stratified sampling where we can divide the 200 customers into separate groups. These sub groups of the customers are known as stratas. These stratas are selected based on certain characteristics which can be identified among the customers group. Here we can form subgroups based on the type of complain that has been lodged by the customer and selecting 5 customers from four zip codes. Then it would be easy to apply probability distribution to the sub groups to derive information from them.
This process would also enable a more easier and cheaper way of sampling the customer data.
Answer:
It gives credit to the original author and shows that you are not taking credit for someone
else's work
Answer:a)Stand-alone
Explanation: Stand-alone application is the application that is found on the system of every client.In accordance with the IT section, Business intelligence can be transferred into stand-alone application .This helps in the development of the essence of the system at an independent level.
Other options are incorrect because supporting a certain factor will not make it independent, cannot act as the group of ISs technology or web system for gaining profit.Thus,the correct option is option(a).
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).
