Question

Using C++, fix the following code so that

(1) Change the student array storage part so that the data is loaded from a file "students.txt". Use an appropriate data   
termination flag.

(2) Sort the student array in ascending order of GPA using insertion sort.

Print the sorted array

(3) Sort the student array in ascending order of ID using insertion sort.

Print the sorted array

(4) Illustrate Binary search for a particular ID that would be found and one that would not be found.

CODE:

#include <iostream>

using namespace std;

struct Date {

int year;

int month;

int day;

};

/*

Declare a struct that can hold a student's record, where each

record contains an ID (int), number of courses taken (int) and

GPA (double).   

*/

struct Student {

int ID;

int numC;

double GPA;

};

void storeStuArray (Student stus[], int max) {

for (int j = 0; j < 8; j++){

stus[j].ID = (j+1) * 1000;

stus[j].numC = (j+1) * 2;

stus[j].GPA = (j % 9)/2.0;

}

}

//Write a function, which given an ID of a student,

//returns the total number of courses that student

//is taking. Print an appropriate message if the student

//does not exist.

int getNumCourses (Student stus[], int max, int target) {

for (int j = 0; j < 8; j++)

if (stus[j].ID == target)

return stus[j].numC;

}   

void printStuArray (Student stus[], int max) {

cout << endl<< "Student data" << endl;

for (int j=0;j<max;j++) {

cout << "Student ID= "<<stus[j].ID <<endl;

cout << "No of courses= "<<stus[j].numC <<endl;

cout << "GPA= "<<stus[j].GPA<<endl;

}

}  

//ID of student with highest GPA

int highGPA (Student stus[], int max) {

double highGPA=stus[0].GPA;

int highID=stus[0].ID;

for (int j=1;j<max;j++)

if (stus[j].GPA >highGPA) {

highGPA=stus[j].GPA;

highID=stus[j].ID;

}

cout << endl<<"High ID=" << highID <<"GPA="<<highGPA;

return highID;

}   

int main() {

void storeStuArray (Student stus[], int max);

cout << "STUDENT PROCESSING";

Student stus[8];

storeStuArray (stus, 8);

printStuArray (stus, 8);

cout <<endl<<"Finding highest GPA ID";

int highID=highGPA (stus,8);

cout << endl<< "High ID=" <<highID;

int val=getNumCourses (stus, 8, 8000);

cout <<endl<<"Student is following " << val << " courses";

system("pause");

}

/*

*/   

Answer 1

If you have any doubts, please give me comment...

#include <iostream>

#include <fstream>

using namespace std;

struct Date {

int year;

int month;

int day;

};

/*

Declare a struct that can hold a student's record, where each

record contains an ID (int), number of courses taken (int) and

GPA (double).

*/

struct Student {

int ID;

int numC;

double GPA;

};

int storeStuArray(Student stus[], int max) {

ifstream in;

in.open("students.txt");

int i = 0;

while (!in.eof() && i < max) {

in >> stus[i].ID >> stus[i].numC >> stus[i].GPA;

i++;

}

}

// Write a function, which given an ID of a student,

// returns the total number of courses that student

// is taking. Print an appropriate message if the student

// does not exist.

int getNumCourses(Student stus[], int max, int target) {

for (int j = 0; j < 8; j++)

if (stus[j].ID == target)

return stus[j].numC;

}

void printStuArray(Student stus[], int max) {

cout << endl << "Student data" << endl;

for (int j = 0; j < max; j++) {

cout << "Student ID= " << stus[j].ID << endl;

cout << "No of courses= " << stus[j].numC << endl;

cout << "GPA= " << stus[j].GPA << endl;

}

}

// ID of student with highest GPA

int highGPA(Student stus[], int max) {

double highGPA = stus[0].GPA;

int highID = stus[0].ID;

for (int j = 1; j < max; j++)

if (stus[j].GPA > highGPA) {

highGPA = stus[j].GPA;

highID = stus[j].ID;

}

cout << endl << "High ID=" << highID << "GPA=" << highGPA;

return highID;

}

void sortByGPA(Student stus[], int n) {

int i, j;

Student temp;

for (i = 1; i < n; i++) {

temp = stus[i];

j = i - 1;

while (j >= 0 && stus[j].GPA > temp.GPA) {

stus[j + 1] = stus[j];

j = j - 1;

}

stus[j + 1] = temp;

}

}

void sortByID(Student stus[], int n) {

int i, j;

Student temp;

for (i = 1; i < n; i++) {

temp = stus[i];

j = i - 1;

while (j >= 0 && stus[j].ID > temp.ID) {

stus[j + 1] = stus[j];

j = j - 1;

}

stus[j + 1] = temp;

}

}

int binarySearch(Student stus[], int n, int searchID) {

int l = 0, r = n - 1;

while (l <= r) {

int m = l + (r - l) / 2;

if (stus[m].ID == searchID)

return m;

if (stus[m].ID < searchID)

l = m + 1;

else

r = m - 1;

}

return -1;

}

int main() {

cout << "STUDENT PROCESSING";

Student stus[8];

int n = storeStuArray(stus, 8);

printStuArray(stus, n);

cout << endl << "Finding highest GPA ID";

int highID = highGPA(stus, n);

cout << endl << "High ID=" << highID;

int val = getNumCourses(stus, n, 8000);

cout << endl << "Student is following " << val << " courses";

sortByID(stus, n);

cout << "After sorting by ID: " << endl;

printStuArray(stus, n);

sortByGPA(stus, n);

cout << "After sorting by GPA: " << endl;

printStuArray(stus, n);

int searchID;

cout << "Enter ID to search: ";

cin >> searchID;

int pos = binarySearch(stus, n, searchID);

if (pos == -1)

cout << "Student ID not found in list" << endl;

else

cout << "Student ID Found in index " << pos << endl;

// system("pause");

}

/*

*/