-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathStudent-Course-Management-System.asm
More file actions
2140 lines (1955 loc) · 44.2 KB
/
Copy pathStudent-Course-Management-System.asm
File metadata and controls
2140 lines (1955 loc) · 44.2 KB
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
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
.MODEL SMALL
.STACK 100H
.DATA
sign1 DB '********************************$'
log_page DB ' LOGIN PAGE$'
; Login prompts
login_username DB 'Enter Username: $'
login_pass DB 'Enter Password: $'
wrong_username DB 'Invalid Username or Password! Try Again$'
; Storage for user input
name_ DB 8 DUP(?) ; Array to store input username
pass_ DB 5 DUP(?) ; Array to store input password
; Predefined users and passwords
advisor DB '#advisor' ; Advisor username
advisorpass DB '12345' ; Advisor password
student1 DB 'student1' ; Student1 username
student1pass DB 'pass1' ; Student1 password
student2 DB 'student2' ; Student2 username
student2pass DB 'pass2' ; Student2 password
student3 DB 'student3' ; Student3 username
student3pass DB 'pass3' ; Student3 password
; Student 1 Information
st1_header DB '==== Student 1 Information ====$'
st1_name DB 'Name: Faisal Ahmed$'
st1_id DB 'ID: 21301186'
st1_cgpa DB 'CGPA: 2.00$'
stu1_cgpa DB 20
st1_courses DB 'Completed Courses: Programming, Database, Algorithms$'
; Student 2 Information
st2_header DB '==== Student 2 Information ====$'
st2_name DB 'Name: Shafiur Rahman$'
st2_id DB 'ID: 21201613'
st2_cgpa DB 'CGPA: 4.00$'
stu2_cgpa DB 40
st2_courses DB 'Completed Courses: Web Dev, OS, Computer Networks$'
; Student 3 Information
st3_header DB '==== Student 3 Information ====$'
st3_name DB 'Name: Mahmuda Akter Alif$'
st3_id DB 'ID: 21201149'
st3_cgpa DB 'CGPA: 3.90$'
stu3_cgpa DB 39
st3_courses DB 'Completed Courses: AI, Machine Learning, Data Science$'
course_header DB 'Available Courses for Registration:$'
course1 DB '1. Data Structures$'
course2 DB '2. Computer Architecture$'
course3 DB '3. Microprocessor$'
course4 DB '4. Digital Logic Design$'
course5 DB '5. Software Engineering$'
course6 DB '6. Computer Graphics$'
course7 DB '7. Artificial Intelligence$'
selected_msg DB 'Your Selected Courses:$'
; Course Registration Messages
reg_prompt DB 'Enter course number to register (0 to finish): $'
max_course_msg DB 'Maximum courses reached!$'
done_msg DB 'Registration Complete!$'
courses_header DB 'Available Courses and Seats:$'
course_seats DB 7 DUP(?) ; Array to store available seats for each course
initial_seats DB 3, 4, 1, 6, 0, 5, 2 ; Initial seats for courses 1-7
no_seats_msg DB 'No seat available for this course!$'
; Variables for course selection
selected_courses DB 5 DUP(0) ; Array to store selected course numbers (0 means not selected)
course_count DB 0 ; Counter for number of courses selected
invalid_msg DB 'Course already selected! Try another.$'
cgpa_limit_msg DB 'CGPA below 3.5 - Maximum 4 courses allowed.$'
advisor_menu DB '1. View Student 1', 0DH, 0AH
DB '2. View Student 2', 0DH, 0AH
DB '3. View Student 3', 0DH, 0AH
DB 'Choose student (1-3): $'
add_only_prompt DB 'A-Add course, R-Return: $'
drop_done_prompt DB 'D-Drop course, R-Return, F-Finish: $'
invalid_course_msg DB 'Invalid course selection!$'
current_courses DB 'Current registered courses:$'
modify_prompt DB 'A-Add course, D-Drop course, R-Return: $'
drop_prompt DB 'Enter course number to drop: $'
adv_drop_msg DB 'Enter course number to drop (0 to cancel): $'
adv_add_msg DB 'Enter course number to add (0 to cancel): $'
adv_options DB 'A-Add course, D-Drop course, F-Finish: $'
adv_initial_msg DB 'A-Add course, F-Finish: $'
adv_invalid_drop DB 'Invalid course number to drop!$'
adv_drop_success DB 'Course dropped successfully.$'
adv_no_courses DB 'No courses selected yet.$'
return_menu_msg DB 'Press any key to return to menu...$'
total_fee_msg DB 'Total Semester Fee: $'
currency_msg DB ' BDT$'
fee_newline DB 0DH, 0AH, '$'
newline DB 0DH, 0AH, '$'
.CODE
MAIN PROC
; Initialize DS
MOV AX, @DATA
MOV DS, AX
mov cx, 7 ; Loop counter for 7 courses
mov si, 0
init_seats:
mov al, initial_seats[si]
mov course_seats[si], al
inc si
loop init_seats
mov ah, 2
mov dl, 0dh
int 21h
mov dl, 0ah
int 21h
mov ah, 2
mov dl, 0dh
int 21h
mov dl, 0ah
int 21h
mov ah, 9
lea dx, sign1
int 21h
mov ah, 2
mov dl, 0dh
int 21h
mov dl, 0ah
int 21h
mov ah, 9
lea dx, log_page
int 21h
mov ah, 2
mov dl, 0dh
int 21h
mov dl, 0ah
int 21h
mov ah, 9
lea dx, sign1
int 21h
jmp taking_input
; User input
againtry:
mov ah, 2
mov dl, 0dh
int 21h
mov dl, 0ah
int 21h
mov ah, 2
mov dl, 0dh
int 21h
mov dl, 0ah
int 21h
mov ah, 9
lea dx, wrong_username
int 21h
mov cx, 7 ; Counter for 7 courses
mov si, 0 ; Source index
taking_input:
; Taking username from user
mov ah, 2
mov dl, 0dh
int 21h
mov dl, 0ah
int 21h
mov ah, 2
mov dl, 0dh
int 21h
mov dl, 0ah
int 21h
mov ah, 2
mov dl, 0dh
int 21h
mov dl, 0ah
int 21h
mov ah, 9
lea dx, login_username
int 21h
mov cx, 8 ; Changed to 8 to match the array size in data segment
mov si, 0
take_name:
mov ah, 1
int 21h
mov name_[si], al ; Corrected variable name here
inc si
loop take_name
mov ah, 2
mov dl, 0dh
int 21h
mov dl, 0ah
int 21h
; Taking password from the user
mov ah, 9
lea dx, login_pass
int 21h
mov cx, 5
mov si, 0
takepass:
mov ah, 1
int 21h
mov pass_[si], al
inc si
loop takepass
mov ah, 2
mov dl, 0dh
int 21h
mov dl, 0ah
int 21h
; For advisor
check0:
mov cx, 8 ; Advisor username length is 8
mov si, 0
aduser:
mov al, advisor[si]
mov bl, name_[si]
cmp al, bl
jne check1
inc si
loop aduser
jmp advisor_passcheck ; Changed from student1_passcheck
check1:
mov cx, 8 ; Changed to 8 to match student usernames
mov si, 0
st1user:
mov al, student1[si]
mov bl, name_[si]
cmp al, bl
jne check2
inc si
loop st1user
jmp student1_passcheck ; This label is correct
check2:
mov cx, 8 ; Changed to 8 to match student usernames
mov si, 0
st2user:
mov al, student2[si]
mov bl, name_[si]
cmp al, bl
jne check3
inc si
loop st2user
jmp student2_passcheck ; This label is correct
check3:
mov cx, 8 ; Changed to 8 to match student usernames
mov si, 0
st3user:
mov al, student3[si]
mov bl, name_[si]
cmp al, bl
jne againtry
inc si
loop st3user
jmp student3_passcheck ; This label is correct
; For advisor
advisor_passcheck: ; Added this section
mov cx, 5
mov si, 0
adpass:
mov al, advisorpass[si]
mov bl, pass_[si]
cmp al, bl
jne againtry
inc si
loop adpass
jmp advisor_panel
; For student1
student1_passcheck: ; This label exists and is correct
mov cx, 5
mov si, 0
st1pass:
mov al, student1pass[si]
mov bl, pass_[si]
cmp al, bl
jne againtry
inc si
loop st1pass
jmp student1_panel
; For student2
student2_passcheck: ; This label exists and is correct
mov cx, 5
mov si, 0
st2pass:
mov al, student2pass[si]
mov bl, pass_[si]
cmp al, bl
jne againtry
inc si
loop st2pass
jmp student2_panel
; For student3
student3_passcheck: ; This label exists and is correct
mov cx, 5
mov si, 0
st3pass:
mov al, student3pass[si]
mov bl, pass_[si]
cmp al, bl
jne againtry
inc si
loop st3pass
jmp student3_panel
MAIN ENDP
advisor_panel PROC
push ax
push dx
advisor_menu_start: ; New label for returning to menu
; Clear screen
mov ah, 0
mov al, 3
int 10h
; Display menu
lea dx, advisor_menu
mov ah, 9
int 21h
; Get menu choice
mov ah, 1
int 21h
sub al, '0'
; Check menu choice
cmp al, 1
je adv_view_student1
cmp al, 2
je adv_view_student2
cmp al, 3
je adv_view_student3
jmp exit_panel
adv_view_student1:
call display_student1_info
call adv_manage_courses1
jmp advisor_panel
adv_view_student2:
call display_student2_info
call adv_manage_courses2
jmp advisor_panel
adv_view_student3:
call display_student3_info
call adv_manage_courses3
jmp advisor_panel
exit_panel:
pop dx
pop ax
ret
advisor_panel ENDP
; Display procedures for each student
display_student1_info PROC
push ax
push dx
lea dx, st1_header
mov ah, 9
int 21h
lea dx, newline
int 21h
lea dx, st1_name
int 21h
lea dx, newline
int 21h
lea dx, st1_id
int 21h
lea dx, newline
int 21h
lea dx, st1_cgpa
int 21h
lea dx, newline
int 21h
lea dx, st1_courses
int 21h
lea dx, newline
int 21h
pop dx
pop ax
ret
display_student1_info ENDP
display_student2_info PROC
push ax
push dx
lea dx, st2_header
mov ah, 9
int 21h
lea dx, newline
int 21h
lea dx, st2_name
int 21h
lea dx, newline
int 21h
lea dx, st2_id
int 21h
lea dx, newline
int 21h
lea dx, st2_cgpa
int 21h
lea dx, newline
int 21h
lea dx, st2_courses
int 21h
lea dx, newline
int 21h
pop dx
pop ax
ret
display_student2_info ENDP
display_student3_info PROC
push ax
push dx
lea dx, st3_header
mov ah, 9
int 21h
lea dx, newline
int 21h
lea dx, st3_name
int 21h
lea dx, newline
int 21h
lea dx, st3_id
int 21h
lea dx, newline
int 21h
lea dx, st3_cgpa
int 21h
lea dx, newline
int 21h
lea dx, st3_courses
int 21h
lea dx, newline
int 21h
pop dx
pop ax
ret
display_student3_info ENDP
; Course management procedures
adv_manage_courses1 PROC
push ax
push bx
push cx
push dx
push si
; Reset course count
mov course_count, 0
; Display available courses
call display_available_courses
; Start with empty course list
cmp course_count, 0
je first_add
show_options:
lea dx, newline
mov ah, 9
int 21h
lea dx, adv_options
int 21h
mov ah, 1
int 21h
cmp al, 'A'
je add_course
cmp al, 'D'
je drop_course
cmp al, 'F'
je finish
jmp show_options
first_add:
lea dx, newline
mov ah, 9
int 21h
lea dx, adv_initial_msg
int 21h
mov ah, 1
int 21h
cmp al, 'A'
je add_course
cmp al, 'F'
je finish
jmp first_add
add_course:
; Check if max courses reached based on CGPA
mov al, course_count
cmp al, 4
jge check_cgpa_limit
jmp do_add
check_cgpa_limit:
mov al, stu1_cgpa
cmp al, 35 ; Compare with 3.5 (stored as 35)
jl max_reached ; If CGPA < 3.5, don't allow more courses
cmp course_count, 5
jge max_reached
do_add:
lea dx, newline
mov ah, 9
int 21h
lea dx, adv_add_msg
int 21h
mov ah, 1
int 21h
sub al, '0'
cmp al, 0
je show_options
; Validate course number
cmp al, 1
jl do_add
cmp al, 7
jg do_add
; Check for duplicate
push ax
mov cx, 5
mov si, 0
check_dup:
cmp selected_courses[si], al
je dup_found
inc si
loop check_dup
pop ax
mov bh, 0
mov bl, course_count
mov si, bx
mov selected_courses[si], al
inc course_count
call display_selected_courses
jmp show_options
dup_found:
pop ax
lea dx, newline
mov ah, 9
int 21h
lea dx, invalid_msg
int 21h
jmp show_options
drop_course:
cmp course_count, 0
je no_courses
call display_selected_courses
lea dx, newline
mov ah, 9
int 21h
lea dx, adv_drop_msg
int 21h
mov ah, 1
int 21h
sub al, '0'
cmp al, 0
je show_options
; Find and remove course
mov cx, 5
mov si, 0
find_course:
cmp selected_courses[si], al
je remove_course
inc si
loop find_course
lea dx, newline
mov ah, 9
int 21h
lea dx, adv_invalid_drop
int 21h
jmp show_options
remove_course:
; Shift remaining courses
push si
mov bx, si
shift_courses:
mov al, selected_courses[si + 1]
mov selected_courses[si], al
inc si
cmp si, 4
jl shift_courses
mov selected_courses[4], 0
dec course_count
pop si
lea dx, newline
mov ah, 9
int 21h
lea dx, adv_drop_success
int 21h
call display_selected_courses
jmp show_options
no_courses:
lea dx, newline
mov ah, 9
int 21h
lea dx, adv_no_courses
int 21h
jmp show_options
max_reached:
lea dx, newline
mov ah, 9
int 21h
mov al, stu1_cgpa
cmp al, 35
jge show_max
lea dx, cgpa_limit_msg
jmp display_max
show_max:
lea dx, max_course_msg
display_max:
mov ah, 9
int 21h
jmp show_options
finish:
lea dx, newline
mov ah, 9
int 21h
lea dx, done_msg
mov ah, 9
int 21h
; Display final course selection
call display_selected_courses
; Add return to menu option
lea dx, newline
mov ah, 9
int 21h
lea dx, newline
int 21h
; Press any key to return to menu message
lea dx, return_menu_msg
mov ah, 9
int 21h
; Wait for key press
mov ah, 1
int 21h
pop si
pop dx
pop cx
pop bx
pop ax
ret
adv_manage_courses1 ENDP
adv_manage_courses2 PROC
push ax
push bx
push cx
push dx
push si
; Reset course count
mov course_count, 0
; Display available courses
call display_available_courses
; Start with empty course list
cmp course_count, 0
je first_add2
show_options2:
lea dx, newline
mov ah, 9
int 21h
lea dx, adv_options
int 21h
mov ah, 1
int 21h
cmp al, 'A'
je add_course2
cmp al, 'D'
je drop_course2
cmp al, 'F'
je finish2
jmp show_options2
first_add2:
lea dx, newline
mov ah, 9
int 21h
lea dx, adv_initial_msg
int 21h
mov ah, 1
int 21h
cmp al, 'A'
je add_course2
cmp al, 'F'
je finish2
jmp first_add2
add_course2:
; Check if max courses reached
mov al, course_count
cmp al, 4
jge check_cgpa2_adv
jmp do_add2
check_cgpa2_adv:
mov al, stu2_cgpa
cmp al, 35
jl max_reached2_adv
cmp course_count, 5
jge max_reached2_adv
do_add2:
lea dx, newline
mov ah, 9
int 21h
lea dx, adv_add_msg
int 21h
mov ah, 1
int 21h
sub al, '0'
cmp al, 0
je show_options2
; Validate course number
cmp al, 1
jl do_add2
cmp al, 7
jg do_add2
; Check for duplicate
push ax
mov cx, 5
mov si, 0
check_dup2:
cmp selected_courses[si], al
je dup_found2
inc si
loop check_dup2
pop ax
mov bh, 0
mov bl, course_count
mov si, bx
mov selected_courses[si], al
inc course_count
call display_selected_courses
jmp show_options2
dup_found2:
pop ax
lea dx, newline
mov ah, 9
int 21h
lea dx, invalid_msg
int 21h
jmp show_options2
drop_course2:
cmp course_count, 0
je no_courses2
call display_selected_courses
lea dx, newline
mov ah, 9
int 21h
lea dx, adv_drop_msg
int 21h
mov ah, 1
int 21h
sub al, '0'
cmp al, 0
je show_options2
; Find and remove course
mov cx, 5
mov si, 0
find_course2:
cmp selected_courses[si], al
je remove_course2
inc si
loop find_course2
lea dx, newline
mov ah, 9
int 21h
lea dx, adv_invalid_drop
int 21h
jmp show_options2
remove_course2:
; Shift remaining courses
push si
mov bx, si
shift_courses2:
mov al, selected_courses[si + 1]
mov selected_courses[si], al
inc si
cmp si, 4
jl shift_courses2
mov selected_courses[4], 0
dec course_count
pop si
lea dx, newline
mov ah, 9
int 21h
lea dx, adv_drop_success
int 21h
call display_selected_courses
jmp show_options2
no_courses2:
lea dx, newline
mov ah, 9
int 21h
lea dx, adv_no_courses
int 21h
jmp show_options2
max_reached2_adv:
lea dx, newline
mov ah, 9
int 21h
mov al, stu2_cgpa
cmp al, 35
jge show_max2
lea dx, cgpa_limit_msg
jmp display_max2
show_max2:
lea dx, max_course_msg
display_max2:
mov ah, 9
int 21h
jmp show_options2
finish2:
lea dx, newline
mov ah, 9
int 21h
lea dx, done_msg
mov ah, 9
int 21h
; Display final course selection
call display_selected_courses
; Add return to menu option
lea dx, newline
mov ah, 9
int 21h
lea dx, newline
int 21h
; Press any key to return to menu message
lea dx, return_menu_msg
mov ah, 9
int 21h
; Wait for key press
mov ah, 1
int 21h
pop si
pop dx
pop cx
pop bx
pop ax
ret
adv_manage_courses2 ENDP
adv_manage_courses3 PROC
push ax
push bx
push cx
push dx
push si
; Reset course count
mov course_count, 0
; Display available courses
call display_available_courses
; Start with empty course list
cmp course_count, 0
je first_add3
show_options3:
lea dx, newline
mov ah, 9
int 21h
lea dx, adv_options
int 21h
mov ah, 1
int 21h
cmp al, 'A'
je add_course3
cmp al, 'D'
je drop_course3
cmp al, 'F'
je finish3
jmp show_options3
first_add3:
lea dx, newline
mov ah, 9
int 21h
lea dx, adv_initial_msg
int 21h
mov ah, 1
int 21h
cmp al, 'A'
je add_course3
cmp al, 'F'
je finish3
jmp first_add3
add_course3:
; Check if max courses reached
mov al, course_count
cmp al, 4
jge check_cgpa3_adv
jmp do_add3
check_cgpa3_adv:
mov al, stu3_cgpa
cmp al, 35
jl max_reached3_adv
cmp course_count, 5
jge max_reached3_adv
do_add3:
lea dx, newline
mov ah, 9
int 21h
lea dx, adv_add_msg
int 21h
mov ah, 1
int 21h
sub al, '0'
cmp al, 0
je show_options3
; Validate course number
cmp al, 1
jl do_add3
cmp al, 7
jg do_add3
; Check for duplicate
push ax
mov cx, 5
mov si, 0
check_dup3:
cmp selected_courses[si], al
je dup_found3
inc si
loop check_dup3
pop ax
mov bh, 0
mov bl, course_count
mov si, bx
mov selected_courses[si], al
inc course_count
call display_selected_courses
jmp show_options3
dup_found3:
pop ax
lea dx, newline
mov ah, 9
int 21h
lea dx, invalid_msg
int 21h
jmp show_options3
drop_course3:
cmp course_count, 0
je no_courses3
call display_selected_courses
lea dx, newline
mov ah, 9
int 21h
lea dx, adv_drop_msg
int 21h