Micro

 LXI H, D020H ; Step 1: HL points to starting address

        MVI C, 0AH ; Step 2: count = 10 bytes

        MVI B, 00H ; Step 3: B = even count = 0

        MVI D, 00H ; Step 4: D = odd count = 0


NEXT: MOV A, M ; Step 5: Get byte into accumulator

        ANI 01H ; Step 6: Mask LSB → check even/odd


        JNZ ODD ; If result ≠ 0 → odd number


EVEN: INR B ; Step 7: increment even counter

        JMP CONTINUE ; Step 8: skip odd part


ODD: INR D ; Step 9: increment odd counter


CONTINUE:

        INX H ; Step 10: move to next memory

        DCR C ; Step 11: decrease count

        JNZ NEXT ; Step 12: repeat until 10 bytes processed


        ; Step 13: Store results

        MVI H, D0H ; load high byte D0H

        MVI L, 70H ; store even count at D070H

        MOV M, B


        INX H ; HL = D071H

        MOV M, D ; store odd count


        HLT ; Step 14: stop program

Comments

Post a Comment

Popular posts from this blog

Ham

#include <math.h> #include <stdio.h> int input[32]; int code[32]; int ham_calc(int, int); void solve(int input[], int); int ham_calc(int position, int c_l) {  int count = 0, i, j;  i = position - 1;    while (i < c_l) {  for (j = i; j < i + position; j++) {  if (code[j] == 1)  count++;  }  i = i + 2 * position;  }  if (count % 2 == 0)  return 0;  else  return 1; } void solve(int input[], int n) {  int i, p_n = 0, c_l, j, k;   i = 0;    while (n > (int)pow(2, i) - (i + 1)) {  p_n++;  i++;  }  c_l = p_n + n;  j = k = 0;    for (i = 0; i < c_l; i++) {    if (i == ((int)pow(2, k) - 1)) {  code[i] = 0;  k++;  }  else {  code[i] = input[j];  j++;  }  }  for (i = 0; i < p_n; i++) {  int position = (int)pow(2, i);  int value = ham_calc(position...
Read more

Crc

 #include<stdio.h> #include<conio.h> void main() { int i,f[20],n[50],div[50],j,temp,quotient[20],z[10]; printf("enter the number\n"); for(i=0;i<8;i++) { scanf("%d",&n[i]); } printf("enter the divisor\n"); for(i=0;i<4;i++) { scanf("%d",&div[i]); } for(i=8;i<12;i++) { n[i]=0; } for(i=0;i<8;i++) { temp=i; if(n[i]==1) { for (j=0;j<4;j++) { if (n[temp]==div[j]) {n[temp]=0; f[j]=0;} else {n[temp]=1; f[j]=1;} temp=temp+1; } quotient[i]=1; } else quotient[i]=0; } printf("\nthe quotient is \n"); for(i=0;i<8;i++) printf("%d",quotient[i]);  printf("\n and the remainder is \n "); for(j=0;j<4;j++) printf("%d",f[j]); getch(); } 
Read more

Byte stuffing sending receiving

 #include <stdio.h> int main() {  char data[100],sdata[100],rdata[100],rrdata[100];  int i=0,j=1;  printf ("$ is Flag and @ is Escape Character.\n");  printf ("Enter the Message : ");  scanf ("%s",&data);  sdata[0]='$';  while (data[i]!='\0')  {  if (data[i]=='$'||data[i]=='@')  {  sdata[j]='@';  j++;  sdata[j]=data[i];  }  else  {  sdata[j]=data[i];  }  i++;  j++;  }  sdata[j]='$';  sdata[j+1]='\0';  printf ("Sending data .... %s",sdata);  i=0;  printf ("\n\n");  while (sdata[i]!='\0')  {  rdata[i]=sdata[i];  i++;  }  rdata[i]='\0';  i=0;  for(j=1;rdata[j]!='\0';j++)  {  if (rdata[j]=='@')  {  j++;  rrdata[i]=rdata[j];  }   else if (rdata[j]=='$')  {  rrdata[i]=rdata[j+1];  }  else  {  rrdat...
Read more