What needs to be true of data used in consolidation

Computers and Technology

1 answer:

Dahasolnce [82]4 years ago

5 0

Data consolidation is a collection and integration of data from multiple sources into a single destination.

Explanation:

Data consolidation allows you collect all your datas together from seperate worksheet into a master worksheet. Its function is to take data from a series of worksheet or workbooks and summaries it into a worksheet that can be updated easily.

During the process of data consolidation the different data sources are gathered together or consolidated into a single data source.

To consolidate first step is to open all files that contains data then ensure that data is organized in the same way and the third step is on the data ribbons select data tools and then consolidate. In the final step select the method of consolidation .

Consolidation is important strategically as the company looks to grow important share and market.

You might be interested in

The quality of lacking a pattern or organization so that result are unpredictable is also known as?

Aloiza [94]

<h2>Answer:</h2>

The quality of lacking a pattern or organization so that result are unpredictable is also known as<u> Randomness.</u>

<h2>Explanation:</h2>

In the daily routine work, randomness can be defined as the apparent lack of pattern. Randomness occurs when there is no predictability in events. Thus a random pattern of events, steps or symbols often has no sequence and order so they lead eventually towards Randomness. Similarly when elements will not follow an intelligible pattern or a proper combination they will result in Randomness.

3 0

3 years ago

Consider the following modification to the Merge Sort algorithm: divide the input array into thirds (rather than halves), recurs

ehidna [41]

Answer:

The correct answer to the following question will be "n logn".

Explanation:

Time Complexity should be the same as the whole last particular instance, just the log base keeps changing with three.
Throughout the circumstance of separating 2 arrays, we want one correlation. however, for splitting between 3-way arrays, will require 2 comparisons to sort.
However, after breaking the array into 3, we can lower the number of transfers by growing the comparison. So the time complexity would then persist the same, but the log should get base 3 as we've classified into different parts.

So the time complexity will be:

⇒ $T(n)=3T(\frac{n}{3})+ O(n)$