Answer:
// program in C++ to check leap year.
// include header
#include<iostream>
using namespace std;
// main function
int main() {
// variable
int inp_year ;
// ask user to enter year
cout<<"Enter year:";
// read year
cin>>inp_year;
// check year is leap or not
if (((inp_year % 4 == 0) && (inp_year % 100 != 0)) || (inp_year % 400 == 0))
// if leap year , print leap year
cout<<inp_year<<" is a leap year.";
else
// print not leap year
cout<<inp_year<<" is not a leap year.";
return 0;
}
Explanation:
Read year from user.Then check if year is divisible by 4 and not divisible by 100 or year is divisible by 400 then year is leap year.otherwise year is not leap year.
Output:
Enter year:1712
1712 is a leap year.
Answer:
b
Explanation:
First, we need to initialize the classifier.
Then, we are required to train the classifier.
The next step is to predict the target.
And finally, we need to evaluate the classifier model.
You will find different algorithms for solving the classification problem. Some of them are like decision tree classification etc.
However, you need to know how these classifier works. And its explained before:
You need to initialize the classifier at first.
All kinds of classifiers in the scikit-learn make use of the method fit(x,y) for fitting the model or the training for the given training set in level y.
The predict(x) returns the y which is the predicted label.And this is prediction.
For evaluating the classifier model- the score(x,y) gives back the certain score for a mentioned test data x as well as the test label y.
<span>A. focus their visual attention on the next point on the road. A driver must have a target, it can be the car in front, a building pr a structure on the road. Targeting enables the driver to look further ahead on the road and thus be ready for any obstacle on the road.</span>
Answer:
int withinArray(int * intArray, int size, int * ptr) {
if(ptr == NULL) // if ptr == NULL return 0
return 0;
// if end of intArr is reached
if(size == 0)
return 0; // element not found
else
{
if(*(intArray+size-1) == *(ptr)) // check if (size-1)th element is equal to ptr
return 1; // return 1
return withinArray(intArray, size-1,ptr); // recursively call the function with size-1 elements
}
}
Explanation:
Above is the completion of the program.
