-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathstudentdatabase.c
523 lines (417 loc) · 13.6 KB
/
studentdatabase.c
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
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <ctype.h>
const int MAX_COURSES = 4;
struct student
{
char firstname[20], lastname[20];
int id;
int courseList[4];
// running count of courses taken
int coursesTaken;
};
struct course
{
int courseNum;
char *name;
int creditHours;
};
struct student studentDatabase[10];
int databaseSize = 0;
void addStudent(int id, struct course courses[]);
void addDropCourse(int id, struct course courses[]);
char* upper(char str[]);
void studentSearch(int id, struct course courses[]);
void printInvoice(int id, struct course courses[]);
int main()
{
int id, selection, i = 0;
int courseNums[8] = {4587, 4599, 8997, 9696, 1232, 9856, 8520, 8977};
char courseNames[][10] = {"MAT 236",
"COP 220",
"GOL 124",
"COP 100",
"MAC 531",
"STA 100",
"TNV 400",
"CMP 100"};
int courseCrdHrs[8] = {4, 3, 1, 3, 5, 2, 5, 1};
struct course courseOptions[8];
for (i = 0; i < 8; i++)
{
courseOptions[i].courseNum = courseNums[i];
courseOptions[i].name = courseNames[i];
courseOptions[i].creditHours = courseCrdHrs[i];
}
printf ("Welcome!\n");
printf ("Choose from the following options:\n");
printf ("\t1- Add a new student\n");
printf ("\t2- Add/Delete a course\n");
printf ("\t3- Search for a student\n");
printf ("\t4- Print fee invoice\n");
printf ("\t0- Exit program\n");
printf ("\nEnter your selection: ");
scanf ("%d", &selection);
while (selection != 0)
{
printf ("\nEnter the student's id: ");
scanf ("%d", &id);
switch (selection)
{
case 0:
printf("\nGoodbye!\n");
break;
case 1:
{
// check to see if a student is already in the database before adding
int s;
int exists = 0;
for (s = 0; s < databaseSize; s++)
{
if (id == studentDatabase[s].id)
{
printf ("Student with that ID already exists. Please try again.");
exists = 1;
break;
}
}
// if a student with that ID already exists, break out of the case
if (exists)
{
break;
}
// otherwise, add the student to the database
addStudent(id, courseOptions);
break;
}
case 2:
{
addDropCourse(id, courseOptions);
break;
}
case 3:
{
studentSearch(id, courseOptions);
break;
}
case 4:
{
printInvoice(id, courseOptions);
break;
}
}
printf ("\n\nChoose from the following options:\n");
printf ("\t1- Add a new student\n");
printf ("\t2- Add/Delete a course\n");
printf ("\t3- Search for a student\n");
printf ("\t4- Print fee invoice\n");
printf ("\t0- Exit program\n");
printf("\nEnter your selection: ");
scanf("%d", &selection);
}
return 0;
}
char* upper(char str[])
{
int i;
for (i = 0; str[i] != '\0'; i++)
{
str[i] = toupper(str[i]);
}
return str;
}
void addStudent(int id, struct course courses[])
{
char firstname[20], lastname[20];
int courseOptionSize = 8;
int numCourses;
printf ("Enter the student's name: ");
scanf ("%s %s", firstname, lastname);
struct student currStudent;
currStudent.id = id;
strcpy(currStudent.firstname, firstname);
strcpy(currStudent.lastname, lastname);
// display valid course options
printf ("\n\nCurrently offered courses: \n");
printf ("\tCRN\tCR_PREFIX\tCR_HOURS\n");
int c;
for (c = 0; c < courseOptionSize; c++)
{
printf ("\t%d\t%s\t\t%d\n", courses[c].courseNum, courses[c].name, courses[c].creditHours);
}
printf ("\n\nEnter the number of courses [%s %s] is taking (up to 4 courses):\n", upper(firstname), upper(lastname));
scanf ("%d", &numCourses);
while (numCourses > 4 || numCourses < 0)
{
printf("Please enter a valid number of courses (min. 0, max. 4).\n");
printf ("\nEnter the number of courses [%s %s] is taking (up to 4 courses):\n", upper(firstname), upper(lastname));
scanf ("%d", &numCourses);
}
if (numCourses)
printf("\n\nEnter the %d course numbers:\n", numCourses);
int i;
int coursesTaking[numCourses];
switch(numCourses)
{
case 1:
scanf ("%d", &coursesTaking[0]);
break;
case 2:
scanf ("%d %d", &coursesTaking[0], &coursesTaking[1]);
break;
case 3:
scanf ("%d %d %d", &coursesTaking[0], &coursesTaking[1], &coursesTaking[2]);
break;
case 4:
scanf ("%d %d %d %d", &coursesTaking[0], &coursesTaking[1], &coursesTaking[2], &coursesTaking[3]);
break;
}
int j;
int invalid = 0;
for (i = 0; i < numCourses; i++)
{
int found = 0;
for (j = 0; j < courseOptionSize; j++)
{
if (coursesTaking[i] == courses[j].courseNum)
{
found = 1;
break;
}
}
if (found)
{
continue;
}
else
{
printf("One or more course numbers invalid.\n");
invalid = 1;
}
}
while (invalid)
{
printf("\n\nEnter the %d course numbers:\n", numCourses);
switch(numCourses)
{
case 1:
scanf ("%d", &coursesTaking[0]);
break;
case 2:
scanf ("%d %d", &coursesTaking[0], &coursesTaking[1]);
break;
case 3:
scanf ("%d %d %d", &coursesTaking[0], &coursesTaking[1], &coursesTaking[2]);
break;
case 4:
scanf ("%d %d %d %d", &coursesTaking[0], &coursesTaking[1], &coursesTaking[2], &coursesTaking[3]);
break;
}
for (i = 0; i < numCourses; i++)
{
int found = 0;
for (j = 0; j < courseOptionSize; j++)
{
if (coursesTaking[i] == courses[j].courseNum)
{
found = 1;
break;
}
}
if (found)
{
invalid = 0;
continue;
}
else
{
printf("One or more course numbers invalid.\n");
invalid = 1;
break;
}
}
}
// create student and add student to database
currStudent.coursesTaken = numCourses;
for (i = 0; i < numCourses; i++)
{
currStudent.courseList[i] = coursesTaking[i];
}
studentDatabase[databaseSize] = currStudent;
databaseSize++;
printf("Student added successfully!\n\n");
}
struct course findCourse(int crn, struct course courses[])
{
int i;
for (i = 0; i < 8; i++)
{
if (crn == courses[i].courseNum)
{
return courses[i];
}
}
}
int checkEnrollment(int crn, int courses[], int numCourses)
{
int i;
for (i = 0; i < numCourses; i++)
{
if (crn == courses[i])
{
return 1;
}
}
return 0;
}
void addDropCourse(int id, struct course courses[])
{
// find student
int studentIndex;
for (studentIndex = 0; studentIndex < databaseSize; studentIndex++)
{
if (id == studentDatabase[studentIndex].id)
{
break;
}
}
struct student currStudent = studentDatabase[studentIndex];
// print courses being taken
printf("Here are the courses [%s %s] is taking:\n", upper(currStudent.firstname), upper(currStudent.lastname));
printf("\tCRN\tPREFIX\t\tCR. HOURS\n");
int i;
for (i = 0; i < currStudent.coursesTaken; i++)
{
int crn = currStudent.courseList[i];
struct course currCourse = findCourse(crn, courses);
printf("\t%d\t%s\t\t%d\n", crn, currCourse.name, currCourse.creditHours);
}
printf("Choose from:\n");
printf("A- Add a new course for [%s %s]\n", upper(currStudent.firstname), upper(currStudent.lastname));
printf("D- Delete a course from [%s %s]'s schedule\n", upper(currStudent.firstname), upper(currStudent.lastname));
printf("C- Cancel operation\n");
char choice;
printf("\nEnter your selection: ");
scanf(" %c", &choice);
char s = toupper(choice);
switch(s)
{
case 'A':
if (currStudent.coursesTaken == 4)
{
printf("Unable to add courses at this time: Student is currently enrolled in maximum number of courses. Rerouting to menu...\n\n");
break;
}
int newCourseId;
printf("Enter course number to add: \n");
scanf("%d", &newCourseId);
if (!checkEnrollment(newCourseId, currStudent.courseList, currStudent.coursesTaken))
{
currStudent.courseList[currStudent.coursesTaken] = newCourseId;
currStudent.coursesTaken++;
printf("\nCourse successfully added!\n\n");
}
else
{
printf("\nYou are already enrolled in this course. Please try adding a different course.\n");
}
studentDatabase[studentIndex] = currStudent;
break;
case 'D':
if (currStudent.coursesTaken == 0)
{
printf("\nUnable to delete courses at this time: Student is currently not enrolled in any courses. Rerouting to menu...\n\n");
break;
}
int deleteCourseId;
printf("Enter course number to delete: \n");
scanf("%d", &deleteCourseId);
if (checkEnrollment(deleteCourseId, currStudent.courseList, currStudent.coursesTaken))
{
int updatedCourseList[4];
int newCourseCount = 0;
int deleted = 0;
for (i = 0; i < 3; i++)
{
if (currStudent.courseList[i] == deleteCourseId)
{
currStudent.courseList[i] = currStudent.courseList[i + 1];
deleted = 1;
currStudent.coursesTaken--;
}
else if (deleted)
{
currStudent.courseList[i] = currStudent.courseList[i + 1];
}
}
if (!deleted)
{
currStudent.coursesTaken--;
}
printf("\nCourse successfully deleted!\n\n");
}
else
{
printf("\nStudent is not enrolled in the course that is being deleted. Rerouting to main menu...\n\n");
break;
}
studentDatabase[studentIndex] = currStudent;
break;
}
}
void studentSearch(int id, struct course courses[])
{
int i;
for (i = 0; i < databaseSize; i++)
{
if (id == studentDatabase[i].id)
{
printf("FIRST NAME: %s\n", studentDatabase[i].firstname);
printf("LAST NAME: %s\n", studentDatabase[i].lastname);
printf("STUDENT ID: %d\n", studentDatabase[i].id);
printf("\nCURRENTLY ENROLLED COURSES:\n");
printf("\tCRN\tPREFIX\t\tCREDIT HOURS\n");
int j;
for (j = 0; j < studentDatabase[i].coursesTaken; j++)
{
struct course currCourse = findCourse(studentDatabase[i].courseList[j], courses);
printf("\t%d\t%s\t\t%d\n", currCourse.courseNum, currCourse.name, currCourse.creditHours);
}
return;
}
}
printf("No student with ID %d found!\n\n", id);
}
void printInvoice(int id, struct course courses[])
{
struct student currStudent;
int i;
for (i = 0; i < databaseSize; i++)
{
if (id == studentDatabase[i].id)
{
currStudent = studentDatabase[i];
break;
}
}
printf("\t\tVALENCE COMMUNITY COLLEGE\n");
printf("\t\tORLANDO FL 10101\n");
printf("\t\t---------------------\n\n");
printf("\t\tFee Invoice Prepared for Student:\n");
printf("\t\t%d-%s %s\n\n", currStudent.id, upper(currStudent.firstname), upper(currStudent.lastname));
printf("\t\t1 Credit Hour = $120.25\n\n");
printf("\t\tCRN\tCR_PREFIX\tCR_HOURS\n");
float total = 0.0;
for (i = 0; i < currStudent.coursesTaken; i++)
{
struct course currCourse = findCourse(currStudent.courseList[i], courses);
float price = currCourse.creditHours * 120.25;
total += price;
printf("\t\t%d\t%s\t\t %d $ %0.2f\n", currCourse.courseNum, currCourse.name, currCourse.creditHours, price);
}
printf("\n\t\t\tHealth & ID fees\t $ 35.00\n");
printf("\n\t\t------------------------------------------\n");
printf("\t\t\tTotal Payments\t\t $ %0.2f\n", total + 35.0);
printf("\n\n\n--------------------\n");
}