Question: EASY 68K (ASSEMBLY LANGUAGE) Please do this as the question ask, correctly. Do not use other programs. just EASY 68k !! The program of this

EASY 68K (ASSEMBLY LANGUAGE)
Please do this as the question ask, correctly.
Do not use other programs. just EASY 68k !!
 EASY 68K (ASSEMBLY LANGUAGE) Please do this as the question ask,

The program of this project deals with arrays of numbers and subroutines. First the program defines some random lists of numbers and allocates empty storage for sorted arrays, then it sorts the lists. The overall program structure should be as follows, you may add several subroutines: ORG CLR.L DO BRA $0900 SORT1 7 start program at this address iskip over DC instructions idefine number of elements in arrayl reserve location for sorted arrayl define number of elements in array2 :define the elements of array2 LAB ARY1 ARY1S DS.B ARY2 DC.B DC. B 56,-5,8,23,-9,18,4 define the elements of arrayl 7 DC . DC . 12 $15, $A4 , $F4, $55, $E3, $E3, $38, $17, $ , $21 , $07 , $34 ARY2S DS.B 12 reserve location for sorted array2 SORTI iset parameter (DO, AO,A1) to sort arrayl .. . ;then call subroutine SORT SORT2 iset parameter (DO, AO,A1) to sort array2 then call subroutine SORT SORT ;subroutine SORT reads the address of the array from A0 and stores the sorted array at A1. The length of the array is passed via DO END 1) Complete the above 68000 assembly language program where the SORTI part sets the DO/A0/AI parameters, which are used by the SORT subroutine to sort array ARY1. DO holds the length of the array A0 holds the address of the first element of the array. Al holds the address where the sorted array will be stored. The SORT2 part will, in the same analogy, sort array ARY2 2) Run your program and verify the results by using memory display. Show the corresponding screenshots of memory displays ) Manually change the values of the arrays ARY1 and ARY2 and rerun your program starting at address SORT1. Check your results again by memory display The program of this project deals with arrays of numbers and subroutines. First the program defines some random lists of numbers and allocates empty storage for sorted arrays, then it sorts the lists. The overall program structure should be as follows, you may add several subroutines: ORG CLR.L DO BRA $0900 SORT1 7 start program at this address iskip over DC instructions idefine number of elements in arrayl reserve location for sorted arrayl define number of elements in array2 :define the elements of array2 LAB ARY1 ARY1S DS.B ARY2 DC.B DC. B 56,-5,8,23,-9,18,4 define the elements of arrayl 7 DC . DC . 12 $15, $A4 , $F4, $55, $E3, $E3, $38, $17, $ , $21 , $07 , $34 ARY2S DS.B 12 reserve location for sorted array2 SORTI iset parameter (DO, AO,A1) to sort arrayl .. . ;then call subroutine SORT SORT2 iset parameter (DO, AO,A1) to sort array2 then call subroutine SORT SORT ;subroutine SORT reads the address of the array from A0 and stores the sorted array at A1. The length of the array is passed via DO END 1) Complete the above 68000 assembly language program where the SORTI part sets the DO/A0/AI parameters, which are used by the SORT subroutine to sort array ARY1. DO holds the length of the array A0 holds the address of the first element of the array. Al holds the address where the sorted array will be stored. The SORT2 part will, in the same analogy, sort array ARY2 2) Run your program and verify the results by using memory display. Show the corresponding screenshots of memory displays ) Manually change the values of the arrays ARY1 and ARY2 and rerun your program starting at address SORT1. Check your results again by memory display

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!