-
Notifications
You must be signed in to change notification settings - Fork 0
/
seed_reader.py
892 lines (638 loc) · 30.1 KB
/
seed_reader.py
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
from rich.console import Console
from rich.table import Table
import os
os.system("cls")
class Course:
def __init__(self, name, class_size, is_outside_timetable, sequencing, number_of_classes_per_year, is_linear, description):
self._name = name
self.number_of_classes_per_year = number_of_classes_per_year
self._class_size = class_size
self.is_linear = is_linear
self._is_outside_timetable = is_outside_timetable
self.sequencing = sequencing
self._sections = {}
self._currentClasses = 0
self._description = description # includes courses blocked with it
self._temp_description = description # holds the unique description
self._sim_blocking = [] # simultaneous blocking rules
self._terms_blocking = []
def __str__(self):
return str(self._name) + ": " + str(len(self._sections)) + str(int(self.number_of_classes_per_year))
def __repr__(self):
return self.__str__()
class Class(Course):
def __init__(self, name, class_size, is_outside_timetable, sequencing, blocking, semester):
super().__init__(self, name, class_size, is_outside_timetable, sequencing, blocking)
self.semester = semester
self.students = []
def __str__(self):
return str(self._name) + " in Semester " + self.semester + " Block " + self.block + "\n"
def __repr__(self):
return self.__str__()
class Student:
def __init__(self, id, course_requests, alternates):
self._id = id
self._course_requests = course_requests
self._alternates = alternates
self.student_classes = {}
self._cr = course_requests
def __str__ (self):
return str("\n\nid = " + str(self._id) + " \nRequests = " + str(self._course_requests) + " \nAlternates = " + str(self._alternates) + "\nCourses: " + str(self.student_classes))
def __repr__(self):
return self.__str__()
class Timetable:
def __init__(self):
self.block_1A = []
self.block_1B = []
self.block_1C = []
self.block_1D = []
self.block_2A = []
self.block_2B = []
self.block_2C = []
self.block_2D = []
def __str__(self):
# makes a nice styled table
table = Table(title="TimeTable")
rows = [self.block_1A, self.block_1B, self.block_1C, self.block_1D, self.block_2A, self.block_2B, self.block_2C, self.block_2D]
columns = ["S1 Block A", "S1 Block B", "S1 Block C", "S1 Block D","S2 Block A", "S2 Block B", "S2 Block C", "S2 Block D"]
for column in columns:
table.add_column(column)
for row in rows:
table.add_row(*row, style='bright_green')
console = Console()
console.print(table)
return ""
def add_class(self, class_slot, semester, block):
if semester == 1:
if block == "A":
self.block_1A.append(class_slot)
if block == "B":
self.block_1B.append(class_slot)
if block == "C":
self.block_1C.append(class_slot)
if block == "D":
self.block_1D.append(class_slot)
else:
if block == "A":
self.block_2A.append(class_slot)
if block == "B":
self.block_2B.append(class_slot)
if block == "C":
self.block_2C.append(class_slot)
if block == "D":
self.block_2D.append(class_slot)
tt = Timetable()
def get_word_before_after(string, target_word):
string_without_commas = string.replace(",", "") # remove all commas
words = string_without_commas.split() # Split the string into a list of words
word_after = ""
# if the word "before" exists in this line
try:
index = words.index(target_word) # Get the index of the target word
except :
return None, None
# Retrieve the word before the target word (if available)
if index > 0:
word_before = words[index - 1]
else:
word_before = None
# get all the words after index
if index > 0:
while index < len(words) - 1:
index += 1
word_after += words[index]
return word_before, word_after
counter = 0 # the counter for the while loop
target = "before" # the target word for the while loop\
array = [] # the array of the order of things
f = open("Data for Project\\Course Sequencing Rules.csv", "r")
data = f.read().splitlines()
while counter < len(data):
my_string = data[counter]
counter += 1
before, after = get_word_before_after(my_string, target)
if before != None and after != None:
after = after.replace('"', "") # deletes all "s
array.append(before + after)
def split_string(string, chunk_size):
return [string[i:i+chunk_size] for i in range(0, len(string), chunk_size)]
array_asso = {}
arr = []
for i in range(len(array)):
arr = split_string(array[i], 10)
if array_asso.get(arr[0]) is not None:
counter1 = 1
while counter1 < len(arr):
array_asso[arr[0]].append(arr[counter1])
counter1 += 1
else:
array_asso[arr[0]] = arr[1:]
count = 0
alt = 0
idArr = []
studentArr = [[0 for i in range(838)] for j in range(838)] #temporaty array which contains all student requests
test = [] #array used to store data read from file
studentlist = [[] for j in range(838)] #cleaned student requests are stored here before they are used to make a student object
altlist = [[] for j in range(838)] #temporaty array which contains all alternate requests
alternate = [[0 for i in range(838)] for j in range(838)]#cleaned alternate requests are stored here before they are used to make a student object
courselist = [] #array containing all course objects
student = [] #final list containing studen objects with their courses, altenates and id number
outside_the_timetable = [
'XC---09--L', 'MDNC-09C-L', 'MDNC-09M-L', 'XBA--09J-L', 'XLDCB09S-L', 'YCPA-0AX-L',
'MDNCM10--L', 'YED--0BX-L', 'MMUCC10--L', 'YCPA-0AXE-', 'MMUOR10S-L', 'MDNC-10--L',
'MIDS-0C---', 'MMUJB10--L', 'MDNC-11--L', 'YCPA-1AX-L', 'MDNCM11--L', 'YCPA-1AXE-',
'MGRPR11--L', 'MGMT-12L--', 'YED--1EX-L', 'MWEX-2A--L', 'MCMCC11--L', 'MWEX-2B--L',
'MIMJB11--L', 'MMUOR11S-L', 'MDNC-12--L', 'YCPA-2AX-L', 'MDNCM12--L', 'YCPA-2AXE-',
'MGRPR12--L', 'MGMT-12L--', 'YED--2DX-L', 'YED--2FX-L', 'MCMCC12--L', 'MWEX-2A--L',
'MIMJB12--L', 'MWEX-2B--L', 'MMUOR12S-L', 'MCLC-12---'
] #hardcoded array with all outside the timetable classes
bad_courses = ['XLEAD09---', 'MGE--11', 'MGE--12', 'MKOR-10---',
'MKOR-11---', 'MKOR-12---', 'MIT--12---', 'MSPLG11---',
'MJA--10---', 'MJA--11---', 'MJA--12---',
'MLTST10---', 'MLTST10--L']
# find the course object with a specific course CODE
def get_course(name_of_course):
for c in courselist:
if c._name == name_of_course:
return c
return "not found"
try:
f=open("python.txt","r")
while True:
#reads line of file, stores it into test array, then adds one to count which is the line number
count = count + 1
line=f.readline()
test = line.split(",", 16)
if line=='':
break
#if the first word in test is id then that means it is a new students requests
#so the line number becomes 0 and the amount of alternates also becomes 0
if test[0] == 'ID':
count = 0
alt = 0
#stores the id number of the new student in idArr
for i in range(len(test)):
if test[i] == 'ID':
test[i] = test[i+1]
test[i+1] == ""
idArr.append(test[i])
#sees if this is a course request or not
elif test[0] != 'Course':
#if it is an alternate add it to the alternate list
#otherwise add it to the student request list
if test[11] == 'Y':
count = count - 1
alternate[len(idArr) -1][alt] = test[0]
alt = alt + 1
else:
studentArr[len(idArr) -1][count -1] = test[0]
except FileNotFoundError:
print ("File is not found")
else:
f.close()
try:
fi=open("seed.txt","r")
while True:
#sets linear and out(short for outside the timetable) to false
linear = False
out = False
line=fi.readline()
test = line.split(",", 16)
if line=='':
break
#if the course read in the file is an outside the timetable course set out to true
for i in range(len(outside_the_timetable)):
if outside_the_timetable[i] == test[0]:
out = True
#if the course is a linear course the base term will be set to 1 thus if the base term is 1
#set linear to true
if test[7] == '1':
linear = True
#if the course is part of course sequencing, create a course object with
#the name of the course, the amount of students, if its outside the timetable, course sequencing, amount of times it runs and if its linear
#if not do the same but without course sequencing
if test[0] in array_asso.keys():
courselist.append(Course(test[0],test[9] ,out, array_asso[test[0]],test[14], linear, test[2]))
else:
courselist.append(Course(test[0],test[9] ,out, "",test[14], linear, test[2]))
except FileNotFoundError:
print ("File is not found")
else:
fi.close()
#for loops that take the student requests and alternate requests from the remporary arrays they are stored in
#and creats a list with student objects with their alternate requests, course requests and id number
for i in range(len(idArr) - 1):
for j in range(838):
if studentArr[i][j] != 0 and studentArr[i][j] not in bad_courses:
studentlist[i].append(studentArr[i][j])
if alternate[i][j] != 0:
altlist[i].append(alternate[i][j])
if j == 837:
student.append(Student(idArr[i][0:4],studentlist[i],altlist[i]))
# gets data for blocking rules
def get_data(string):
try:
index = string.index("in")
except:
return None
# remove all commas and split the string into a list of words
words = string[29:][:-13].replace(",", "").split()
# words == None
if not words:
return None
del words[-3:-1]
return words
arrayCBR = []
with open("Data for Project\\Course Blocking Rules.csv", "r") as course_blocking_rules:
data = course_blocking_rules.read().splitlines()
for my_string in data:
blocking_rules = get_data(my_string)
# if blocking_rules is a non-empty string array
if blocking_rules:
# look at simultaneous blocking
if blocking_rules[-1] == "Simultaneous":
collective_description = ""
for blocked_course in blocking_rules:
if not get_course(blocked_course) == "not found":
collective_description += get_course(blocked_course)._temp_description + " / "
for blocked_course in blocking_rules:
if not get_course(blocked_course) == "not found":
get_course(blocked_course)._description = collective_description
if blocking_rules[-1] == "Simultaneous":
get_course(blocked_course)._sim_blocking = blocking_rules
elif blocking_rules[-1] == "Terms":
for blocked_course in blocking_rules:
if not get_course(blocked_course) == "not found":
get_course(blocked_course)._terms_blocking = blocking_rules
arrayCBR.append(blocking_rules)
alpha = ["S1 A", "S1 B", "S1 C", "S1 D", "S2 A", "S2 B", "S2 C", "S2 D", "Outside"] # timtable headers / keys
master = {"S1 A": [], "S1 B": [], "S1 C": [], "S1 D":[], "S2 A": [], "S2 B": [], "S2 C": [], "S2 D":[], "Outside":[]} # master timetable
def get_sequencing(name_of_course):
for c in courselist:
if name_of_course == c._name:
return list(c.sequencing)
return []
def score(set):
total_score = 0
total_requests = 0
for s in set:
total_requests += len(s._course_requests)
# find overlap
for c in s._course_requests:
for block in list(s.student_classes.values()):
if c in block:
if get_course(c).is_linear:
total_score += 1
else:
total_score += 1
return total_score / total_requests
def score_with_alternates(set):
total_score = 0
total_requests = 0
for s in set:
total_requests += len(s._course_requests) + len(s._alternates)
# find overlap
for c in s._course_requests:
for block in list(s.student_classes.values()):
if c in block:
total_score +=1
# find overlap
for c in s._alternates:
for block in list(s.student_classes.values()):
if c in block:
total_score += 1
return total_score / total_requests
def has_eight_courses(stu, missing):
combined_list = []
satisfied = 0
for lst in list(stu.student_classes.values()):
combined_list.extend(lst)
for c in stu._course_requests:
if c in combined_list:
satisfied += 1
return satisfied == len(stu._course_requests) - missing
def students_with_eight_courses(set):
score = 0
for stu in set:
if has_eight_courses(stu, 0):
score += 1
return score / 838
def students_missing_one_course(set):
score = 0
for stu in set:
if has_eight_courses(stu, 1):
score += 1
return score / 838
def two_or_less_missing(set):
score = 0
for stu in set:
if has_eight_courses(stu, 0) or has_eight_courses(stu, 1) or has_eight_courses(stu, 2):
score += 1
return score / 838
def has_eight_courses_including_alternates(stu, missing):
combined_list = []
satisfied = 0
for lst in list(stu.student_classes.values()):
combined_list.extend(lst)
for c in stu._course_requests:
if c in combined_list:
satisfied += 1
for c in stu._alternates:
if c in combined_list:
satisfied += 1
return satisfied == len(stu._course_requests) - missing
def students_with_eight_courses_alt(set):
score = 0
for stu in set:
if has_eight_courses_including_alternates(stu, 0):
score += 1
return score / 838
def students_missing_one_course_alt(set):
score = 0
for stu in set:
if has_eight_courses_including_alternates(stu, 1):
score += 1
return score / 838
def two_or_less_missing_alt(set):
score = 0
for stu in set:
if has_eight_courses_including_alternates(stu, 0) or has_eight_courses_including_alternates(stu, 1) or has_eight_courses_including_alternates(stu, 2):
score += 1
return score / 838
# course sorting
# linear courses inside the time table
for course in courselist:
if course.is_linear:
popped = courselist.pop(courselist.index(course))
courselist.insert(0, popped)
# terms blocked courses come before outside
for course in courselist:
if course._terms_blocking:
popped = courselist.pop(courselist.index(course))
courselist.insert(0, popped)
# otside comes first
for course in courselist:
if course._name in outside_the_timetable:
popped = courselist.pop(courselist.index(course))
courselist.insert(0, popped)
p = ""
thing = []
# returns true if student[i] has a linear course that needs to be paired
def has_a_linear_course(i):
for block in student[i].student_classes:
if len(student[i].student_classes[block]) == 1 and get_course(student[i].student_classes[block][0]).is_linear and student[i].student_classes[block][0] not in outside_the_timetable:
return block
return False
# places student[i] in course somewhere from alpha[start] to alpha[end]
def place(start, end, i, course):
c = 1
if int(student[i]._id) % 2 == 0:
temp = start
start = end
end = temp -2
c = -1
# look through every available block
for k in range(start, end + 1, c):
# if the slot is outside the time table or not yet taken up
if k == 8 or (alpha[k] not in student[i].student_classes and not course.is_linear):
# if the course is offered during this block and the class is not full
if alpha[k] in course._sections and len(course._sections[alpha[k]]) < int(course._class_size):
course._sections[alpha[k]].append(student[i]._id)
for sim_blk in course._sim_blocking:
if not sim_blk == "Simultaneous" and not sim_blk == course._name:
if student[i]._id not in get_course(sim_blk)._sections[alpha[k]]:
get_course(sim_blk)._sections[alpha[k]].append(student[i]._id)
student[i].student_classes[alpha[k]] = [course._name]
return True
# if the course is not yet offered in this block and a new class can be made
elif len(course._sections) < int(course.number_of_classes_per_year) and alpha[k] not in course._sections:
if len(master[alpha[k]]) >= 44:
continue
course._sections[alpha[k]] = [student[i]._id]
for sim_blk in course._sim_blocking:
if not sim_blk == "Simultaneous" and not sim_blk == course._name:
get_course(sim_blk)._sections[alpha[k]] = [student[i]._id]
student[i].student_classes[alpha[k]] = [course._name]
master[alpha[k]].append(course._description)
return True
# if course is linear and inside the time table (second half implied)
elif course.is_linear:
# if student time table already has a linear course
block = has_a_linear_course(i)
if block:
# if the class exists in this block already and has space
if block in course._sections and len(course._sections[block]) < int(course._class_size):
# add the student to the class and the sim blocking
course._sections[block].append(student[i]._id)
for sim_blk in course._sim_blocking:
if not sim_blk == "Simultaneous" and not sim_blk == course._name:
get_course(sim_blk)._sections[block].append(student[i]._id)
# give the student the class combined with the other linear course
student[i].student_classes[block].append(course._name)
student[i].student_classes[alpha[(alpha.index(block) + 4) % 8]].append(course._name)
# if a new course can be made
elif len(course._sections) < int(course.number_of_classes_per_year) and alpha[k] not in course._sections:
if len(master[alpha[k]]) >= 43 and len(master[alpha[(k + 4) % 8]]) >= 43:
continue
# create a new class with the student in it and for sim blocking
course._sections[block] = [student[i]._id]
for sim_blk in course._sim_blocking:
if not sim_blk == "Simultaneous" and not sim_blk == course._name:
get_course(sim_blk)._sections[block] = [student[i]._id]
# give the student this class with the other linear class
student[i].student_classes[block].append(course._name)
student[i].student_classes[alpha[(alpha.index(block) + 4) % 8]].append(course._name)
# add the class to the master time table
master[block].append(course._description)
master[alpha[(alpha.index(block) + 4) % 8]].append(course._description)
# go to next student
return True
# block not taken yet?
elif alpha[k] not in student[i].student_classes and alpha[(k + 4) % 8] not in student[i].student_classes:
# if the class exists in this block already and has space
if alpha[k] in course._sections and len(course._sections[alpha[k]]) < int(course._class_size):
# add student to the course and all its sim blocking
course._sections[alpha[k]].append(student[i]._id)
for sim_blk in course._sim_blocking:
if not sim_blk == "Simultaneous" and not sim_blk == course._name:
get_course(sim_blk)._sections[alpha[k]].append(student[i]._id)
# give the student the course
student[i].student_classes[alpha[k]] = [course._name]
student[i].student_classes[alpha[(k + 4) % 8]] = [course._name]
return True
# if a new course can be made
elif len(course._sections) < int(course.number_of_classes_per_year) and alpha[k] not in course._sections:
if len(master[alpha[k]]) >= 43 and len(master[alpha[(k + 4) % 8]]) >= 43:
continue
# create a new class with the student in it and for sim blocking
course._sections[alpha[k]] = [student[i]._id]
for sim_blk in course._sim_blocking:
if not sim_blk == "Simultaneous" and not sim_blk == course._name:
get_course(sim_blk)._sections[alpha[k]] = [student[i]._id]
# give the student this class
student[i].student_classes[alpha[k]] = [course._name]
student[i].student_classes[alpha[(k + 4) % 8]] = [course._name]
# add the class to the master time table
master[alpha[k]].append(course._description)
master[alpha[(k + 4) % 8]].append(course._description)
return True
return False
def is_prerequisite(c, i):
for seq in c.sequencing:
if seq in student[i]._course_requests:
return True
return False
def has_prerequisite(c, i):
for pre in courselist:
if c._name in pre.sequencing:
for block in student[i].student_classes.values():
if pre._name in block:
return True
return False
'''
Main Algorithm
'''
# look through all courses
for course in courselist:
# look through all students
for i in range(len(student)):
#look through their requests
for j in range (len(student[i]._course_requests)):
if (course._name == student[i]._course_requests[j]):
if course._terms_blocking:
if course._terms_blocking[0] == course._name:
place(0, 3, i, course)
place(4, 7, i, get_course(course._terms_blocking[1]))
break
if course._name in outside_the_timetable:
if place(8, 8, i, course):
break
if is_prerequisite(course, i):
if place(0, 3, i, course):
break
if has_prerequisite(course, i):
if place(4, 7, i, course):
break
if place(0, 7, i, course):
break
break
def copy_terms(course, course_copy):
# add class to the right blocking in the master timetable
for j in range(4):
if alpha[j] in course._sections:
master[alpha[j + 4]] = list(map(lambda x: x.replace(course._description, course_copy._description), master[alpha[j+4]]))
#master[alpha[k]].append(course_copy._description)
# add students to the right blocks
pass
# tems blocking copying
for course in courselist:
if course._terms_blocking:
if course._terms_blocking[1] == course._name:
copy_terms(get_course(course._terms_blocking[1]) , course)
# alternates
# for all students
for i in range(len(student)):
# for their alternates
for alt in student[i]._alternates:
# check if course exists (some students are asking for courses MD doesn't have)
if (get_course(alt) == "not found"):
continue
# for all blocks
for k in range(8):
# is taken?
if alpha[k] not in student[i].student_classes:
# is the course offered during this block already?
if (alpha[k] in get_course(alt)._sections):
# is full?
if(len(get_course(alt)._sections[alpha[k]]) < int(get_course(alt)._class_size)):
# add to student schedule
student[i].student_classes[alpha[k]] = [get_course(alt)._name]
# add to list of students in this class
get_course(alt)._sections[alpha[k]].append(student[i]._id)
# break on success
break
# make a new class?
if(len(get_course(alt)._sections) < int(get_course(alt).number_of_classes_per_year)):
# skip if master has too many courses in this block
if len(master[alpha[k]]) >= 43:
continue
elif get_course(alt).is_linear and len(master[alpha[(k + 4) % 8]]) >= 43:
continue
# make a new class and add the student to that class
arrrrrr = []
arrrrrr.append(student[i]._id)
get_course(alt)._sections[alpha[k]] = arrrrrr
# give the student that class in their schedule
student[i].student_classes[alpha[k]] = [get_course(alt)._name]
# add the course to the master timetable
master[alpha[k]].append(get_course(alt)._description)
# check if linear
if (get_course(alt).is_linear and alpha[(k + 4) % 8] not in student[i].student_classes):
# add to the opposite semester same block in student classes
student[i].student_classes[alpha[(k + 4) % 8]] = [get_course(alt)._name]
# add another slot in master timetable
master[alpha[(k + 4) % 8]].append(get_course(alt)._description)
# update number of classes the course has
get_course(alt)._currentClasses = get_course(alt)._currentClasses + 1
# break on success
break
def show(itemslist):
out = ""
for item in itemslist:
out = out + item + "\n\n"
return out
table = Table(title="TimeTable")
rows = list(master.values())
columns = alpha
for column in columns:
table.add_column(column, no_wrap = False)
entries = []
for row in rows:
entries.append(show(row))
table.add_row(*entries, style='bright_green')
console = Console()
console.print(table)
for b in master:
print(len(master[b]), " ", end="")
print("")
print("percent of courses granted", score(student) // 0.001 / 10, " % ")
print("percent of courses + alts granted", score_with_alternates(student) // 0.001 / 10, " % ")
print("Percent of students with 8/8, 7/8, 6/8. No alt.", two_or_less_missing(student) // 0.001 / 10, " % ")
print("of students with 8/8, 7/8, 6/8. With Alt", two_or_less_missing_alt(student) // 0.001 / 10, " % ")
print("Percent of students with 0-5/8 courses", (1 - two_or_less_missing(student)) // 0.001 / 10, " % ")
def select_student(id):
for key in student[int(id) - 1000].student_classes:
for l in student[id - 1000].student_classes[key]:
print(key, ": ", get_course(l)._temp_description)
print("\n")
for STUDENT_ID in range(1589, 1590, 1):
print("\nStudent ", STUDENT_ID, ":")
#print(student[STUDENT_ID - 1000].student_classes)
print("\n")
select_student(STUDENT_ID)
print("\n")
print(student[STUDENT_ID - 1000])
print("\n")
'''
print(student[STUDENT_ID - 1000]._course_requests)
print("\n")
print(student[STUDENT_ID - 1000]._alternates)
print("\n")
for upo in student[STUDENT_ID - 1000]._course_requests:
print(get_course(upo)._temp_description)
print("\n")
for upo in student[STUDENT_ID - 1000]._alternates:
if (not get_course(upo) == "not found"):
print(get_course(upo)._temp_description)
print("\n\n")
'''
print(has_eight_courses(student[806], 2))
print(has_eight_courses_including_alternates(student[806], 1))
COURSE_NAME = "MFOOD11---"
print(COURSE_NAME, ": ")
print(get_course(COURSE_NAME)._sections)
COURSE_NAME = "MTROB11---"
print(COURSE_NAME, ": ")
print(get_course(COURSE_NAME)._sections)
#for course in courselist:
# print(course._description, " : " , course._sections)