Answer:
Here the statement is false.
Explanation:
In C/C++, we can define multidimensional arrays in simple words as an array of arrays. Data in multidimensional arrays are stored in tabular form (in row-major order).
General form of declaring N-dimensional arrays:
data_type array_name[size1][size2]....[sizeN];
data_type: Type of data to be stored in the array.
Here data_type is valid C/C++ data type
array_name: Name of the array
size1, size2,... ,sizeN: Sizes of the dimensions.
Foe example:
Two dimensional array:
int two_d[10][20];
Three dimensional array:
int three_d[10][20][30];
A=Application software
C=Microcomputer
D=hybrid computers
E=digital computer
F=Handheld computer
G=Dextop computer
Sorry,i couldn't help you in B.
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: Answer below.
Explanation:
I'm not fully sure myself, so don't agree with me fully.
I believe what she may have done wrong is tell the technician about a "program." A program doesn't have to do anything with physical hardware.
Answer:.......
void clear(int *array, int length){
if (length == 0)return;
array[0] = 0;
clear(array + 1, length-1);
}
Explanation:
The void function accepts an integer array.
