Answer:
Merge sort is sort, which contains the same elements in the array to maintain original positions concerning each other. Complexity of sort is O (nLogn) and runtime is O(nlogn)
Explanation:
Estimate time spent on presorting an array 101 element in merge and binary search, two schemes can be used in the first scheme if 101 items in sequential search then use the complexity of O(n). In the second scheme covert, the list into an array then sort an array with the complexity of O(n log n) and fetch the 101 elements.
Merge 101 elements; presorted sub-array n items have to compare the top times in sub-array and choose the maximum item and place it in a sorted array. Time for merging is proportional to ( k-1) n.
Suppose the processing time of the merger is c.(k-1) .n then scale factor has the same value.
The processing time of a sorting array is a recurrence equation.
T(n) = 3T (n/3) + 2 cn
Similarly this implement for array of 105 element.
Answer:
collaboration diagram
Explanation:
Collaboration diagram -
It refers to the diagram , which showcase the link between the unified modeling language with the software object , is referred to as the collaboration diagram.
It is also called the communication diagram .
These diagram are very important for a company as it is the pictorial representation.
Various software are used to make these diagrams.
Answer:
IBM Watson is AI for business. Watson helps organizations predict future outcomes, automate complex processes, and optimize employees' time.
Explanation:
Answer:
Option: True
Explanation:
Microsoft Query can be used to retrieve data from external source such as databases. There are lots of databases or data sources which are accessible such as Microsoft Access, Microsoft Excel, Microsfot SQL Server OLAP Services, Oracle, Paradox, text file etc.
The steps mentioned in the question are correct. After finishing all the steps, user shall see the name of the data source will appears in the Choose Data Source dialog box.
