C Asg - PDF
C Asg - PDF
Code :-
#include<stdio.h>
#include<math.h>
#define COUNT 8 //change the value of COUNT to increase the no. of bits
int sum[COUNT];
int main()
int p[COUNT],q[COUNT];
take_bin(p);
take_bin(q);
print_bin(p);
print_bin(q);
add_bin(p,q);
return 0;
int i;
for(i=0;i<COUNT;i++)
scanf("%d",&a[i]);
int i;
for(i=0;i<COUNT;i++)
printf("%d",a[i]);
printf("\n");
int i,carry=0;
for(i = COUNT-1;i>=0;i--)
sum[i] = 0;
carry = 0;
sum[i] = 1;
carry = 0;
sum[i] = 1;
carry = 0;
sum[i] = 0;
carry = 1;
sum[i] = 0;
carry = 1;
sum[i] = 1;
carry = 1;
printf("+\n");
printf("--------\n");
print_bin(sum);
convertBinaryToDecimal(sum);
int c=0,i;
for(i=0;i<8;i++)
c*=2;
c=c+a[i];
}
printf("the result in decimal is %d",c);
}
Output :-
Q5) Write a C program to arrange integer in the array so that all negative integers
precede all positive integers .
Code:-
#include <stdio.h>
void main()
int i, j, a, n, number[30];
scanf("%d", &n);
scanf("%d", &number[i]);
a = number[i];
number[i] = number[j];
number[j] = a;
printf("After arrange all the integers (All -ve integers preced all +ve integers) => ");
Output :-