05-11-2010, 12:31 AM
[COLOR="red"]Write an assembly language Program that Compare two arrays of 10 elements. Arrays are given below
Array1: 10 15 20 25 30 35 40 45 50 55
Array2: 15 10 20 35 40 30 55 50 25 45
You have to compare the Array 2 element one by one with array1. Once the matching element found then compare the 2nd element of array 2 with array one and so on until the whole elements of array 2 are compared.
Due Date: 10-05-2010[/COLOR]
Solution
hey kindly check this out i have no idea about this but it might help u..
I'd like to know what the exact phrasing of the question was.
It looks to me like they want you to sort the arrays first, in which case the two lists will agree.
(Array2 is a jumbled up version of array1.)
First, you need to specify which assembly language. I'm going to assume x86.
Then, you need to specify which assembler you're using: TASM? MASM? GASM? I'm going to assume TASM.
Then, you need to specify whether it is going to be a .COM file, a .EXE file, or a function. I'm going to assume a function called CompareArrays, and the arrays are FIXED, not passed into the function.
Then, you need to specify the target. 32-bit? 16-bit? I'm going to assume 32-bit.
Then, you need to know whether the arrays are arrays of bytes? Words? DoubleWords? I'm going to assume bytes.
Then, you have to say what to do when you FIND the element in Array2. I'm going to assume that you put the index of the element found in Array2 (starting from 0) in a third 10-element array called Result. If it's not found, then the element is -1.
Array1 DB 10,15,20,25,30,35,40,45,50,55
NumArray1 EQU $-Array1
Array2 DB 15,10,20,35,40,30,55,50,25,45
NumArray2 EQU $-Array2
Result DB NumArray1 DUP (-1) ; Pre-initialise to -1 (not found)
CompareArrays PROC
CLD ; Search forwards
MOV CH,OFFSET NumArray1 ; Number of elements to search
MOV EBX,OFFSET Result ; Point to Result
MOV ESI,OFFSET Array1 ; Point to first element of Array1
CompareLoop:
LODSB ; Get first number from ESI into AL
MOV CL,OFFSET NumArray2 ; Number of elements to compare
MOV AH,CL ; Save this away
MOV EDI,OFFSET Array2 ; Compare in Array2
REPNE SCASB ; Scan through array while NOT equal
JNE SHORT NextCompare ; Not found, so skip (already at -1)
SUB AH,CL ; Subtract from original number
DEC AH ; ...less one more for last compare
MOV [EBX],AH ; Save away into Result
NextCompare:
INC EBX ; Point to next Result
DEC CH ; One less to compare
JNZ CompareLoop
RET
CompareArrays ENDP
Source(s):
25 years of x86 assembler programming.
Please note, I haven't tested (or even assembled!) this - but you should get the idea.
Array1: 10 15 20 25 30 35 40 45 50 55
Array2: 15 10 20 35 40 30 55 50 25 45
You have to compare the Array 2 element one by one with array1. Once the matching element found then compare the 2nd element of array 2 with array one and so on until the whole elements of array 2 are compared.
Due Date: 10-05-2010[/COLOR]
Solution
hey kindly check this out i have no idea about this but it might help u..
I'd like to know what the exact phrasing of the question was.
It looks to me like they want you to sort the arrays first, in which case the two lists will agree.
(Array2 is a jumbled up version of array1.)
First, you need to specify which assembly language. I'm going to assume x86.
Then, you need to specify which assembler you're using: TASM? MASM? GASM? I'm going to assume TASM.
Then, you need to specify whether it is going to be a .COM file, a .EXE file, or a function. I'm going to assume a function called CompareArrays, and the arrays are FIXED, not passed into the function.
Then, you need to specify the target. 32-bit? 16-bit? I'm going to assume 32-bit.
Then, you need to know whether the arrays are arrays of bytes? Words? DoubleWords? I'm going to assume bytes.
Then, you have to say what to do when you FIND the element in Array2. I'm going to assume that you put the index of the element found in Array2 (starting from 0) in a third 10-element array called Result. If it's not found, then the element is -1.
Array1 DB 10,15,20,25,30,35,40,45,50,55
NumArray1 EQU $-Array1
Array2 DB 15,10,20,35,40,30,55,50,25,45
NumArray2 EQU $-Array2
Result DB NumArray1 DUP (-1) ; Pre-initialise to -1 (not found)
CompareArrays PROC
CLD ; Search forwards
MOV CH,OFFSET NumArray1 ; Number of elements to search
MOV EBX,OFFSET Result ; Point to Result
MOV ESI,OFFSET Array1 ; Point to first element of Array1
CompareLoop:
LODSB ; Get first number from ESI into AL
MOV CL,OFFSET NumArray2 ; Number of elements to compare
MOV AH,CL ; Save this away
MOV EDI,OFFSET Array2 ; Compare in Array2
REPNE SCASB ; Scan through array while NOT equal
JNE SHORT NextCompare ; Not found, so skip (already at -1)
SUB AH,CL ; Subtract from original number
DEC AH ; ...less one more for last compare
MOV [EBX],AH ; Save away into Result
NextCompare:
INC EBX ; Point to next Result
DEC CH ; One less to compare
JNZ CompareLoop
RET
CompareArrays ENDP
Source(s):
25 years of x86 assembler programming.
Please note, I haven't tested (or even assembled!) this - but you should get the idea.