Question

The university roster will be stored using an array list (class StudentList). StudentList works as a regular arrayList, but instead of being a template class, it can only hold Student objects. We design it this way because some operations of StudentList would not be applicable to other objects. The StudentList class has the following attributes: int size int length Student *list (pointer for dynamic array of students) Complete all the methods of studentList.h to be able to continue with the homework

**Please do it in C++***

Answer 1

class StudentList{
private:
int size;
int length;
Student *list;
void grow();
public:
StudentList::StudentList() {
size = 10;
length = 0;
List = new Student[size];
}
StudentList::~StudentList() {
delete[] list;
}
int StudentList::Size() {
return length;
}
bool StudentList::isEmpty() {
return size() == 0;
}
void StudentList::push_back(Student n) {
if (length == size) {
grow();
}
list[length] = n;
length++;
}
void StudentList::pop_back() {
if (isEmpty()) {
return;
}
length--;
}
void StudentList::grow() {
Student *tmp = new Student[++size];
for (int i = 0; i < size - 1; i++) {
tmp[i] = list[i];
}
delete [] list;
list = tmp;
}
};

comment down for any queries

please give a thumbs up