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

EBK JAVA PROGRAMMING
9th Edition
ISBN:9781337671385
Author:FARRELL
Publisher:FARRELL
Chapter8: Arrays
Section: Chapter Questions
Problem 15RQ
icon
Related questions
Question

can you show me the screen shot of the out put

INCLUDE Irvine32.inc

.DATA
array DWORD 10h, 20h, 30h, 40h
arraySize = ($ - array) / TYPE array

.CODE
main PROC
    ; Display the array values before shifting
    CALL DumpMem
    CALL Crlf
    
    ; Rotate the elements of the array forward one position
    MOV EAX, array[arraySize - 1] ; Save the last element of the array in EAX
    MOV ECX, arraySize - 1
rotateLoop:
    MOV EDX, array[ECX - 1] ; Move the previous element into EDX
    MOV array[ECX], EDX ; Move the previous element into the current element
    LOOP rotateLoop
    MOV array[0], EAX ; Move the last element into the first element
    
    ; Display the array values after shifting
    CALL DumpMem
    CALL Crlf
    
    CALL WaitMsg
    RET
main ENDP

END main

 

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
Transcribed Image Text: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
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 5 steps with 3 images

Blurred answer
Knowledge Booster
Randomized Select Algorithm
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
EBK JAVA PROGRAMMING
EBK JAVA PROGRAMMING
Computer Science
ISBN:
9781337671385
Author:
FARRELL
Publisher:
CENGAGE LEARNING - CONSIGNMENT
Systems Architecture
Systems Architecture
Computer Science
ISBN:
9781305080195
Author:
Stephen D. Burd
Publisher:
Cengage Learning
New Perspectives on HTML5, CSS3, and JavaScript
New Perspectives on HTML5, CSS3, and JavaScript
Computer Science
ISBN:
9781305503922
Author:
Patrick M. Carey
Publisher:
Cengage Learning