nein_yards

Untitled

May 4th, 2022 (edited)
116
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 4.46 KB | None | 0 0
  1. #include <iostream>
  2. #include <fstream>
  3. using namespace std;
  4.  
  5. double* studentscores(char* key, char** student_answers, int numstud, int numq);
  6. double best_grade(double* grades, int numStudents);
  7. double lowest_grade(double* grades, int numStudents);
  8. char score_to_letter_grade(double score);
  9. void save_grades(char** studentIds, char** studentAnswers, double* grades, int numStudents, int idlen);
  10. void display(char** studentIds, char** studentAnswers, double* grades, int numStudents, int idlen);
  11.  
  12. int main()
  13. {
  14.     int numStudents, idlen, numq;
  15.    
  16.  
  17.     ifstream fin("hist101midterm1.txt");
  18.  
  19.     if (fin.fail())
  20.     {
  21.         cout << "Failed opening the file";
  22.         exit(1);
  23.     }
  24.  
  25.     fin >> numStudents >> idlen >> numq;
  26.  
  27.     char** studentIds = new char* [numStudents];
  28.     char* key = new char[numq + 1];
  29.     char** studentAnswers = new char* [numStudents];
  30.     for (int i = 0; i < numStudents; i++)
  31.     {
  32.         studentAnswers[i] = new char[numq + 1];
  33.         studentIds[i] = new char[idlen + 1];
  34.     }
  35.  
  36.     fin >> key;
  37.  
  38.     for (int i = 0; i < numStudents; i++)
  39.     {
  40.         fin >> studentIds[i];
  41.         fin >> studentAnswers[i];
  42.     }
  43.  
  44.     double* grades = studentscores(key, studentAnswers, numStudents, numq);
  45.  
  46.     save_grades(studentIds, studentAnswers, grades, numStudents, idlen);
  47.     display(studentIds, studentAnswers, grades, numStudents, idlen);
  48.  
  49.     delete[] grades;
  50.     delete[] key;
  51.     for (int i = 0; i < numStudents; i++) {
  52.         delete[] studentIds[i];
  53.         delete[] studentAnswers[i];
  54.     }
  55.     delete[] studentIds;
  56.     delete[] studentAnswers;
  57.  
  58.     return 0;
  59. }
  60.  
  61. double best_grade(double* grades, int numStudents) {
  62.     double result = grades[0];
  63.     for (int i = 1; i < numStudents; i++)
  64.         if (result < grades[i])
  65.             result = grades[i];
  66.     return result;
  67. }
  68.  
  69. double lowest_grade(double* grades, int numStudents) {
  70.     double result = grades[0];
  71.     for (int i = 1; i < numStudents; i++)
  72.         if (result > grades[i])
  73.             result = grades[i];
  74.     return result;
  75. }
  76.  
  77. char score_to_letter_grade(double score) {
  78.     char result = '_';
  79.     if (score >= 90)
  80.         result = 'A';
  81.     else if (score >= 80)
  82.         result = 'B';
  83.     else if (score >= 70)
  84.         result = 'C';
  85.     else if (score >= 60)
  86.         result = 'D';
  87.     else if (score >= 0)
  88.         result = 'F';
  89.  
  90.     return result;
  91. }
  92.  
  93.  
  94. double* studentscores(char* key, char** student_answers, int numstud, int numq)
  95. {
  96.     double* score = new double[numstud];
  97.  
  98.     int numcorrect;
  99.  
  100.     for (int i = 0; i < numstud; i++)
  101.     {
  102.         numcorrect = 0;
  103.         for (int j = 0; j < numq; j++)
  104.             if (key[j] == student_answers[i][j])
  105.                 numcorrect++;
  106.  
  107.         score[i] = (double)numcorrect / numq * 100;
  108.     }
  109.     return score;
  110. }
  111.  
  112.  
  113. void save_grades(char** studentIds, char** studentAnswers, double* grades, int numStudents, int idlen)
  114. {
  115.     ofstream fout("saved.txt");
  116.  
  117.     double bestGrade = best_grade(grades, numStudents);
  118.     double lowestGrade = lowest_grade(grades, numStudents);
  119.  
  120.     char* bestId = new char[idlen + 1];
  121.     char* lowestId = new char[idlen + 1];
  122.  
  123.     fout << "Student ID\t------ Answers ----\tPercent\tGrade\n";
  124.     for (int i = 0; i < numStudents; i++) {
  125.         fout << studentIds[i] << "\t" << studentAnswers[i] << "\t";
  126.         fout << grades[i] << "\t" << score_to_letter_grade(grades[i]) << endl;
  127.     }
  128.  
  129.     fout << "Highest grade is " << bestGrade << " for student ";
  130.     for (int i = 0; i < numStudents; i++)
  131.         if (grades[i] == bestGrade)
  132.             fout << studentIds[i] << " ";
  133.     fout << endl;
  134.  
  135.     fout << "Lowest grade is " << lowestGrade << " for student ";
  136.     for (int i = 0; i < numStudents; i++)
  137.         if (grades[i] == lowestGrade)
  138.             fout << studentIds[i] << " ";
  139.     fout << endl;
  140.     fout.close();
  141.  
  142.     delete[] bestId;
  143.     delete[] lowestId;
  144. }
  145.  
  146. void display(char** studentIds, char** studentAnswers, double* grades, int numStudents, int idlen)
  147. {
  148.     double bestGrade = best_grade(grades, numStudents);
  149.     double lowestGrade = lowest_grade(grades, numStudents);
  150.  
  151.     char* bestId = new char[idlen + 1];
  152.     char* lowestId = new char[idlen + 1];
  153.  
  154.     cout << "Student ID\t------ Answers ----\tPercent\tGrade\n";
  155.     for (int i = 0; i < numStudents; i++) {
  156.         cout << studentIds[i] << "\t" << studentAnswers[i] << "\t";
  157.         cout << grades[i] << "\t" << score_to_letter_grade(grades[i]) << endl;
  158.     }
  159.  
  160.     cout << "Highest grade is " << bestGrade << " for student ";
  161.     for (int i = 0; i < numStudents; i++)
  162.         if (grades[i] == bestGrade)
  163.             cout << studentIds[i] << " ";
  164.     cout << endl;
  165.  
  166.     cout << "Lowest grade is " << lowestGrade << " for student ";
  167.     for (int i = 0; i < numStudents; i++)
  168.         if (grades[i] == lowestGrade)
  169.             cout << studentIds[i] << " ";
  170.     cout << endl;
  171.  
  172.     delete[] bestId;
  173.     delete[] lowestId;
  174. }
  175.  
Add Comment
Please, Sign In to add comment