UNIT 1: BITS AND BYTES IN COMPUTING

1. Sum of Two Numbers

Write a C program that accepts two integers from the user and prints their sum.

#include <stdio.h>

int main() {
int num1, num2, sum;
printf("Enter two numbers: ");
scanf("%d %d", &num1, &num2);
sum = num1 + num2;
printf("Sum = %d\n", sum);
return 0;
}

2. Evolution of Programming Languages

Describe the evolution of programming languages from COBOL to Python. (This is more of a
theoretical exercise.)

3. Calculate Average Marks

Write a program that accepts the marks of three subjects and calculates the average.

#include <stdio.h>

int main() {
float marks1, marks2, marks3, average;
printf("Enter marks for three subjects: ");
scanf("%f %f %f", &marks1, &marks2, &marks3);
average = (marks1 + marks2 + marks3) / 3;
printf("Average = %.2f\n", average);
return 0;
}
4. Simple Interest Calculation

Write a C program to calculate simple interest given principal, rate of interest, and time.

#include <stdio.h>

int main() {
float principal, rate, time, interest;
printf("Enter principal, rate, and time: ");
scanf("%f %f %f", &principal, &rate, &time);
interest = (principal * rate * time) / 100;
printf("Simple Interest = %.2f\n", interest);
return 0;
}

5. Temperature Conversion

Write a C program to convert temperature from Fahrenheit to Celsius.

#include <stdio.h>

int main() {
float fahrenheit, celsius;
printf("Enter temperature in Fahrenheit: ");
scanf("%f", &fahrenheit);
celsius = (fahrenheit - 32) * 5.0 / 9.0;
printf("Temperature in Celsius = %.2f\n", celsius);
return 0;
}
6. Area of a Circle

Write a C program to calculate the area of a circle given its radius.

#include <stdio.h>

#define PI 3.14159

int main() {
float radius, area;
printf("Enter radius of the circle: ");
scanf("%f", &radius);
area = PI * radius * radius;
printf("Area of the circle = %.2f\n", area);
return 0;
}

7. Even or Odd

Write a C program that checks if a given integer is even or odd.

#include <stdio.h>

int main() {
int num;
printf("Enter an integer: ");
scanf("%d", &num);
if (num % 2 == 0)
printf("%d is even\n", num);
else
printf("%d is odd\n", num);
return 0;
}
8. Character to ASCII Conversion

Write a program that accepts a character from the user and prints its ASCII value.

#include <stdio.h>

int main() {
char ch;
printf("Enter a character: ");
scanf("%c", &ch);
printf("ASCII value of %c = %d\n", ch, ch);
return 0;
}

9. Basic Calculator

Write a C program to implement a basic calculator with operations like addition, subtraction,
multiplication, and division.

#include <stdio.h>

int main() {

char operator;
float num1, num2, result;
printf("Enter operator (+, -, *, /): ");
scanf(" %c", &operator);
printf("Enter two operands: ");
scanf("%f %f", &num1, &num2);

switch (operator) {
case '+': result = num1 + num2; break;
case '-': result = num1 - num2; break;
case '*': result = num1 * num2; break;
case '/': result = num1 / num2; break;
default: printf("Invalid operator!\n"); return 1;
}
printf("Result: %.2f\n", result);
return 0;
}

10. Find Largest of Three Numbers

Write a C program to find the largest of 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\n", num1);
else if (num2 >= num1 && num2 >= num3)
printf("%d is the largest\n", num2);
else
printf("%d is the largest\n", num3);

return 0;
}
UNIT 2: C: MATH BEHIND CODING

11. Factorial Using Iteration

#include <stdio.h>

int factorial(int n) {
int fact = 1;
for (int i = 1; i <= n; i++) {
fact *= i;
}
return fact;
}

int main() {
int num;
printf("Enter a number: ");
scanf("%d", &num);
printf("Factorial of %d = %d\n", num, factorial(num));
return 0;
}

12. Factorial Using Recursion

#include <stdio.h>

int factorial(int n) {
if (n == 0 || n == 1)
return 1;
return n * factorial(n - 1);
}

int main() {
int num;
printf("Enter a number: ");
scanf("%d", &num);
printf("Factorial of %d = %d\n", num, factorial(num));
return 0;
}

13. Fibonacci Series Using Iteration

#include <stdio.h>

void fibonacci(int n) {
int a = 0, b = 1, c;
printf("%d %d ", a, b);
for (int i = 2; i < n; i++) {
c = a + b;
printf("%d ", c);
a = b;
b = c;
}
}

int main() {
int n;
printf("Enter the number of Fibonacci terms: ");
scanf("%d", &n);
fibonacci(n);
return 0;
}

14. Fibonacci Series Using Recursion

#include <stdio.h>

int fibonacci(int n) {
if (n == 0) return 0;
if (n == 1) return 1;
return fibonacci(n - 1) + fibonacci(n - 2);
}

int main() {
 int n;
printf("Enter the number of Fibonacci terms: ");
scanf("%d", &n);
for (int i = 0; i < n; i++) {
printf("%d ", fibonacci(i));
}
return 0;
}

15. Sum of Digits of a Number

#include <stdio.h>

int sumOfDigits(int num) {

int sum = 0;
while (num != 0) {
sum += num % 10;
num /= 10;
}
return sum;
}

int main() {
int num;
printf("Enter a number: ");
scanf("%d", &num);
printf("Sum of digits = %d\n", sumOfDigits(num));
return 0;
}
16. Check Prime Number

#include <stdio.h>

int isPrime(int n) {
if (n <= 1) return 0;
for (int i = 2; i * i <= n; i++) {
if (n % i == 0) return 0;
}
return 1;
}

int main() {
int num;
printf("Enter a number: ");
scanf("%d", &num);
if (isPrime(num)) {
printf("%d is prime\n", num);
} else {
printf("%d is not prime\n", num);
}
return 0;
}

17. Greatest Common Divisor (GCD)

#include <stdio.h>

int gcd(int a, int b) {

if (b == 0) return a;
return gcd(b, a % b);
}

int main() {
int num1, num2;
printf("Enter two numbers: ");
scanf("%d %d", &num1, &num2);
 printf("GCD = %d\n", gcd(num1, num2));
return 0;
}

18. Power of a Number

#include <stdio.h>

int power(int base, int exp) {

int result = 1;
for (int i = 0; i < exp; i++) {
result *= base;
}
return result;
}

int main() {
int base, exp;
printf("Enter base and exponent: ");
scanf("%d %d", &base, &exp);
printf("%d^%d = %d\n", base, exp, power(base, exp));
return 0;
}

19. LCM of Two Numbers

#include <stdio.h>

int gcd(int a, int b) {

return b == 0 ? a : gcd(b, a % b);
}

int lcm(int a, int b) {

return (a * b) / gcd(a, b);
}
int main() {
int num1, num2;
printf("Enter two numbers: ");
scanf("%d %d", &num1, &num2);
printf("LCM = %d\n", lcm(num1, num2));
return 0;
}

20. Palindrome Number

#include <stdio.h>

int isPalindrome(int num) {

int original = num, reverse = 0;
while (num != 0) {
reverse = reverse * 10 + num % 10;
num /= 10;
}
return original == reverse;
}

int main() {
int num;
printf("Enter a number: ");
scanf("%d", &num);
if (isPalindrome(num)) {
printf("%d is a palindrome\n", num);
} else {
printf("%d is not a palindrome\n", num);
}
return 0;
}