Computer Architecture Lab file
Computer Architecture Lab file
ASSEMBLY LANGUAGE
CSIT131
LAB FILE
CODE:
MVI A,45H ;MOVING 45H TO A
MVI B,51H ;MOVING 51H TO B
ANA B ;PERFORMING AND OPERATION
STA 2100H ;STORING ACCUMULATOR IN MEMORY LOCATION
2100H
HLT ;HALTING THE PROGRAM
OUTPUT:-
CODE:-
LXI H,4200H ;LOAD INTO HL,VALUE FROM
MOV B,M ;MOVE INTO B, M
INX H ;INCREMENT HL TOGETHER
MOV A,M ;MOVE INTO A,M
DCR B ;DECREMENT B
LOOP: INX H ;LOOP, KEEP INCREMENTING H
CMP M ;COMPARE M WITH A
JC AHEAD ; JUMP IF CARRY TO AHEAD
MOV A,M ; MOVE INTO A,M
AHEAD: DCR B ;AHEAD=DECREMENT B
JNZ LOOP ;JUMP IF NOT ZERO TO LOOP
STA 4230H ;STORE INTO 4230H
HLT
OUTPUT:-
OUTPUT :-
LAB 10: DESCENDING ORDER
LAB : 11/20/2023
Code :
lxi h, 0000h
mov c, m
dcr c
repeat: mov d, c
lxi h, 0001h
loop: mov a, m
inx h
cmp m
jnc skip
mov b, m
mov m, a
dcx h
mov m, b
inx h
skip: dcr d
jnz loop
dcr c
jnz repeat
hlt
For finding the descending order, we use a loop that will verify also which number is less
than and then put it on le right side.
Every time we compare two numbers, then we compare from the first to the next entity.