-
Notifications
You must be signed in to change notification settings - Fork 0
/
subtractinb.c
223 lines (182 loc) · 4.21 KB
/
subtractinb.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
/********* DEFINED CONSTANTS *********/
#define MAX 32
/********* FUNCTION DECLARATION *********/
void menu(int format[]);
void reverse(char *str);
void onecom(char *bi1, char *bi2, int format[], int len1, int len2, int sum[], int b);
void twocom(int sum[], int len, int format[], int b);
/********* MAIN STARTS HERE *********/
int main(void)
{
int len1, len2, b;
int format[MAX], sum[MAX];
char bi1[MAX], bi2[MAX];
menu(format);
printf("Enter the first value:- ");
scanf("%s", bi1);
printf("Enter the second value:- ");
scanf("%s", bi2);
printf("Enter the base:- ");
scanf("%d", &b);
len1 = strlen(bi1);
len2 = strlen(bi2);
if (strlen(bi1) != strlen(bi2))
{
printf("The binary values should contain equal no. of digits.\n");
exit(1);
}
else if (len1 > 32 || len2 > 32 )
{
printf("The no. of digits of the binary values should be <= 32.\n");
exit(2);
}
onecom(bi1, bi2, format, len1, len2, sum, b);
twocom(sum, len1, format, b);
exit(0);
}
/********* FUNCTION DEFINITION *********/
void menu(int format[])
{
int opt;
printf("In which type of notation should I take the first binary value?\n");
printf(" 1) Big Endian\n");
printf(" 2) Little Endian\n");
printf("Your option please: ");
scanf("%d", &opt);
if (opt < 1 || opt > 2)
{
printf("Select the options which are given above\n");
exit(1);
}
format[0] = opt;
printf("In which type of notation should I take the second binary value?\n");
printf(" 1) Big Endian\n");
printf(" 2) Little Endian\n");
printf("Your option please: ");
scanf("%d", &opt);
if (opt < 1 || opt > 2)
{
printf("Select the options which are given above\n");
exit(1);
}
format[1] = opt;
printf("In which type of notation should I represent the sum?\n");
printf(" 1) Big Endian\n");
printf(" 2) Little Endian\n");
printf("Your option please: ");
scanf("%d", &opt);
if (opt < 1 || opt > 2)
{
printf("Select the options which are given above\n");
exit(1);
}
format[2] = opt;
system("clear");
return ;
}
void onecom(char *bi1, char *bi2, int format[], int len1, int len2, int sum[], int b)
{
int i = 0, x1, x2, carry = 0, base;
base = b + 48;
if (format[0] == 2)
{
reverse(bi1);
}
if (format[1] == 2)
{
reverse(bi2);
}
while (*bi1 != '\0' && *bi2 != '\0')
{
if ((*bi1 >= '0' && *bi1 < base) && (*bi2 >= '0' && *bi2 < base))
{
x1 = (int)(*bi1 - '0');
x2 = (b-1) - (int)(*bi2 - '0');
if (x1 + x2 + carry < b)
{
sum[i] = x1 + x2 + carry;
carry = 0;
}
else
{
sum[i] = (x1 + x2 + carry)%b;
carry = 1;
}
}
else
{
printf("This is an Invalid string with base %d\n", b);
exit(5);
}
i++;
bi1++;
bi2++;
}
return ;
}
void twocom(int sum[], int len, int format[], int b)
{
int i = 0, x1, x2, carry = 0, j;
int one[MAX], diff[MAX];
one[i] = 1;
for (i = 1; i < len; i++)
{
one[i] = 0;
}
i = 0;
while (i < len)
{
x1 = sum[i];
x2 = one[i];
if (x1 + x2 + carry < b)
{
diff[i] = x1 + x2 + carry;
carry = 0;
}
else
{
diff[i] = (x1 + x2 + carry)%b;
carry = 1;
}
i++;
}
if (format[2] == 1)
{
if (carry == 1)
{
printf("1");
}
for (j = 0; j < i; j++)
{
printf("%d", diff[j]);
}
printf(" is the resultant string in BIG ENDIAN Notation.\n");
}
else if (format[2] == 2)
{
if (carry == 1)
{
diff[i] = 1;
}
for (j = i; j >= 0; j--)
{
printf("%d", diff[j]);
}
printf(" is the resultant string in LITTLE ENDIAN Notation.\n");
}
return ;
}
void reverse(char *str)
{
int c, i, j;
for (i = 0, j = strlen(str) - 1; i < j; i++, j--)
{
c = str[i];
str[i] = str[j];
str[j] = c;
}
return ;
}