-
Notifications
You must be signed in to change notification settings - Fork 0
/
test2.cpp
237 lines (199 loc) · 6.42 KB
/
test2.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
// #include <iostream>
// using namespace std;
// bool search(int *arr, int size, int k)
// {
// for(int i=0;i<size;i++){
// cout<<arr[i]<<" ";
// }cout<<endl;
// if (size == 0)
// {
// return false; // Base case: Element not found
// }
// if (arr[0] == k)
// {
// return true; // Base case: Element found
// }
// // Recursive case: Search in the remaining portion of the array
// return search(arr + 1, size - 1, k);
// }
// int main()
// {
// int arr[] = {5, 3, 2, 8, 10, 7};
// int n = sizeof(arr) / sizeof(arr[0]);
// int target = 8;
// bool found = search(arr, n, target);
// if (found)
// {
// std::cout << "Element " << target << " found in the array." << std::endl;
// }
// else
// {
// std::cout << "Element " << target << " not found in the array." << std::endl;
// }
// return 0;
//}
// #include <iostream>
// void insertionSortDescending(int arr[], int n) {
// for (int i = 1; i < n; i++) {
// int key = arr[i];
// int j = i - 1;
// // Move elements of arr[0..i-1] that are greater than key
// // one position ahead of their current position
// while (j >= 0 && arr[j] < key) {
// std::cout<<arr[j+1]<<arr[j]<<"\n";
// arr[j +1] = arr[j];
// std::cout<<arr[j+1]<<arr[j]<<"\n";
// j--;
// }
// arr[j + 1] = key;
// }
// }
// int main() {
// int arr[] = {4,8,12,5,4};
// int n = sizeof(arr) / sizeof(arr[0]);
// std::cout << "Original Array: ";
// for (int i = 0; i < n; i++) {
// std::cout << arr[i] << " ";
// }
// std::cout << std::endl;
// insertionSortDescending(arr, n);
// std::cout << "Sorted Array (Descending Order): ";
// for (int i = 0; i < n; i++) {
// std::cout << arr[i] << " ";
// }
// std::cout << std::endl;
// return 0;
// }
#include <iostream>
#include <string>
#include <vector>
#include <iomanip> // Include iomanip for formatting output
using namespace std;
// Subject Class
class Subject {
public:
string name;
int ca_marks;
int tee_marks;
char grade;
// Constructor
Subject(string subjectName, int ca, int tee)
: name(subjectName), ca_marks(ca), tee_marks(tee), grade(' ') {}
// Calculate total marks (CA + TEE)
int totalMarks() {
return ca_marks + tee_marks;
}
// Method to calculate grade based on total marks
void calculateGrade() {
int total = totalMarks();
if (total >= 90)
grade = 'A';
else if (total >= 80)
grade = 'B';
else if (total >= 70)
grade = 'C';
else if (total >= 60)
grade = 'D';
else
grade = 'F';
}
};
// Student Class
class Student {
public:
string name;
string regNumber;
string department;
vector<Subject> subjects;
// Constructor
Student(string studentName, string regNum, string dept)
: name(studentName), regNumber(regNum), department(dept) {}
// Add subject to student's subject list
void addSubject(Subject subject) {
subjects.push_back(subject);
}
};
// ReportCard Class
class ReportCard {
public:
Student student;
// Constructor
ReportCard(Student stu) : student(stu) {}
// Calculate CGPA based on grades
float calculateCGPA() {
float totalGradePoints = 0;
int totalSubjects = student.subjects.size();
for (Subject& subject : student.subjects) {
// Calculate grade for each subject
subject.calculateGrade();
// Convert grade to grade points (A=4, B=3, C=2, D=1, F=0)
switch (subject.grade) {
case 'A':
totalGradePoints += 4;
break;
case 'B':
totalGradePoints += 3;
break;
case 'C':
totalGradePoints += 2;
break;
case 'D':
totalGradePoints += 1;
break;
default:
break;
}
}
// Calculate CGPA as average of grade points
return totalGradePoints / totalSubjects;
}
// Display mark sheet
void displayMarkSheet() {
cout << " VIT BHOPAL UNIVERSITY\n\n";
cout << "School: SCSE \n\n";
cout << " Mark Sheet\n";
cout << "________________________________________________________\n";
cout << "Student Name: " << student.name << "\n";
cout << "Reg Number: " << student.regNumber << "\n";
cout << "Department: " << student.department << "\n";
cout << "----------------------------------\n";
cout << "\nSubjects:\n";
cout << left << setw(20) << "Subject"
<< setw(10) << "CA Marks"
<< setw(10) << "TEE Marks"
<< setw(15) << "Total Marks"
<< "Grade\n";
cout << "________________________________________________________\n";
for (Subject& subject : student.subjects) {
// Calculate total marks
int total = subject.totalMarks();
cout << left << setw(20) << subject.name
<< setw(10) << subject.ca_marks
<< setw(10) << subject.tee_marks
<< setw(15) << total
<< subject.grade << "\n";
cout << "________________________________________________________\n";
}
// Calculate CGPA
float cgpa = calculateCGPA();
cout << fixed << setprecision(2); // Display CGPA with 2 decimal places
cout << "\nCGPA: " << cgpa << "\n";
cout << "_________________________________________________________\n";
}
};
// Main function
int main() {
// Create a student
Student student("Mannan Ali Shaikh", "22BCE10559", "Computer Science");
// Add subjects and marks
student.addSubject(Subject("Discrete(MAT2003)", 35, 40));
student.addSubject(Subject("Physics(PA1001)", 30, 38));
student.addSubject(Subject("Chemistry(CH1002)", 28, 37));
student.addSubject(Subject("Biology(BT3314)", 32, 35));
student.addSubject(Subject("English(PA1003)", 33, 30));
// Create report card for the student
ReportCard reportCard(student);
// Display mark sheet
reportCard.displayMarkSheet();
return 0;
}