Cloud Computing in Engineering Workflows: Transforming Design, Collaboration, and Innovation In today’s fast-paced engineering landscape, the need for speed, scalability, and seamless collaboration is greater than ever. Traditional engineering workflows often relied on on-premises servers, powerful local machines, and fragmented communication tools. But as projects grow in complexity and teams become more global, these systems can no longer keep up. This is where cloud computing steps in—reshaping how engineers design, simulate, collaborate, and deliver results. What is Cloud Computing in Engineering? Cloud computing refers to the use of remote servers hosted on the internet to store, process, and analyze data. Instead of being limited by the hardware capacity of a single computer or office server, engineers can leverage vast, scalable computing resources from cloud providers. This shift enables engineers to run simulations, share designs, and manage data more efficiently. Key Be...
1) Hello World Program:
#include<stdio.h>
int main()
{
printf("Hello, World!");
return 0;
}
2) Program to Add Two Numbers:
#include<stdio.h>
int main()
{
int num1, num2, sum;
printf("Enter two numbers: ");
scanf("%d %d", &num1, &num2);
sum = num1 + num2;
printf("Sum = %d", sum);
return 0;
}
3) Program to Find Factorial of a Number:
#include<stdio.h>
int main()
{
int num, i, fact=1;
printf("Enter a number: ");
scanf("%d", &num);
for(i=1; i<=num; i++)
{
fact *= i;
}
printf("Factorial of %d = %d", num, fact);
return 0;
}
4) Program to Check Whether a Number is Prime or Not:
#include<stdio.h>
int main()
{
int num, i, flag=0;
printf("Enter a number: ");
scanf("%d", &num);
for(i=2; i<=num/2; i++)
{
if(num%i == 0)
{
flag = 1;
break;
}
}
if(flag == 0)
printf("%d is a prime number", num);
else
printf("%d is not a prime number", num);
return 0;
}
5) Program to Find the Largest Number Among Three Numbers:
#include<stdio.h>
int main()
{
int num1, num2, num3;
printf("Enter three numbers: ");
scanf("%d %d %d", &num1, &num2, &num3);
if(num1 > num2 && num1 > num3)
printf("%d is the largest number", num1);
else if(num2 > num1 && num2 > num3)
printf("%d is the largest number", num2);
else
printf("%d is the largest number", num3);
return 0;
}
6) Program to Find the Factorial of a Number Using Recursion:
#include<stdio.h>
int factorial(int num);
int main()
{
int num;
printf("Enter a number: ");
scanf("%d", &num);
printf("Factorial of %d = %d", num, factorial(num));
return 0;
}
int factorial(int num)
{
if(num == 0)
return 1;
else
return num * factorial(num-1);
}
7) Program to Print Fibonacci Series:
#include<stdio.h>
int main()
{
int num, i, t1=0, t2=1, nextTerm;
printf("Enter the number of terms: ");
scanf("%d", &num);
printf("Fibonacci Series: ");
for(i=1; i<=num; i++)
{
printf("%d, ", t1);
nextTerm = t1 + t2;
t1 = t2;
t2 = nextTerm;
}
return 0;
}
8) Program to Convert Celsius to Fahrenheit
#include <stdio.h>
int main() {
float celsius, fahrenheit;
printf("Enter temperature in Celsius: ");
scanf("%f", &celsius);
fahrenheit = (celsius * 1.8) + 32;
printf("%.2f Celsius = %.2f Fahrenheit", celsius, fahrenheit);
return 0;
}
9) Program to Check Whether a Number is Armstrong or Not:
#include<stdio.h>
#include<math.h>
int main()
{
int num, originalNum, remainder, n=0;
float result=0.0;
printf("Enter an integer: ");
scanf("%d", &num);
originalNum = num;
while(originalNum != 0)
{
originalNum /= 10;
++n;
}
originalNum = num;
while(originalNum != 0)
{
remainder = originalNum % 10;
result += pow(remainder, n);
originalNum /= 10;
}
if((int)result == num)
printf("%d is an Armstrong number.", num);
else
printf("%d is not an Armstrong number.", num);
return 0;
}
10) Program to Find the Reverse of a Number:
#include<stdio.h>
int main()
{
int num, reverse=0, remainder;
printf("Enter an integer: ");
scanf("%d", &num);
while(num != 0)
{
remainder = num % 10;
reverse = reverse * 10 + remainder;
num /= 10;
}
printf("Reverse of the number = %d", reverse);
return 0;
}