Question

Translate the following C program to Pep/9 assembly language. It multiplies two integers using a recursive shift-and-add algorithm. mpr stands for multiplier and mcand stands for multiplicand.

A recursive integer multiplication algorithm

#include <stdio.h>

int times(int mpr, int mcand) {
   if (mpr == 0) {
      return 0;
   }
   else if (mpr % 2 == 1) {
      return times(mpr / 2, mcand * 2) + mcand;
   }
   else {
      return times(mpr / 2, mcand * 2);
   }
}

int main() {
   int n, m;
   scanf("%d %d", &n, &m);
   printf("Product: %d\n", times(n, m));
   return 0;
}

Answer 1

thw following program will multiply two integers in assembly language :-

datasegment

a db 09h

b db 02h

c dw ?

data ends

code segment

assume cs:code, ds:data

start:

mov ax,data

mov ds,ax

mov ax,0000h

mov bx,0000h

mov al,a

mov bl,b

mul b

mov c,ax

int 3

code ends

end start

Answer 2

#include<stdio.h>

int myAge;

void putNext(int age)

{

int nextYr;

nextYr = age + 1;

printf("%d\n",age);

printf("Age next Year%d\n",nextYr);

}

int main()

{

scanf("%d",&myAge);

putNext(myAge);

putNext(64);

return 0;

}

Answer 3

#include <stdio.h>
void stars()
{
int j, k;
for (j=1 ; j<=5 ; j++)
{
for (k = 1 ; k <= j; k++)
{
printf ("*");
}
printf ("\n");
}
}
int main()
{
stars();

return 0;
}