Suppose you are given a data set consisting of nominal attributes, such as color, which takes values such as red, blue, green et
1 answer:
You might be interested in
Answer:
The function in C++ is as follows:
int isSorted(int ar[], int n){
if ( ||
){
return 1;}
if ( <
){
return 0;}
return isSorted(ar, n - 1);}
Explanation:
This defines the function
int isSorted(int ar[], int n){
This represents the base case; n = 1 or 0 will return 1 (i.e. the array is sorted)
if ( ||
){
return 1;}
This checks if the current element is less than the previous array element; If yes, the array is not sorted
if ( <
){
return 0;}
This calls the function, recursively
return isSorted(ar, n - 1);
}
Answer:
code = 010100000001101000101
Explanation:
Steps:
The inequality yields , where M = 16. Therefore,
The second step will be to arrange the data bits and check the bits. This will be as follows:
Bit position number Check bits Data Bits
21 10101
20 10100
The bits are checked up to bit position 1
Thus, the code is 010100000001101000101