Answer:
O(N!), O(2N), O(N2), O(N), O(logN)
Explanation:
N! grows faster than any exponential functions, leave alone polynomials and logarithm. so O( N! ) would be slowest.
2^N would be bigger than N². Any exponential functions are slower than polynomial. So O( 2^N ) is next slowest.
Rest of them should be easier.
N² is slower than N and N is slower than logN as you can check in a graphing calculator.
NOTE: It is just nitpick but big-Oh is not necessary about speed / running time ( many programmers treat it like that anyway ) but rather how the time taken for an algorithm increase as the size of the input increases. Subtle difference.
Answer:
The answer is "Option d'.
Explanation:
The database provides a single graphical view of the data, but it provides the facility to use logical view concept, that uses by view command, that uses the dataset to provide a logical view, that shows data according to user condition, and certain options were incorrect which can be described as follows:
- In option a, In logical viewing data, it is not used.
- In option b, It doesn't represent entry screen it simply shows detail.
- In option c, this command doesn't allow you to create duplicate data.
Answer:
The solution code is written in C++
- bool STATUS = true;
- bool alternator ()
- {
- if(STATUS){
- STATUS = false;
- return true;
- }else{
- STATUS = true;
- return false;
- }
- }
Explanation:
We need a global variable to track the status of true or false (Line 1).
Next, create the function alternator (Line 2) and then check if current status is true, set the status to false but return the previous status boolean value (Line 5-6). At the first time of function invocation, it will return true.
The else block will set the STATUS to true and return the false (Line 7-9).
