6811/6812 Instructions solutions only.

Implementations:

This is what I wrote so far..

Implementation Details The following information expands upon the Marking Rubric provided for this assignment. Marks.txt. Notepad File Edit Format View Help db 89, 77, 52, 68 db 45, 34, 95, 22 db 55, 81, 90, 81 db 89, 49, 51, 70 . The Program Name must be: Grades.asm and it must be created used AsmIDE You must use the supplied Marks.txt file in your solution, rather than Marks.txt the values illustrated in this example All Marks must be defined as constants within your solution e.g. EIGHTY equ 80 All Labels must follow course standards oe.g. Loop, Check80, AssignA The Marks array origin must be $1000 The Marks array must include the labels Marks and EndMarks The Marks array must be loaded into AsmIDE via a provided external file The Expected Results of the program must be included within the code, ideally immediately following the Marks Array The Grades array origin must be $1020 The memory allocated for the Grades array must be dynamically created The program code origin must be $2000 The solution must follow the structure of the flowchart - e.g. Iteration using a Selection Structure Appropriate documentation must be used both in the Program Header and within the code so that the program functionally is clear The Iteration method chosen must use a dynamically created array length (Counter approach) or a dynamically created array size (Memory Address approach), but not both. I recommend that the Memory Address approach be used. The iteration method chosen must use the Indexed (IDX) Addressing Mode Branch Instructions must match the data type of the Marks array, except for Unary Branch Instructions . . 10 11 12 13 ; If Mark >= 80 "A" ; If Mark >= 70 "B" ; IF Mark = 60 "C" ; If Mark >= 50 "D" ; Else "F" Store these grades, if all of the marks has been processed then the program will terminate else it will run throughout again. 14 15 16 17 ; Program Constants 18 19 EIGHTY equ 80 20 SEVENTY equ 70 21 SIXTY equ 60 22 FIFTY equ 50 23 24 org $1000 25 26 Marks 27 #include Marks.txt 28 EndMarks 29 30 org $2000 ; Program Area 31 lds #$2000 ; Loads stack 32 ; More code would go here to 33 ; initialize a pointer to Grades 34 ; and read in the value into A 35 Check80 cmpa #EIGHTY 36 bhs Assigna 37 38 Check70 cmpa #SEVENTY 39 bhs AssignB 40 41 Check 60 mpa #SIXTY 42 bhs Assignc 43 44 Check 50 cmpa #FIFTY 45 bhs AssignD 46 47 Check 50 cmpa #FIFTY 48 blo AssignF 49 50 AGrade bra AssignA 51 AssignA ldab #'A' 52 Next 53 AssignB ldab # B 54 Next 55 Assignc ldab #'C' 56 Next 57 AssignD ldab #'D' 58 Next 59 AssignF ldab #'F' 60 Next 61 end Implementation Details The following information expands upon the Marking Rubric provided for this assignment. Marks.txt. Notepad File Edit Format View Help db 89, 77, 52, 68 db 45, 34, 95, 22 db 55, 81, 90, 81 db 89, 49, 51, 70 . The Program Name must be: Grades.asm and it must be created used AsmIDE You must use the supplied Marks.txt file in your solution, rather than Marks.txt the values illustrated in this example All Marks must be defined as constants within your solution e.g. EIGHTY equ 80 All Labels must follow course standards oe.g. Loop, Check80, AssignA The Marks array origin must be $1000 The Marks array must include the labels Marks and EndMarks The Marks array must be loaded into AsmIDE via a provided external file The Expected Results of the program must be included within the code, ideally immediately following the Marks Array The Grades array origin must be $1020 The memory allocated for the Grades array must be dynamically created The program code origin must be $2000 The solution must follow the structure of the flowchart - e.g. Iteration using a Selection Structure Appropriate documentation must be used both in the Program Header and within the code so that the program functionally is clear The Iteration method chosen must use a dynamically created array length (Counter approach) or a dynamically created array size (Memory Address approach), but not both. I recommend that the Memory Address approach be used. The iteration method chosen must use the Indexed (IDX) Addressing Mode Branch Instructions must match the data type of the Marks array, except for Unary Branch Instructions . . 10 11 12 13 ; If Mark >= 80 "A" ; If Mark >= 70 "B" ; IF Mark = 60 "C" ; If Mark >= 50 "D" ; Else "F" Store these grades, if all of the marks has been processed then the program will terminate else it will run throughout again. 14 15 16 17 ; Program Constants 18 19 EIGHTY equ 80 20 SEVENTY equ 70 21 SIXTY equ 60 22 FIFTY equ 50 23 24 org $1000 25 26 Marks 27 #include Marks.txt 28 EndMarks 29 30 org $2000 ; Program Area 31 lds #$2000 ; Loads stack 32 ; More code would go here to 33 ; initialize a pointer to Grades 34 ; and read in the value into A 35 Check80 cmpa #EIGHTY 36 bhs Assigna 37 38 Check70 cmpa #SEVENTY 39 bhs AssignB 40 41 Check 60 mpa #SIXTY 42 bhs Assignc 43 44 Check 50 cmpa #FIFTY 45 bhs AssignD 46 47 Check 50 cmpa #FIFTY 48 blo AssignF 49 50 AGrade bra AssignA 51 AssignA ldab #'A' 52 Next 53 AssignB ldab # B 54 Next 55 Assignc ldab #'C' 56 Next 57 AssignD ldab #'D' 58 Next 59 AssignF ldab #'F' 60 Next 61 end