All posts by Ankur

8086, 8086 TASM, Snippets

8086 Assembly Program to Convert BCD Number into Binary Format

2 Comments

​In this blog post, we’ll explore how to convert a BCD (Binary-Coded Decimal) number into its binary equivalent using an 8086 assembly language program. The following code snippet demonstrates this process:

DATA SEGMENT
NO1 DB "9036"
D2 DB ?
D1 DB 16 DUP(?)
DATA ENDS
CODE SEGMENT
ASSUME CS:CODE, DS:DATA
START:
MOV AX, DATA
MOV DS, AX
LEA SI, NO1
LEA DI, D1
MOV CX, 04H
TOP:
MOV AL, [SI]
MOV DX, 0CH
UP1:
ROL AX,1
DEC DX
JNZ UP1
AND AX, 1111000000000000B
MOV DX, 04H
UP2:
ROL AX, 1
JNC DN
MOV BX, 1
MOV [DI], BX
JMP DN2
DN:
MOV BX, 0
MOV [DI], BX
DN2:
INC DI
DEC DX
JNZ UP2
INC SI
DEC CX
JNZ TOP
INT 3
CODE ENDS
END START
Continue reading 8086 Assembly Program to Convert BCD Number into Binary Format →
Mix (C++ and Assembly), Snippets

Mix (C++ and Assembly) Program to Convert BCD Number into Binary Format

Leave a comment

This post demonstrates how to convert a Binary Coded Decimal (BCD) number into its binary equivalent using inline assembly within a C++ program. The conversion is done by isolating and processing each BCD digit and calculating its decimal equivalent.

Continue reading Mix (C++ and Assembly) Program to Convert BCD Number into Binary Format →
Mix (C++ and Assembly), Snippets

Mix (C++ and Assembly) Program to Find Reverse of an Array

Leave a comment

This post explores how to reverse an array of integers using inline assembly within a C++ program. The program swaps elements from the start and end of the array using low-level assembly instructions.

#include<iostream.h>
#include<conio.h>

void main()
{
    int nos[5], x, y;
    cout << "\n Enter 5 numbers:";
    int i, j;
    for(i = 0; i < 5; i++)
    {
        cin >> nos[i];
    }
    for(i = 0, j = 4; i < 3; i++, j--)
    {
        x = nos[i];
        y = nos[j];
        _asm{
            mov ax, x
            mov bx, y
            mov cx, ax
            mov ax, bx
            mov bx, cx
            mov x, ax
            mov y, bx
        }
        nos[i] = x;
        nos[j] = y;
    }
    cout << "\n Reverse:";
    for(i = 0; i < 5; i++)
    {
        cout << nos[i] << " ";
    }
    getch();
}
Continue reading Mix (C++ and Assembly) Program to Find Reverse of an Array →
Mix (C++ and Assembly), Snippets

Mix (C++ and Assembly) Program to Check if String is Palindrome or not

Leave a comment

This C++ program checks whether a given array of five integers is a palindrome (i.e., reads the same forwards and backwards) using inline 8086 assembly instructions. It utilizes basic comparison instructions and control flow to determine equality between symmetric elements.

#include<iostream.h>
#include<conio.h>

void main()
{
    int nos[5], x, y;
    cout << "\n Enter 5 numbers:";
    int i, j;

    for (i = 0; i < 5; i++) {
        cin >> nos[i];
    }

    for (i = 0, j = 4; i < 3; i++, j--) {
        x = nos[i];
        y = nos[j];
        _asm {
            mov ax, x
            mov bx, y
            cmp ax, bx
            jnz no
        }
    }

    cout << "\n Array is Palindrome.";
    goto end;

no:
    cout << "\n Array is not palindrome.";

end:
    getch();
}
Continue reading Mix (C++ and Assembly) Program to Check if String is Palindrome or not →
Mix (C++ and Assembly), Snippets

Mix (C++ and Assembly) Program to Search an Element in an Array

Leave a comment

This C++ program demonstrates how to search for a specific element within an array of 10 integers using 8086 assembly instructions embedded inline. The program uses the cmp and jz instructions to perform the comparison and detect a match.

#include<iostream.h>
#include<conio.h>

void main()
{
    int nos[10], j, t;
    int i, p;

    cout << "\n Enter 10 numbers:";
    for (i = 0; i < 10; i++) {
        cin >> nos[i];
    }

    cout << "\n Enter number to be searched:";
    cin >> j;

    for (i = 0; i < 10; i++) {
        p = i;
        t = nos[i];
        _asm {
            mov ax, t     // Load current array element
            mov bx, j     // Load number to be searched
            cmp ax, bx    // Compare current element with target
            jz out        // If match found, jump to output
        }
    }

    cout << "\n No is not found.";
    goto end;

out:
    cout << "\n Number is found at " << p + 1 << " th position";

end:
    getch();
}
Continue reading Mix (C++ and Assembly) Program to Search an Element in an Array →
Mix (C++ and Assembly), Snippets

Mix (C++ and Assembly) Program to Add Two 16 bit Numbers

Leave a comment

While high-level languages like C++ are well known for abstracting away low-level operations, sometimes it’s beneficial to peek under the hood to see how things really work at the machine level. In this post, we’ll explore a simple C++ program that incorporates inline assembly to add two 16-bit numbers.

#include<iostream.h>
#include<conio.h>
#include<stdio.h>
void main()
{
clrscr();
int a,b,c;
cout<<"Enter First Number:";
cin>>a;
cout<<"Enter Second Number:";
cin>>b;
asm mov ax, a      // Move first number into AX
asm mov bx, b      // Move second number into BX
asm add ax, bx     // Add BX to AX (binary addition)
asm mov c, ax      // Move result into variable 'c'
cout<<"Result:";
cout<<c;
getch();
}
Continue reading Mix (C++ and Assembly) Program to Add Two 16 bit Numbers →
Mix (C++ and Assembly), Snippets

Mix (C++ and Assembly) Program to Add Two 16 bit Numbers (With DAA)

Leave a comment

While high-level programming languages like C++ make arithmetic operations incredibly simple, delving into inline assembly offers valuable insights into how the CPU processes instructions under the hood. Hence in this post, we’ll walk through a simple program that uses both C++ and inline assembly to add two integer values. Additionally, we will carry out decimal adjust after addition.

Continue reading Mix (C++ and Assembly) Program to Add Two 16 bit Numbers (With DAA) →