Assignment 2
Assignment 2
3 3 3
4 6 8
S= 23 +
2!
+ 3!
+ 4!
+ ..………………………+UPTO Nth
4. W.A.P. in C to print the following pattern:
1
12
123
1234
5. W.A.P. in C to find Armstrong number from 1 to 100.
6. W.A.P. in C to print the sum of digits of a given number.
7. W.A.P. in C to print Fibonacci series.
8. W.A.P. in C to check that given number is prime or not.
9.
10.
1
Operators and Expressions:
Expressions Evaluation:
1. X = 3/a++ - ++b * c:
makefile
a = 2, b = 3, c = 4
X = 3/2 - 4 * 4
X = 1.5 - 16
X = -14.5
makefile
a = 3, b = 3
X = 12 % 5 - 3 - 2
X = 2 - 3 - 2
X = -3
X = c << 2:
bash
c = 4
X = 4 << 2 (Left shift by 2 bits)
X = 16
X = 1 && (-4) || 7:
makefile
X = (1 && (-4)) || 7
X = (1 && 1) || 7
X = 1 || 7
X = 1
X = a++ || b | c:
makefile
5. a = 3, b = 3, c = 4
6. X = 3 || (3 | 4)
7. X = 1 || 7
8. X = 1
9.
Simple Calculator:
c
#include <stdio.h>
int main() {
char operator;
double num1, num2;
switch (operator) {
case '+':
printf("%.2lf + %.2lf = %.2lf\n", num1, num2, num1 + num2);
break;
case '-':
printf("%.2lf - %.2lf = %.2lf\n", num1, num2, num1 - num2);
break;
case '*':
printf("%.2lf * %.2lf = %.2lf\n", num1, num2, num1 * num2);
break;
case '/':
if (num2 != 0) {
printf("%.2lf / %.2lf = %.2lf\n", num1, num2, num1 / num2);
} else {
printf("Error! Division by zero.\n");
}
break;
default:
printf("Error! Invalid operator.\n");
}
return 0;
}
Sum of Series:
#include <stdio.h>
#include <math.h>
int main() {
int n;
double sum = 0;
return 0;
}
Pattern Printing:
#include <stdio.h>
int main() {
int rows;
return 0;
}
Armstrong Numbers:
#include <stdio.h>
#include <math.h>
int main() {
int n, original, remainder, result = 0;
original = n;
while (original != 0) {
remainder = original % 10;
result += pow(remainder, 3);
original /= 10;
}
if (result == n) {
printf("%d is an Armstrong number.\n", n);
} else {
printf("%d is not an Armstrong number.\n", n);
}
return 0;
}
Sum of Digits:
#include <stdio.h>
int main() {
int n, sum = 0;
while (n != 0) {
sum += n % 10;
n /= 10;
}
return 0;
}
Fibonacci Series:
#include <stdio.h>
int main() {
int n, first = 0, second = 1, next;
printf("\n");
return 0;
}
#include <stdio.h>
#include <stdbool.h>
bool isPrime(int n) {
if (n <= 1) {
return false;
}
return true;
}
int main() {
int num;
if (isPrime(num)) {
printf("%d is a prime number.\n", num);
} else {
printf("%d is not a prime number.\n", num);
}
return 0;
}