Powering the Future of Sustainable Transportation Introduction One of the biggest reasons behind Tesla's rapid growth is its network of Gigafactories. These massive manufacturing facilities are designed to produce electric vehicles (EVs), batteries, energy storage systems, and other clean-energy products at an unprecedented scale. By building Gigafactories around the world, Tesla has transformed the way vehicles and batteries are manufactured, helping accelerate the global transition to sustainable energy. What is a Gigafactory? A Gigafactory is a large-scale manufacturing facility built by Tesla, Inc. to produce batteries, electric vehicles, and energy products. The name "Gigafactory" comes from the word "gigawatt-hour," reflecting the enormous battery production capacity of these plants. Tesla's goal is to reduce manufacturing costs, increase production efficiency, and make electric vehicles more affordable for consumers worldwide. Major Tesla Gigafactorie...
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;
}