Design a class named Employee. The class should keep the following information in member variables:
Employee name
Employee number
Hire Date
Write one or more constructors and the appropriate accessor and mutator functions for the class.
Next, write a class named ProductionWorker that is derived from the Employee class. The ProductionWorker class should have member variables to hold the following information:
Shift (an integer)
Hourly pay rate (a double)
The workday is divided into two shifts: day and night. The shift variable will hold an integer value representing the shift that the employee works. The day shift is shift 1 and the night shift is shift 2. Write one or more constructors and the appropriate accessor and mutator functions for the class. Demonstrate the classes by writing a program that uses a ProductionWorker object."
Now I have written out the program, it compiles without errors. However, when I run it It asks the first question "Employees name" after input it errors and closes itself down. Can anyone find where in my code it is causing it to do this please? To be clear, I am not asking for someone to write the program, I have already done this, just need to know why it compiles but does not run all the way through. Thank You!
#include
#include
#include
using namespace std;
class Employee
{
private:
string employeeName;
int employeeNumber;
int hireDate;
public:
void setemployeeName(string employeeName);
void setemployeeNumber(int);
void sethireDate(int);
string getemployeeName() const;
int getemployeeNumber() const;
int gethireDate() const;
Employee();
{
Answers
Answer:
Here is the code.
Explanation:
#include <iostream>
#include <cstdlib>
#include <string>
#include <iomanip>
using namespace std;
class Employee
{
private:
string employeeName;
int employeeNumber;
int hireDate;
public:
void setemployeeName(string employeeName);
void setemployeeNumber(int);
void sethireDate(int);
string getemployeeName() const;
int getemployeeNumber() const;
int gethireDate() const;
Employee();
};
void Employee::setemployeeName(string employeeName)
{
employeeName = employeeName;
}
void Employee::setemployeeNumber(int b)
{
employeeNumber = b;
}
void Employee::sethireDate(int d)
{
hireDate = d;
}
string Employee::getemployeeName() const
{
return employeeName;
}
int Employee::getemployeeNumber() const
{
return employeeNumber;
}
int Employee::gethireDate() const
{
return hireDate;
}
Employee::Employee()
{
cout << "Please answer some questions about your employees, ";
}
class ProductionWorker :public Employee
{
private:
int Shift;
double hourlyPay;
public:
void setShift(int);
void sethourlyPay(double);
int getShift() const;
double gethourlyPay() const;
ProductionWorker();
};
void ProductionWorker::setShift(int s)
{
Shift = s;
}
void ProductionWorker::sethourlyPay(double p)
{
hourlyPay = p;
}
int ProductionWorker::getShift() const
{
return Shift;
}
double ProductionWorker::gethourlyPay() const
{
return hourlyPay;
}
ProductionWorker::ProductionWorker()
{
cout << "Your responses will be displayed after all data has been received. "<<endl;
}
int main()
{
ProductionWorker info;
string name;
int num;
int date;
int shift;
double pay;
cout << "Please enter employee name: ";
cin >> name;
cout << "Please enter employee number: ";
cin >> num;
cout << "Please enter employee hire date using the format \n";
cout << "2 digit month, 2 digit day, 4 digit year as one number: \n";
cout << "(Example August 12 1981 = 08121981)";
cin >> date;
cout << "Which shift does the employee work: \n";
cout << "Enter 1, 2, or 3";
cin >> shift;
cout << "Please enter the employee's rate of pay: ";
cin >> pay;
info.setemployeeName(name);
info.setemployeeNumber(num);
info.sethireDate(date);
info.setShift(shift);
info.sethourlyPay(pay);
cout << "The data you entered for this employee is as follows: \n";
cout << "Name: " << info.getemployeeName() << endl;
cout << "Number: " << info.getemployeeNumber() << endl;
cout << "Hire Date: " << info.gethireDate() << endl;
cout << "Shift: " << info.getShift() << endl;
cout << setprecision(2) << fixed;
cout << "Pay Rate: " << info.gethourlyPay() << endl;
system("pause");
return 0;
}
Related Questions
computer is an ............. machine because once a task is intitated computer proceeds on its own t ill its completion.
Answers
Answer:
I think digital,versatile
computer is an electronic digital versatile machine because once a task is initiated computer proceeds on its own till its completation.
Given two regular expressions r1 and r2, construct a decision procedure to determine whether the language of r1 is contained in the language r2; that is, the language of r1 is a subset of the language of r2.
Answers
Answer:
Test if L(M1-2) is empty.
Construct FA M2-1 from M1 and M2 which recognizes the language L(>M2) - L(>M1).
COMMENT: note we use the algorithm that is instrumental in proving that regular languages are closed with respect to the set difference operator.
Test if L(M2-1) is empty.
Answer yes if and only if both answers were yes.
Explanation:
An algorithm must be guaranteed to halt after a finite number of steps.
Each step of the algorithm must be well specified (deterministic rather than non-deterministic).
Three basic problems:
Given an FA M and an input x, does M accept x?
Is x in L(M)
Given an FA M, is there a string that it accepts?
Is L(M) the empty set?
Given an FA M, is L(M) finite?
Algorithm for determining if M accepts x.
Simply execute M on x.
Output yes if we end up at an accepting state.
This algorithm clearly halts after a finite number of steps, and it is well specified.
This algorithm is also clearly correct.
Testing if L(M) is empty.
Incorrect "Algorithm"
Simulate M on all strings x.
Output yes if and only if all strings are rejected.
The "algorithm" is well specified, and it is also clearly correct.
However, this is not an algorithm because there are an infinite number of strings to simulate M on, and thus it is not guaranteed to halt in a finite amount of time.
COMMENT: Note we use the algorithm for the first problem as a subroutine; you must think in this fashion to solve the problems we will ask.
Correct Algorithm
Simulate M on all strings of length between 0 and n-1 where M has n states.
Output no if and only if all strings are rejected.
Otherwise output yes.
This algorithm clearly halts after a finite number of steps, and it is well specified.
The correctness of the algorithm follows from the fact that if M accepts any strings, it must accept one of length at most n-1.
Suppose this is not true; that is, L(M) is not empty but the shortest string accepted by M has a length of at least n.
Let x be the shortest string accepted by M where |x| > n-1.
Using the Pumping Lemma, we know that there must be a "loop" in x which can be pumped 0 times to create a shorter string in L.
This is a contradiction and the result follows.
COMMENT: There are more efficient algorithms, but we won't get into that.
Testing if L(M) is finite
Incorrect "Algorithm"
Simulate M on all strings x.
Output yes if and only if there are a finite number of yes answers.
This "algorithm" is well specified and correct.
However, this is not an algorithm because there are an infinite number of strings to simulate M on, and thus it is not guaranteed to halt in a finite amount of time.
COMMENT: Note we again use the algorithm for the first problem as a subroutine.
Correct Algorithm
Simulate M on all strings of length between n and 2n-1 where M has n states.
Output yes if and only if no string is accepted.
Otherwise output no.
This algorithm clearly halts after a finite number of steps, and it is well specified.
The correctness of the algorithm follows from the fact that if M accepts an infinite number of strings, it must accept one of length between n and 2n-1.
This builds on the idea that if M accepts an infinite number of strings, there must be a "loop" that can be pumped.
This loop must have length at most n.
When we pump it 0 times, we have a string of length less than n.
When we pump it once, we increase the length of the string by at most n so we cannot exceed 2n-1. The problem is we might not exceed n-1 yet.
The key is we can keep pumping it and at some point, its length must exceed n-1, and in the step it does, it cannot jump past 2n-1 since the size of the loop is at most n.
This proof is not totally correct, but it captures the key idea.
COMMENT: There again are more efficient algorithms, but we won't get into that.
Other problems we can solve using these basic algorithms (and other algorithms we've seen earlier this chapter) as subroutines.
COMMENT: many of these algorithms depend on your understanding of basic set operations such as set complement, set difference, set union, etc.
Given a regular expression r, is Lr finite?
Convert r to an equivalent FA M.
COMMENT: note we use the two algorithms for converting a regular expression to an NFA and then an NFA to an FA.
Test if L(M) is finite.
Output the answer to the above test.
Given two FAs M1 and M2, is L(M1) = L(M2)?
Construct FA M1-2 from M1 and M2 which recognizes the language L(>M1) - L(>M2).
COMMENT: note we use the algorithm that is instrumental in proving that regular languages are closed with respect to the set difference operator.
Test if L(M1-2) is empty.
Construct FA M2-1 from M1 and M2 which recognizes the language L(>M2) - L(>M1).
COMMENT: note we use the algorithm that is instrumental in proving that regular languages are closed with respect to the set difference operator.
Test if L(M2-1) is empty.
Answer yes if and only if both answers were yes.
Ten examples of an interpreter
Answers
Answer:
Some popular examples of today's interpreters are:
Interpreter of PythonInterpreter for RubyPerl performerInterpreter for PHPMATLAB UCSD PascalExplanation:
An interpreter executes the commands directly in an object code or a machine code, written in a program or a scripting language.
The Interpreter can be referred to as system software that can read and execute the programme instead of interpreting programmes. This interpretation includes high-level source code, pre-compiled programmes and scripts.
It is important to note that the interpreter translates programme by programme line, meaning that one statement is translated on one go. This feature makes it easy for programmers to check any line on debugging but slows the whole programme running time.
The _________ attack exploits the common use of a modular exponentiation algorithm in RSA encryption and decryption, but can be adapted to work with any implementation that does not run in fixed time.
A. mathematical.
B. timing.
C. chosen ciphertext.
D. brute-force.
Answers
Answer:
chosen ciphertext
Explanation:
Chosen ciphertext attack is a scenario in which the attacker has the ability to choose ciphertexts C i and to view their corresponding decryptions – plaintexts P i . It is essentially the same scenario as a chosen plaintext attack but applied to a decryption function, instead of the encryption function.
Cyber attack usually associated with obtaining decryption keys that do not run in fixed time is called the chosen ciphertext attack.
Theae kind of attack is usually performed through gathering of decryption codes or key which are associated to certain cipher texts The attacker would then use the gathered patterns and information to obtain the decryption key to the selected or chosen ciphertext.Hence, chosen ciphertext attempts the use of modular exponentiation.
Learn more : https://brainly.com/question/14826269
Which of the following CALL instructions writes the contents of EAX to standard output as a signed decimal integer?
a. call WriteInteger
b. call WriteDec
c. call WriteHex
d. call WriteInt
Answers
Answer:
d. call WriteInt
Explanation:
Required
Instruction to write to decimal integer
Of the 4 instructions, the call WriteInt instruction is used write to a decimal integer.
This is so, because the WriteInt instruction writes a signed decimal integer to standard output.
This implies that the output will have a sign (positive or negative) and the output will start from a digit other than 0 (i.e. no leading zero)
Use ordinary pipes to implement an inter-process communication scheme for message passing between processes. Assume that there are two directories, d1 and d2, and there are different files in each one of them. Also, each file contains a short-length string of characters. You have to use a parent process that forks two children processes, and have each child process check one of the directories.
Answers
Answer:
Yup
Explanation:
How are dates and times stored by Excel?
Answers
Answer:
Regardless of how you have formatted a cell to display a date or time, Excel always internally stores dates And times the same way. Excel stores dates and times as a number representing the number of days since 1900-Jan-0, plus a fractional portion of a 24 hour day: ddddd. tttttt
Explanation:
mark me as BRAINLIEST
follow me
carry on learning
100 %sure
