-
Notifications
You must be signed in to change notification settings - Fork 0
/
Klass.java
945 lines (833 loc) · 25.7 KB
/
Klass.java
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
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
package ws.thurn.dossier;
/**
* The Klass class stores information on a single class in the program, and
* contains the methods for most of the basic information interactions that must
* take place during the operation of the program.
*
* @author Derek Thurn
*/
public class Klass
{
private String className = "";
// The name of the class.
private String teacherName = "";
// The name of the teacher.
private String schoolName = "";
// The name of the school.
private LinkedList students = new LinkedList();
// A list containing the students in the class.
private LinkedList assignments = new LinkedList();
// A list containing the assignments in the class.
private LinkedList categories = new LinkedList();
// A list containing the categories in the class.
private LinkedList weights = new LinkedList();
// A list containing the weights of assignments in the class.
private LinkedList totalMarks = new LinkedList();
// A list containing the total mark values of assignments in the class.
private Object[][] data = new Object[ GradeBook.PROGRAM_LIMIT ][ GradeBook.PROGRAM_LIMIT ];
// The 2D Object array which is used to store grade data for the Grades
// screen.
/**
* Creates a new blank class.
*/
public Klass()
{
className = "";
}
/**
* Creates a class.
*
* @param n The name of the class.
*/
public Klass( String n )
{
className = n;
}
/**
* Creates a new class.
*
* @param n The name of the class.
* @param tn The name of the teacher.
* @param sn The name of the school.
*/
public Klass( String n, String tn, String sn )
{
className = n;
teacherName = tn;
schoolName = sn;
}
/**
* Returns the teacher's name.
*
* @return Returns the teacherName.
*/
public String getTeacherName()
{
return teacherName;
}
/**
* Returns the school's name.
*
* @return Returns the schoolName.
*/
public String getSchoolName()
{
return schoolName;
}
/**
* Returns the name of the classes.
*
* @return Returns the className.
*/
public String getClassName()
{
return className;
}
/**
* Returns the Linked List containing the students.
*
* @return Returns the students.
*/
public LinkedList getStudents()
{
return students;
}
/**
* Returns the Linked List containing the assignments.
*
* @return Returns the assignments.
*/
public LinkedList getAssignments()
{
return assignments;
}
/**
* Returns the Linked List containing weight values.
*
* @return Returns the weights.
*/
public LinkedList getWeights()
{
return weights;
}
/**
* Returns the Linked List containing the Total Marks values.
*
* @return
*/
public LinkedList getTotalMarks()
{
return totalMarks;
}
/**
* Returns the Linked List containing the program's categories.
*
* @return Returns the categories.
*/
public LinkedList getCategories()
{
return categories;
}
/**
* Given a student's name, return his student object.
*
* @pre the student exists
* @post the correct object is returned
* @param s The student's name
* @return the student object.
*/
public Student getStudentFromString( String s )
{
Object temp = students.find( s );
return (Student) temp;
}
/**
* Given an assignment's name, return it's assignment object.
*
* @pre the assignment exists
* @post the correct object is returned
* @param s The assignments's name
* @return the assignment object.
*/
public Assignment getAssignmentFromString( String s )
{
Object temp = assignments.find( s );
return (Assignment) temp;
}
/**
* Given a category name, return it's category object.
*
* @pre the category exists
* @post the correct object is returned
* @param s The category's name
* @return the category object.
*/
public Category getCategoryFromString( String s )
{
Object temp = categories.find( s );
return (Category) temp;
}
/**
* Locate a student object based on a replica of it.
*
* @param std the student to locate the object of.
* @pre the student is already in the program
* @post the correct object is returned.
* @return the object of the specified student.
*/
public Student findStudent( Student std )
{
return (Student) ( students.find( std ) );
}
/**
* Locate an assignment object based on a replica of it.
*
* @param as the assignment to locate the object of.
* @pre the assignment is already in the program
* @post the correct object is returned.
* @return the object of the specified assignment.
*/
public Assignment findAssignment( Assignment as )
{
return (Assignment) ( assignments.find( as ) );
}
/**
* Locate a category object based on a replica of it.
*
* @param c the category to locate the object of.
* @pre the category is already in the program
* @post the correct object is returned.
* @return the object of the specified category.
*/
public Category findCategory( Category c )
{
return (Category) ( categories.find( c ) );
}
/**
* Set the teacher name.
*
* @param teacherName The teacherName to set.
*/
public void setTeacherName( String tn )
{
teacherName = tn;
}
/**
* Check if a specified student is already in the program
*
* @pre a students linked list has been created
* @post the correct response is returned
* @param d the student to check if it is duplicate.
* @return true if it is duplicate, false otherwise.
*/
public boolean isDuplicateStudent( Student d )
{
String dupe = d.toString();
ListIterator ite = students.listIterator();
while( ite.hasNext() )
{
String c = ite.next().toString();
if( c.equals( dupe ) )
return true;
}
return false;
}
/**
* Check if a specified assignment is already in the program
*
* @pre an assignments linked list has been created
* @post the correct response is returned
* @param a the assignment to check if it is duplicate.
* @return true if it is duplicate, false otherwise.
*/
public boolean isDuplicateAssignment( Assignment a )
{
String dupe = a.toString();
ListIterator ite = assignments.listIterator();
while( ite.hasNext() )
{
String c = ite.next().toString();
if( c.equals( dupe ) )
return true;
}
return false;
}
/**
* Check if a specified category is already in the program
*
* @pre a categories linked list has been created
* @post the correct response is returned
* @param c the category to check if it is duplicate.
* @return true if it is duplicate, false otherwise.
*/
public boolean isDuplicateCategory( Category c )
{
String dupe = c.toString();
ListIterator ite = categories.listIterator();
while( ite.hasNext() )
{
String d = ite.next().toString();
if( d.equals( dupe ) )
return true;
}
return false;
}
/**
* Return a string array containing the students in the class.
*
* @pre a linked list of students exists
* @post a correct one dimensional string array is returned.
* @return a string array of students.
*/
public String[] getStudentsStringArray()
{
String arr[] = new String[ students.getLength() ];
ListIterator lite = students.listIterator();
int i = 0;
while( lite.hasNext() )
{
arr[ i ] = lite.next().toString();
i++;
}
return arr;
}
/**
* Return a string array containing the assignments in the class.
*
* @pre a linked list of assignments exists
* @post a correct one dimensional string array is returned.
* @return a string array of assignments.
*/
public String[] getAssignmentsStringArray()
{
String arr[] = new String[ assignments.getLength() ];
ListIterator lite = assignments.listIterator();
int i = 0;
while( lite.hasNext() )
{
arr[ i ] = lite.next().toString();
i++;
}
return arr;
}
/**
* Return a string array containing the categories in the class.
*
* @pre a linked list of categories exists
* @post a correct one dimensional string array is returned.
* @return a string array of categories.
*/
public String[] getCategoriesStringArray()
{
String arr[] = new String[ categories.getLength() ];
ListIterator lite = categories.listIterator();
int i = 0;
while( lite.hasNext() )
{
arr[ i ] = lite.next().toString();
i++;
}
return arr;
}
/**
* Sets the school name.
*
* @param schoolName The schoolName to set.
*/
public void setSchoolName( String sn )
{
schoolName = sn;
}
/**
* Sets the name of the class.
*
* @param className The className to set.
*/
public void setClassName( String cn )
{
className = cn;
}
/**
* Adds a student to the class.
*
* @param s the student to add.
* @pre there is room for the student
* @post the student has been added to the class.
*/
public void addStudent( Student s )
{
if( getNumStudents() + 1 >= GradeBook.PROGRAM_LIMIT )
{
GradeBook
.error( "The maximum number of students has been reached." );
return;
}
students.addLast( s );
int location = 0;
ListIterator ite = students.listIterator();
int i = 0;
while( ite.hasNext() )
{
String a = s.toString();
String b = ite.next().toString();
if( a.equals( b ) )
location = i;
i++;
}
if( location < 0 )
{
GradeBook.error( "Error adding student." );
return;
}
insertGradeRowFromZeroAt( location );
}
/**
* Adds a category to the class.
*
* @param c the category
* @pre there is room for the category
* @post the category has been added to the class.
*/
public void addCategory( Category c )
{
categories.addLast( c );
}
/**
* Adds an assignment to the class.
*
* @param a the assignment to add.
* @pre there is room for the assignment
* @post the assignment has been added to the class.
*/
public void addAssignment( Assignment a )
{
if( getNumAssignments() + 1 >= GradeBook.PROGRAM_LIMIT )
{
GradeBook
.error( "The maximum number of assignments has been reached." );
return;
}
if( !( a.getCategory().equals( "Assignment Has No Category X" ) ) )
{
if( a.getCategory().getWeight() != a.getWeight() )
a.setWeight( a.getCategory().getWeight() );
}
assignments.addLast( a );
weights.addLast( a.getWeight() );
totalMarks.addLast( a.getTotalMarks() );
}
/**
* Adds a weight value to the class's list of weights
*
* @param i the weight to add
* @pre the weights list exists
* @post the weight has been added.
*/
public void addWeight( int i )
{
weights.addLast( i );
}
/**
* Returns the number of students in the class.
*
* @pre the students linked list exists
* @post the correct number is returned
* @return the number of students in the class.
*/
public int getNumStudents()
{
return students.getLength();
}
/**
* Returns the number of categories in the class.
*
* @pre the categories linked list exists
* @post the correct number is returned
* @return the number of categories in the class.
*/
public int getNumCategories()
{
return categories.getLength();
}
/**
* Returns the number of weights in the weights list.
*
* @pre the weights linked list exists
* @post the correct number is returned
* @return the number of weights that are stored.
*/
public int getNumWeights()
{
return weights.getLength();
}
/**
* Returns the number of total marks values in the total marks list.
*
* @pre the total marks linked list exists
* @post the correct number is returned
* @return the number of total marks values. that are stored.
*/
public int getNumTotalMarks()
{
return totalMarks.getLength();
}
/**
* Returns the number of assignments in the class.
*
* @pre the assignments linked list exists
* @post the correct number is returned
* @return the number of assignments in the class.
*/
public int getNumAssignments()
{
return assignments.getLength();
}
/**
* Deletes a student based on the student name
*
* @pre the student is already in the program
* @post the student has been deleted
* @param s the student to delete.
*/
public void deleteStudent( String s )
{
ListIterator lite = students.listIterator();
while( lite.hasNext() )
{
if( lite.next().equals( s ) )
{
lite.remove();
}
}
}
/**
* Deletes an assignment based on the assignment name
*
* @pre the assignment is already in the program
* @post the assignment has been deleted
* @param as the assignment to delete.
*/
public void deleteAssignment( Assignment as )
{
ListIterator ite = assignments.listIterator();
ListIterator wite = weights.listIterator();
ListIterator mite = totalMarks.listIterator();
String b = as.toString();
boolean removed = false;
while( ite.hasNext() )
{
String a = ite.next().toString();
wite.next();
mite.next();
if( a.equals( b ) )
{
ite.remove();
wite.remove();
mite.remove();
removed = true;
}
}
if( removed = false )
GradeBook.error( "Error removing assignment" );
}
/**
* Deletes a category based on the category name
*
* @pre the category is already in the program
* @post the category has been deleted
* @param s the category to delete.
*/
public void deleteCategory( String s )
{
ListIterator lite = categories.listIterator();
while( lite.hasNext() )
{
if( lite.next().equals( s ) )
{
lite.remove();
}
}
}
/**
* Returns the entire two dimensional object grade array
*
* @pre the data array exists
* @post the data array has been returned
* @return the data array.
*/
public Object[][] getGradeData()
{
return data;
}
public int getGradeValue( int r, int c )
{
return Integer.parseInt( data[ r ][ c ].toString() );
}
/**
* Sets up the grade data with students in the rightmost column
*
* @pre the data object has been declared
* @post the students have been listed in the right column
*/
public void initGradeData()
{
int numStudents = students.getLength();
for( int i = 0; i < numStudents; i++ )
{
data[ i ][ 0 ] = students.findFromLocation( i ).toString();
}
}
/**
* Sets a specific grade to a specific location.
*
* @param row the row number of the cell being set to
* @param col the column number of the cell being set to
* @param grade the Object containing the grade integer
* @pre the data array exists
* @post the grade has been added at the correct location.
*/
public void setGradeData( int row, int col, Object grade )
{
if( (Integer) grade == null || grade.toString().equals( "" ) )
{
data[ row ][ col ] = 0;
}
data[ row ][ col ] = Integer.parseInt( grade.toString() );
}
/**
* An algorithm to calculate a student's percentage on an assignment
*
* @param stud the student whose percentage is being found
* @param assign the assignment whose percentage is being found
* @pre the correct grade, student, and assignments all exist
* @post the student's grade is returned
* @return the student's percentage grade.
*/
public double getPercentage( Student stud, Assignment assign )
{
int sLocation = findStudentLocation( stud.toString() );
int aLocation = -1;
ListIterator ite = assignments.listIterator();
int i = 0;
while( ite.hasNext() )
{
String a = assign.toString();
String b = ite.next().toString();
if( a.equals( b ) )
aLocation = i;
i++;
}
if( aLocation < 0 )
GradeBook.error( "Error getting percentage assignment" );
int possibleGrade = (Integer) totalMarks.findFromLocation( aLocation );
aLocation = aLocation + 1;
int currentGrade;
if( data[ sLocation ][ aLocation ] == null )
{
currentGrade = 0;
}
else
currentGrade = Integer.parseInt( data[ sLocation ][ aLocation ]
.toString() );
return ( (double) currentGrade / (double) possibleGrade ) * 100.0;
}
/**
* Given a student's name, find its sequential locaiton in the linked list
*
* @pre the students list has been created, the student exists
* @post the correct student location is found
* @param studentName the name of the student to find
* @return the location of the student.
*/
public int findStudentLocation( String studentName )
{
int location = -1;
for( int i = 0; i < GradeBook.PROGRAM_LIMIT; i++ )
{
if( data[ i ][ 0 ] == null )
{
}
else
{
if( ( data[ i ][ 0 ].toString() ).equals( studentName ) )
{
location = i;
break;
}
}
}
if( location == -1 )
GradeBook.error( "Student not found" );
return location;
}
/**
* An algorithm to calculate a student's average
*
* @pre grades have been correctly entered for each assignments
* @post the correct average is returned,
* @param studentName the name of the student to get an average for
* @return the student's average.
*/
public double getAverage( String studentName )
{
int location = findStudentLocation( studentName );
// collect average
int numAssignments = assignments.getLength();
int currentGrade;
int totalWeight = weights.sumIntegers();
int currentWeight;
int possibleMarks;
double percentage;
double weightPercentage;
double average = 0;
for( int n = 1; n <= numAssignments; n++ )
{
if( data[ location ][ n ] == null )
{
currentGrade = 0;
}
else
{
currentGrade = Integer.parseInt( data[ location ][ n ]
.toString() );
}
possibleMarks = (Integer) totalMarks.findFromLocation( n - 1 );
percentage = (double) currentGrade / (double) possibleMarks;
currentWeight = (Integer) weights.findFromLocation( n - 1 );
weightPercentage = (double) currentWeight / (double) totalWeight;
percentage = percentage * weightPercentage;
average = average + percentage;
}
return ( average * 100 );
}
/**
* An algorithm to calculate a student's average in a category.
*
* @pre grades have been entered for each assignment in the category.
* @post the correct categorical avarage is found
* @param studentName the name of the student to get a category average for
* @param categoryName the name of the category which the average is being
* found for
* @return the categorical average.
*/
public double getStudentCategoryAverage( String studentName,
String categoryName )
{
Category theCategory = (Category) categories.find( categoryName );
Student theStudent = (Student) students.find( studentName );
LinkedList assignments = theCategory.getAssignments();
ListIterator lite = assignments.listIterator();
double average = 0.0;
while( lite.hasNext() )
{
Assignment a = (Assignment) lite.next();
average = average + getPercentage( theStudent, a );
}
return average / (double) assignments.getLength();
}
/**
* An algorithm to calculate the class's average on an assignment.
*
* @pre all of the students have correct grade data for the assignment.
* @post the correct class assignment average is found.
* @param assignmentName the name of the assignment to find the average for.
* @return the average of the class on the assignment.
*/
public double getClassAssignmentAverage( String assignmentName )
{
Assignment theAssignment = (Assignment) assignments
.find( assignmentName );
Student theStudent;
ListIterator lite = students.listIterator();
double average = 0.0;
while( lite.hasNext() )
{
theStudent = (Student) lite.next();
average = average + getPercentage( theStudent, theAssignment );
}
return average / (double) students.getLength();
}
/**
* An algorithm to find the class average.
*
* @pre the grade data has been entered for everyone in the class
* @post the correct class average is returned
* @return the average of the individual averages.
*/
public double getClassAverage()
{
ListIterator iterator = students.listIterator();
double classAverage = 0.0;
while( iterator.hasNext() )
{
classAverage = classAverage
+ getAverage( iterator.next().toString() );
}
classAverage = classAverage / (double) ( students.getLength() );
return classAverage;
}
/**
* Inserts a new row into the data object.
*
* @pre the data array has been declared.
* @post a new blank row exists at the specified location.
* @param location the location of the new row (counting from zero)
*/
public void insertGradeRowFromZeroAt( int location )
{
for( int i = students.getLength() + 1; i > location; i-- )
{
for( int g = 0; g <= ( assignments.getLength() + 1 ); g++ )
{
data[ i + 1 ][ g ] = data[ i ][ g ];
}
}
for( int k = 0; k <= assignments.getLength() + 1; k++ )
{
data[ location ][ k ] = null;
}
}
/**
* Checks to see if the class is ready for a report to be created.
*
* @pre none
* @post the readiness is reported correctly.
* @return true if the class is ready for a report, false otherwise.
*/
public boolean classReportReady()
{
if( students.getLength() < 1 )
return false;
if( assignments.getLength() < 1 )
return false;
if( data[ 0 ][ 1 ] == null )
return false;
return true;
}
/**
* Checks to see if the class is ready for grade information
*
* @pre none
* @post returns the readiness correctly.
* @return true if the class is ready for grade data, false otherwise.
*/
public boolean classGradeReady()
{
if( students.getLength() < 1 )
return false;
if( assignments.getLength() < 1 )
return false;
return true;
}
/**
* Returns the name of the class
*
* @pre the name has been specified
* @post the name has been returned.
* @return the class name as a string.
*/
public String toString()
{
return className;
}
}