Virtual Functions C++
Problem Statement :
This problem is to get you familiar with virtual functions. Create three classes Person, Professor and Student. The class Person should have data members name and age. The classes Professor and Student should inherit from the class Person. The class Professor should have two integer members: publications and cur_id. There will be two member functions: getdata and putdata. The function getdata should get the input from the user: the name, age and publications of the professor. The function putdata should print the name, age, publications and the cur_id of the professor. The class Student should have two data members: marks, which is an array of size 6 and cur_id. It has two member functions: getdata and putdata. The function getdata should get the input from the user: the name, age, and the marks of the student in 6 subjects. The function putdata should print the name, age, sum of the marks and the cur_id of the student. For each object being created of the Professor or the Student class, sequential id's should be assigned to them starting from 1. Solve this problem using virtual functions, constructors and static variables. You can create more data members if you want. Note: Expand the main function to look at how the input is being handled. Input Format The first line of input contains the number of objects that are being created. If the first line of input for each object is 1, it means that the object being created is of the Professor class, you will have to input the name, age and publications of the professor. If the first line of input for each object is 2, it means that the object is of the Student class, you will have to input the name, age and the marks of the student in 6 subjects. Constraints 1 <= age <= 80 1 <= publicatons <= 1000 0 <= marks <= 100 , where marks is the marks of the student in each subject. Output Format There are two types of output depending on the object. If the object is of type Professor, print the space separated name, age, publications and id on a new line. If the object is of the Student class, print the space separated name, age, the sum of the marks in 6 subjects and id on a new line.
Solution :
Solution in C :
class Person {
protected:
string name;
int age;
public:
static int prof_id;
static int stud_id;
virtual void getdata()=0;
virtual void putdata()=0;
};
int Person::prof_id = 1;
int Person::stud_id = 1;
class Student : public Person{
public:
int marks[6];
int cur_id;
Student() {
cur_id = stud_id++;
}
void getdata() {
cin >> name >> age;
for(int i = 0; i < 6; ++i) cin >> marks[i];
}
void putdata() {
int sum = 0;
for(int i = 0; i < 6; ++i) sum += marks[i];
cout << name << ' ' << age << ' ' << sum << ' ' << cur_id << endl;
}
};
class Professor : public Person{
public:
Professor() {
cur_id = prof_id++;
}
int publications;
int cur_id;
void getdata() {
cin >> name >> age >> publications;
}
void putdata() {
cout << name << ' ' << age << ' ' << publications << ' ' << cur_id << endl;
}
};
View More Similar Problems
Truck Tour
Suppose there is a circle. There are N petrol pumps on that circle. Petrol pumps are numbered 0 to (N-1) (both inclusive). You have two pieces of information corresponding to each of the petrol pump: (1) the amount of petrol that particular petrol pump will give, and (2) the distance from that petrol pump to the next petrol pump. Initially, you have a tank of infinite capacity carrying no petr
View Solution →Queries with Fixed Length
Consider an -integer sequence, . We perform a query on by using an integer, , to calculate the result of the following expression: In other words, if we let , then you need to calculate . Given and queries, return a list of answers to each query. Example The first query uses all of the subarrays of length : . The maxima of the subarrays are . The minimum of these is . The secon
View Solution →QHEAP1
This question is designed to help you get a better understanding of basic heap operations. You will be given queries of types: " 1 v " - Add an element to the heap. " 2 v " - Delete the element from the heap. "3" - Print the minimum of all the elements in the heap. NOTE: It is guaranteed that the element to be deleted will be there in the heap. Also, at any instant, only distinct element
View Solution →Jesse and Cookies
Jesse loves cookies. He wants the sweetness of all his cookies to be greater than value K. To do this, Jesse repeatedly mixes two cookies with the least sweetness. He creates a special combined cookie with: sweetness Least sweet cookie 2nd least sweet cookie). He repeats this procedure until all the cookies in his collection have a sweetness > = K. You are given Jesse's cookies. Print t
View Solution →Find the Running Median
The median of a set of integers is the midpoint value of the data set for which an equal number of integers are less than and greater than the value. To find the median, you must first sort your set of integers in non-decreasing order, then: If your set contains an odd number of elements, the median is the middle element of the sorted sample. In the sorted set { 1, 2, 3 } , 2 is the median.
View Solution →Minimum Average Waiting Time
Tieu owns a pizza restaurant and he manages it in his own way. While in a normal restaurant, a customer is served by following the first-come, first-served rule, Tieu simply minimizes the average waiting time of his customers. So he gets to decide who is served first, regardless of how sooner or later a person comes. Different kinds of pizzas take different amounts of time to cook. Also, once h
View Solution →