Interface 8255 with 8085 microprocessor for 1’s and 2’s complement of a number

8086 program to determine modulus of first array elements corresponding to another array elements

Last Updated : 02 Aug, 2018

Problem – Write a program in 8086 microprocessor to determine modulus of corresponding 8 bit n elements of first array with 8-bit n numbers of second array, where size “n” is stored at offset 500 and the numbers of first array are stored from offset 501 and the numbers of second array are stored from offset 601 and store the result numbers into first array i.e offset 501.

Example –

Algorithm –

Store 500 to SI and 601 to DI and Load data from offset 500 to register CL and set register CH to 00 (for count).
Increase the value of SI by 1.
Load first number(value) from next offset (i.e 501) to register AL.
store 00 at register AH.
Divide the value in register AX by value at offset DI.
Store the result (value of register AH ) to memory offset SI.
Increase the value of SI by 1.
Increase the value of DI by 1.
Loop above 6 till register CX gets 0.

Program –

MEMORY ADDRESS	MNEMONICS	COMMENT
400	MOV SI, 500	SI<-500
403	MOV CL, [SI]	CL<-[SI]
405	MOV CH, 00	CH<-00
407	INC SI	SI<-SI+1
408	MOV DI, 601	DI<-601
40B	MOV AL, [SI]	AL<-[SI]
40D	MOV AH, 00	AH<-00
40F	DIV [DI]	AX=AX/[DI]
411	MOV [SI], AH	AH->[SI]
413	INC SI	SI<-SI+1
414	INC DI	DI<-DI+1
415	LOOP 40B	JUMP TO 40B IF CX!=0 and CX=CX-1
417	HLT	end

Explanation –

MOV SI, 500: set the value of SI to 500
MOV CL, [SI]: load data from offset SI to register CL
MOV CH, 00: set value of register CH to 00
INC SI: increase value of SI by 1.
MOV DI, 600: set the value of DI to 600.
MOV AL, [SI]: load value from offset SI to register AL
MOV AH, 00: set value of register AH to 00.
DIV [DI]: Divide value of register AX by content at offset DI.
MOV [SI], AH: store value of register AH at offset SI.
INC SI: increase value of SI by 1.
INC DI: increase value of DI by 1.
LOOP 408: jump to address 408 if CX not 0 and CX=CX-1.
HLT: stop

Interface 8255 with 8085 microprocessor for 1’s and 2’s complement of a number

A

anamika9988

Improve

Article Tags :

Similar Reads

8086 program to determine product of corresponding elements of two array elements

Problem - Write a program in 8086 microprocessor to find out the product of two arrays of 8-bit n numbers, where size â€œnâ€ is stored at offset 500 and the numbers of first array are stored from offset 501 and the numbers of second array are stored from offset 601 and store the result numbers into fir

8086 program to find the min value in a given array

Problem - Write a program to find the min value in a given array in assembly 8086 microprocessor Example - Assumptions - Starting address of input array is 0500 and store the result at address 0600 Algorithm â€“ Assign value 500 in SI and 600 in DIMove the contents of [SI] in CL and increment SI by 1A

Modulus of all pairwise consecutive elements in an Array

Given an array of [Tex]N [/Tex]elements. The task is to print the modulus of all of the pairwise consecutive elements. That is for all pair of consecutive elements say ((a[i], a[i+1])), print (a[i] % a[i+1]). Note: Consecutive pairs of an array of size N are (a[i], a[i+1]) for all i ranging from 0 t

Find all pairs (a, b) in an array such that a % b = k

Given an array with distinct elements, the task is to find the pairs in the array such that a % b = k, where k is a given integer. You may assume that a and b are in small range Examples : Input : arr[] = {2, 3, 5, 4, 7} k = 3Output : (7, 4), (3, 4), (3, 5), (3, 7)7 % 4 = 33 % 4 = 33 % 5 = 33 % 7 =

Modulus of two float or double numbers

Given two floating-point numbers, find the remainder. Examples: Input: a = 36.5, b = 5.0 Output: 1.5 Input: a = 9.7, b = 2.3 Output: 0.5 Recommended PracticeModulus of two double numbersTry It!A simple solution is to do repeated subtraction. [GFGTABS] C++ // C++ program to find modulo of floating //

Finding 'k' such that its modulus with each array element is same

Given an array of n integers .We need to find all 'k' such that arr[0] % k = arr[1] % k = ....... = arr[n-1] % k Examples: Input : arr[] = {6, 38, 34}Output : 1 2 4 6%1 = 38%1 = 34%1 = 0 6%2 = 38%2 = 34%2 = 0 6%4 = 38%4 = 34%2 = 2Input : arr[] = {3, 2}Output : 1Suppose the array contains only two el

Compute modulus division by a power-of-2-number

Given two numbers n and d where d is a power of 2 number, the task is to perform n modulo d without the division and modulo operators. Input: 6 4Output: 2 Explanation: As 6%4 = 2Input: 12 8Output: 4Explanation: As 12%8 = 4Input: 10 2Output: 0Explanation: As 10%2 = 0 Approach: The idea is to leverage

Count pairs in an array whose absolute difference is divisible by K | Using Map

Given an array, arr[] of N elements and an integer K, the task is to find the number of pairs (i, j) such that the absolute value of (arr[i] - arr[j]) is a multiple of K. Examples: Input: N = 4, K = 2, arr[] = {1, 2, 3, 4}Output: 2Explanation: Total 2 pairs exists in the array with absolute differen

Minimum value by which each Array element must be added as per given conditions

Given 2 arrays A[] and B[] and an integer M. The task is to find the minimum value of X such that after changing all the elements of the array to (arr[i] + X)%M frequency of all the elements of A[] is same as the frequency of all the elements of B[]. Print "-1" if it is not possible to find any valu

Find N-1 pairs (X, Y) from given array such that X and Y are different and X modulo Y is not present in array

Given an array Arr[] of size N consisting of N pairwise distinct positive integers. The task is to find N - 1 different pair of positive integers X, Y that satisfy the following conditions : X â‰ YX, Y both belong to the array.X mod Y does not belong to the array. Note: It is proved that N-1 such pai