Answer:
Horizontal partitioning
Explanation:
As the planned software will be used inside an office, the ideal is that the system uses horizontal partitioning. This is because a clerk performs a large number of activities with a high degree of variability. To support this type of service, horizontal partitioning is recommended because it allows the partition of tables in many lines, in addition to promoting the connection between different tables. Vertical partitioning cannot do this type of activity, which would end up limiting software that would not work satisfactorily.
Answer:
Big Oh notation is used to asymptotically bound the growth of running time above and below the constant factor.
Big Oh notation is used to describe time complexity, execution time of an algorithm.
Big Oh describes the worst case to describe time complexity.
For the equation; T(N) = 10000*N + 0.00001*N^3.
To calculate first of all discard all th constants.
And therefore; worst case is the O(N^3).
Answer:
This exercise includes the following question and options:
What is the logical error in the coded query?
A) <em>The condition in the WHERE clause should be coded in the HAVING clause.</em>
B) <em>The column name for the fifth column in the result set doesn't match the data.</em>
C) <em>The three columns in the ORDER BY clause should use the DESC keyword so the city totals will be in the right sequence.</em>
D) <em>The condition in the HAVING clause should be coded in the WHERE clause.</em>
And from the options provided, the error is in the 5th column, due to the column name in that result series/group doesn't really coincide with the data, thereby the correct option is <em>B)</em>.
Answer:
Time the code takes to execute is O(n²)
Explanation:
The code forms an arithmetic series using it two loops.
n+(n-1)+(n-2)+........+2+1
=n(n+1)/2
=O(n²)
