0% found this document useful (0 votes)
13 views9 pages

INFO 0104 Group Assignment

Uploaded by

Rashad Mohammed
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
13 views9 pages

INFO 0104 Group Assignment

Uploaded by

Rashad Mohammed
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 9

INFO-0104

S. Mohammed
Group members: Nandi Maharaj- 20210709
Darren Barban- 20220672
Rashad Mohammed- 20220575
Assignment: Write a program in C to calculate the four rules of fractions
using modular programming and LCM.
IPO CHART
Input Processing Output
1) Enter numerator 1) Find GCD 1) Print addition
and denominator between both results
values for both numbers 2) Print
numbers
2) Calculate LCM subtraction
results
3) Print
multiplication
results
4) Print division
results
Program
#include <stdio.h>
#include <math.h>
#include <conio.h>

// Function to find GCD of two numbers


int find_gcd(int a, int b)
{

int gcd;
int i;

for(i=1; i <= a && i <= b; ++i)


{
// Checks if i is factor of both integers
if(a%i==0 && b%i==0)
gcd = i;
}

return gcd;
}
// Function to find LCM of two numbers
int find_lcm(int a, int b)
{
int gcd = find_gcd(a, b);
return (a * b) / gcd;
}

int add_fractions(int a, int b, int c, int d)


{

int lcm = find_lcm(a, b);


int gcd = find_gcd(a, b);

int num3 = (c)*(lcm/a)+(d)*(lcm/b);

return num3;

int subtracting_fractions(int a, int b, int c, int d)


{
int lcm = find_lcm(a, b);
int gcd = find_gcd(a, b);

int num4 = c*(lcm/a)-d*(lcm/b);

return num4;

}
int multiplication_fractions (int a,int b, int c,int d)
{
int lcm = find_lcm(a,b);
int gcd = find_gcd(a,b);

int num5 = c*(lcm/a)*(lcm/b);

return num5;
}

int division_fractions(int a,int b,int c,int d)


{
int lcm = find_lcm(a,b);
int gcd = find_gcd(a,b);
int num6 = c*(lcm/a)/(lcm/b);

return num6;
}

int main(void) {

//declaring variables
int num1;
int denom1;
int num2;
int denom2;
int i;
int lcm;
int gcd;
int adding;

// Read two numbers from user


printf("Enter the 1st numerator: ");
scanf("%d",&num1);
printf("Enter the 1st denominator : ");
scanf("%d",&denom1);

printf("Enter the 2nd numerator: ");


scanf("%d",&num2);

printf("Enter the 2nd denominator : ");


scanf("%d",&denom2);

lcm = find_lcm(denom1, denom2);


gcd = find_gcd(denom1, denom2);
adding = add_fractions(denom1, denom2, num1 ,num2);
int sub = subtracting_fractions(denom1, denom2, num1
,num2);
int multiplying =
multiplication_fractions(denom1,denom2,num1,num2);
int dividing = division_fractions(denom1,denom2,num1,num2);

// Display the LCM


printf("\nLCM is %d", lcm);
printf("\ngcd : %d",gcd);
printf("\n subtraction:%d/%d",sub,lcm); //displays
subtraction results
printf("\n addition:%d/%d",adding,lcm); //displays addition
results
printf("\n multiplication:%d/%d",multiplying,lcm); //displays
multiplication results
printf("\n division:%d/%d", dividing,lcm); //displays division
results

getch();
return 0;
} //end main
Output screen

You might also like