Program 1
Program 1
Program 1
#include<conio.h>
int main() {
printf("Hello, World!\n");
return 0;
OUTPUT
:-
int main() {
int num1, num2, sum;
printf("Enter the first number: ");
scanf("%d", &num1);
return 0;
}
OUTPUT
98 cppm het kotadiya
int main() {
float principal, rate, time, simpleInterest;
return 0;
}
OUTPUT
int main() {
int number;
printf("Enter an integer: ");
scanf("%d", &number);
98 cppm het kotadiya
if (number % 2 == 0) {
printf("%d is an even number.\n", number);
} else {
printf("%d is an odd number.\n", number);
}
return 0;
}
OUTPUT
int main() {
int i;
for (i = 1; i <= 10; i++) {
printf("%d\n", i);
}
return 0;
}
OUTPUT
#include <conio.h>
int main() {
int number, i;
return 0;
}
OUTPUT
98 cppm het kotadiya
int main() {
int i, j;
printf("\n");
}
return 0;
}
OUTPUT
int main() {
int i, j;
return 0;
}
OUTPUT
int main() {
int i, j;
for (i = 3; i >= 1; i--) {
for (j = 1; j <= i; j++) {
printf("*");
}
printf("\n");
}
return 0;
}
OUTPUT
#include<conio.h>
int main() {
int i, j;
int rows = 5;
printf("*");
if (i < rows - 1) {
printf("*");
}
98 cppm het kotadiya
printf("\n");
}
return 0;
}
OUTPUT
int rows = 3;
98 cppm het kotadiya
return 0;
}
OUTPUT
#include<conio.h>
int main() {
int number;
return 0;
}
OUTPUT
98 cppm het kotadiya
#include <stdio.h>
#include <conio.h>
int main() {
int number;
return 0;
}
OUTPUT
int main() {
float width, height;
scanf("%f", &width);
return 0;
}
OUTPUT
#include<conio.h>
int main() {
float base, height;
return 0;
}
OUTPUT
98 cppm het kotadiya
int main() {
int number, i;
int isPrime = 1;
if (number <= 1) {
isPrime = 0;
} else {
98 cppm het kotadiya
if (isPrime) {
printf("%d is a prime number.\n", number);
} else {
printf("%d is not a prime number.\n",
number);
}
return 0;
}
OUTPUT
98 cppm het kotadiya
original_num = num;
while (original_num != 0) {
original_num /= 10;
num_digits++;
}
98 cppm het kotadiya
original_num = num;
while (original_num != 0) {
remainder = original_num % 10;
result += pow(remainder, num_digits);
original_num /= 10;
}
if (result == num) {
return 1;
} else {
return 0;
}
}
int main() {
int number;
if (is_armstrong_number(number)) {
98 cppm het kotadiya
return 0;
}
OUTPUT
while (num != 0) {
remainder = num % 10;
reversed_num = reversed_num * 10 +
remainder;
num /= 10;
}
if (original_num == reversed_num) {
return 1;
} else {
return 0;
}
}
int main() {
int number;
98 cppm het kotadiya
if (is_palindrome_number(number)) {
printf("%d is a palindrome number.\n",
number);
} else {
printf("%d is not a palindrome number.\n",
number);
}
return 0;
}
OUTPUT
98 cppm het kotadiya
int main() {
int terms;
fibonacci_series(terms);
return 0;
}
OUTPUT
int main() {
int n, i;
unsigned long long factorial = 1;
scanf("%d", &n);
if (n < 0)
printf("Factorial of a negative number doesn't
exist.\n");
else {
for (i = 1; i <= n; ++i) {
factorial *= i;
}
printf("Factorial of %d = %llu\n", n, factorial);
}
return 0;
}
OUTPUT
98 cppm het kotadiya
#include <stdio.h>
#include<conio.h>
int main() {
int a, b, temp;
temp = a;
a = b;
b = temp;
return 0;
}
OUTPUT
98 cppm het kotadiya
int main() {
int a, b;
a = a + b;
b = a - b;
a = a - b;
return 0;
}
OUTPUT
int main() {
char ch;
scanf("%c", &ch);
if (isdigit(ch))
printf("'%c' is a digit.\n", ch);
else if (isalpha(ch))
printf("'%c' is an alphabet.\n", ch);
else
printf("'%c' is a special character.\n", ch);
return 0;
}
OUTPUT
#include <conio.h>
int main() {
int i = 1, sum = 0;
return 0;
}
OUTPUT
98 cppm het kotadiya
#include <stdio.h>
#include <conio.h>
int main() {
char ch;
return 0;
}
OUTPUT
int main() {
int num1, num2, choice;
printf("Menu:\n");
printf("1. Addition\n");
printf("2. Subtraction\n");
printf("3. Multiplication\n");
printf("Enter your choice (1-3): ");
98 cppm het kotadiya
scanf("%d", &choice);
switch (choice) {
case 1:
printf("Result: %d + %d = %d\n", num1,
num2, num1 + num2);
break;
case 2:
printf("Result: %d - %d = %d\n", num1,
num2, num1 - num2);
break;
case 3:
printf("Result: %d * %d = %d\n", num1,
num2, num1 * num2);
break;
default:
printf("Invalid choice.\n");
}
return 0;
98 cppm het kotadiya
}
OUTPUT
int main() {
int choice;
int num;
double radius, length, width, base, height;
while (1) {
printf("\nMenu:\n");
printf("1. Fibonacci Series\n");
printf("2. Factorial Number\n");
printf("3. Prime Number Check\n");
printf("4. Palindrome Number Check\n");
printf("5. Armstrong Number Check\n");
printf("6. Area of Circle\n");
printf("7. Area of Rectangle\n");
printf("8. Area of Triangle\n");
printf("9. Exit\n");
printf("Enter your choice (1-9): ");
scanf("%d", &choice);
98 cppm het kotadiya
switch (choice) {
case 1:
printf("Enter the number of terms for
Fibonacci series: ");
scanf("%d", &num);
fibonacci_series(num);
break;
case 2:
printf("Enter a number to find its
factorial: ");
scanf("%d", &num);
printf("Factorial of %d is %llu\n", num,
factorial(num));
break;
case 3:
printf("Enter a number to check if it is
prime: ");
scanf("%d", &num);
if (is_prime(num)) {
98 cppm het kotadiya
case 4:
printf("Enter a number to check if it is a
palindrome: ");
scanf("%d", &num);
if (is_palindrome(num)) {
printf("%d is a palindrome number.\n",
num);
} else {
printf("%d is not a palindrome
number.\n", num);
}
break;
case 5:
printf("Enter a number to check if it is an
Armstrong number: ");
98 cppm het kotadiya
scanf("%d", &num);
if (is_armstrong(num)) {
printf("%d is an Armstrong number.\n",
num);
} else {
printf("%d is not an Armstrong
number.\n", num);
}
break;
case 6:
printf("Enter the radius of the circle: ");
scanf("%lf", &radius);
printf("Area of the circle: %.2lf\n",
area_of_circle(radius));
break;
case 7:
printf("Enter the length and width of the
rectangle: ");
scanf("%lf %lf", &length, &width);
printf("Area of the rectangle: %.2lf\n",
area_of_rectangle(length, width));
98 cppm het kotadiya
break;
case 8:
printf("Enter the base and height of the
triangle: ");
scanf("%lf %lf", &base, &height);
printf("Area of the triangle: %.2lf\n",
area_of_triangle(base, height));
break;
case 9:
printf("Exiting...\n");
return 0;
default:
printf("Invalid choice. Please select a
number between 1 and 9.\n");
break;
}
}
return 0;
}
98 cppm het kotadiya
void fibonacci_series(int n) {
int first = 0, second = 1, next;
printf("Fibonacci series up to %d terms:\n", n);
for (int i = 1; i <= n; ++i) {
if (i == 1) {
printf("%d ", first);
continue;
}
if (i == 2) {
printf("%d ", second);
continue;
}
next = first + second;
first = second;
second = next;
printf("%d ", next);
}
printf("\n");
}
98 cppm het kotadiya
int is_prime(int n) {
if (n <= 1) return 0;
if (n <= 3) return 1;
if (n % 2 == 0 || n % 3 == 0) return 0;
for (int i = 5; i * i <= n; i += 6) {
if (n % i == 0 || n % (i + 2) == 0) return 0;
}
return 1;
}
98 cppm het kotadiya
int is_palindrome(int n) {
int original = n, reversed = 0, remainder;
while (n != 0) {
remainder = n % 10;
reversed = reversed * 10 + remainder;
n /= 10;
}
return (original == reversed);
}
int is_armstrong(int n) {
int original = n, sum = 0, digit, count = 0;
while (original != 0) {
original /= 10;
count++;
}
original = n;
while (original != 0) {
digit = original % 10;
sum += pow(digit, count);
original /= 10;
98 cppm het kotadiya
}
return (sum == n);
}
int main() {
int n, i;
float sum = 0.0, average;
float marks[n];
98 cppm het kotadiya
average = sum / n;
printf("The average marks are: %.2f\n",
average);
return 0;
}
OUTPUT
98 cppm het kotadiya
int main() {
char str1[100], str2[100], result[200];
strcpy(result, str1);
strcat(result, str2);
return 0;
}
OUTPUT
int main() {
int num = 42;
98 cppm het kotadiya
*ptr = 100;
printf("Modified value of num: %d\n", num);
return 0;
}
OUTPUT
int main() {
int rows, cols;
int matrix[rows][cols];
printf("Matrix:\n");
for (int i = 0; i < rows; i++) {
for (int j = 0; j < cols; j++) {
printf("%d ", matrix[i][j]);
98 cppm het kotadiya
}
printf("\n");
}
return 0;
}
#include <stdio.h>
98 cppm het kotadiya
int main() {
int N;
if (N <= 0) {
printf("Please enter a positive integer.\n");
return 1;
}
int numbers[N];
printf("\n");
return 0;
}
OUTPUT
int main() {
int array[] = {12, 4, 56, 1, 78, 23, 45};
int n = sizeof(array) / sizeof(array[0]);
sortArray(array, n);
return 0;
}
98 cppm het kotadiya
int main() {
int array[] = {12, 4, 56, 1, 78, 23, 45};
int n = sizeof(array) / sizeof(array[0]);
sortArrayDescending(array, n);
return 0;
98 cppm het kotadiya
minIndex = j;
}
}
if (minIndex != i) {
int temp = arr[i];
arr[i] = arr[minIndex];
arr[minIndex] = temp;
}
}
}
int main() {
int array[] = {29, 10, 14, 37, 13};
int n = sizeof(array) / sizeof(array[0]);
selectionSort(array, n);
return 0;
}
return i;
}
}
return -1;
}
int main() {
int array[] = {23, 45, 12, 56, 78, 1, 90};
int n = sizeof(array) / sizeof(array[0]);
int target;
if (result != -1) {
printf("Element found at index %d\n", result);
} else {
printf("Element not found\n");
}
98 cppm het kotadiya
return 0;
}
int main() {s
98 cppm het kotadiya
char str[100];
return 0;
}