Answer:
You might already be familiar with the 6×6 rule. This presentation rule suggests that you should include no more than six words per line and no more than six bullet points per slide. The goal is to keep your slide from being so dense and packed with information that people don't want to look at it
Answer:
#include <iostream>
using namespace std;
class DogLicense{
public:
void SetYear(int yearRegistered);
void CreateLicenseNum(int customID);
int GetLicenseNum() const;
private:
int licenseYear;
int licenseNum;
};
void DogLicense::SetYear(int yearRegistered) {
licenseYear = yearRegistered;
}
void DogLicense::CreateLicenseNum(int customID) {
licenseNum = (100000 * customID) + licenseYear;
}
int DogLicense::GetLicenseNum() const {
return licenseNum;
}
int main() {
DogLicense dog1;
dog1.SetYear(2014);
dog1.CreateLicenseNum(777);
cout << "Dog license: " << dog1.GetLicenseNum() << endl;
return 0;
}
Explanation:
You can see the whole code above, but let me explain the fixed function.
void DogLicense::CreateLicenseNum(int customID) {
licenseNum = (100000 * customID) + licenseYear;
}
The function header is already declared in the class. It takes <em>customID</em> as a parameter. To find out the <em>lisenseNum</em>, we need to apply the given formula <em><u>(100000 * customID) + licenseYear</u></em>.
Answer:
X is in NP and Y is in NP-HARD ( A )
Explanation:
X is in NP and Y is in NP-HARD can be inferred from the previous statement made in the problem above because problem decision X can be in NP if it can BE reducible to a 3-SAT polynomial real time, if that can be achieved then 3SAT will be in NP since SAT is in NP as well.
also problem decision Y can be in NP-HARD if 3SAT can be reducible to it in polynomial time as well hence option A is the correct option
