assmbly language please. Proof of your solutions and test results: To show the operation of your program and to verify results from execution, you should use procedures WriteString, WriteInt, DumpMem and DumpReg, whichever applicable for a particular exercise, to display the results.please Make sure the library file Irvine32.inc is included on top of your program; this .inc file includes all the procedures mentioned above, and more. And ntegrate the calls to these procedures to output the results onto the console. SHIFTING THE ELEMENTS IN AN ARRAY Using a loop and indexed addressing, write code that rotates the members of a 32-bit integer array forward one position; rotating elements in the SAME array, NOT copying elements to a new array with shifted positions. The value at the end of the array must wrap around to the first position. For example, the array [10h, 20h, 30h, 40h] would be transformed into [40h, 10h ,20h ,30h]. In the output of the program, the array values both before and after shifting should be shown, by calling the Irvine peripheral procedure(s). IMPORTANT: for this exercise, NOT allowable to use any one of these directives: .IF, .ELSE, .ELSEIF, .WHILE, .REPEAT, etc
assmbly language please. Proof of your solutions and test results: To show the operation of your program and to verify results from execution, you should use procedures WriteString, WriteInt, DumpMem and DumpReg, whichever applicable for a particular exercise, to display the results.please Make sure the library file Irvine32.inc is included on top of your program; this .inc file includes all the procedures mentioned above, and more. And ntegrate the calls to these procedures to output the results onto the console.
SHIFTING THE ELEMENTS IN AN ARRAY
Using a loop and indexed addressing, write code that rotates the members of a 32-bit integer array forward one position; rotating elements in the SAME array, NOT copying elements to a new array with shifted positions. The value at the end of the array must wrap around to the first position. For example, the array [10h, 20h, 30h, 40h] would be transformed into [40h, 10h ,20h ,30h].
In the output of the program, the array values both before and after shifting should be shown, by calling the Irvine peripheral procedure(s).
IMPORTANT: for this exercise, NOT allowable to use any one of these directives: .IF, .ELSE, .ELSEIF, .WHILE, .REPEAT, etc
![SHIFTING THE ELEMENTS IN AN ARRAY
Using a loop and indexed addressing, write code that rotates the members of a 32-bit integer array forward one position; rotating elements in the SAME array,
NOT copying elements to a new array with shifted positions. The value at the end of the array must wrap around to the first position. For example, the array
[10h, 20h, 30h, 40h] would be transformed into [40h, 10h ,20h,30h].
In the output of the program, the array values both before and after shifting should be shown, by calling the Irvine peripheral procedure(s).
IMPORTANT: for this exercise, NOT allowable to use any one of these directives: .IF, .ELSE, .ELSEIF, .WHILE, .REPEAT, etc](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F8d2af6b8-35d3-4327-94c1-a05ff77beaf0%2F2338b8fc-992d-45b6-bbba-afa738d3ae3c%2Fhh35fbw_processed.png&w=3840&q=75)
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
