Q1

#include <stdio.h>

int fib(int n);

int main() {

int n;

printf("Enter a number: ");

scanf("%d", &n);

printf("First %d Fibonacci numbers: ", n);

for (int i = 0; i < n; i++) {

printf("%d ", fib(i));

return 0;

int fib(int n){

if (n == 0) {

return 0;

if (n == 1) {

return 1;

int fib_n1 = fib(n - 1);

int fib_n2 = fib(n - 2);

int fib_N = fib_n1 + fib_n2;

return fib_N;

OUTPUT
Q2
#include <stdio.h>

int main() {

int n;

neg_no:

printf("Enter the number:");

scanf("%d", &n);

if (n <= 0){

printf("Enter a positive number..... Skipping \n\n");

goto neg_no;

printf("Square of the number is: %d\n", n * n);

if (n % 2 == 0) {

printf("It is an even number\n");

} else {

printf("It is an odd number\n");

return 0;

negative:

return 0;

}
OUTPUT

Q3
#include <stdio.h>

int main() {
int monthSales[12];
printf("Enter each 12 month sales:\n");
for (int i = 0; i < 12; i++) {
scanf("%d", &monthSales[i]);
}

int totalSales = 0;
for (int i = 0; i < 12; i++) {
totalSales += monthSales[i];
}
float averageSales = (float)totalSales / 12;
int maxMonthSale = 1, minMonthSale = 1;
for (int i = 1; i < 12; ++i) {
if (monthSales[i] > monthSales[maxMonthSale - 1]) {
maxMonthSale = i + 1;
}
if (monthSales[i] < monthSales[minMonthSale - 1]) {
minMonthSale = i + 1;
}
}
printf("The Total Sales is %d\n", totalSales);
printf("The Average is %.2f\n", averageSales);
printf("The Month with Maximum sales is %d\n", maxMonthSale);
printf("The Month with Minimum sales is %d\n", minMonthSale);
return 0;
}

OUTPUT
Q4

#include <stdio.h>

int main() {

int n, search, found = 0;

printf("enter number of element: ");

scanf("%d", &n);

int arr[n];

for (int i = 0; i < n; i++) {

scanf("%d", &arr[i]);

printf("enter number to be searched: " );

scanf("%d", &search);

for (int i = 0; i < n; i++) {

if (arr[i] == search) {

found = 1;

break;

if (found) {

printf("Element Found\n");

} else {

printf("Element Not Found\n");

return 0;

}
OUTPUT

Q5
#include <stdio.h>

int main() {

int start_day = 1, start_month = 1, start_year = 2023;

int end_day = 31, end_month = 8, end_year = 2023;

int days_in_start_month = 31 - start_day + 1;

int total_days = days_in_start_month;

for (int month = start_month + 1; month <= end_month - 1; month++) {

switch (month) {

case 4:

case 6:

case 9:

case 11:

total_days += 30;

break;

case 2:
 if ((end_year % 4 == 0 && end_year % 100 != 0) || (end_year % 400 == 0)) {

total_days += 29;

} else {

total_days += 28;

break;

default:

total_days += 31;

total_days += end_day;

int weeks = total_days / 7;

int remaining_days = total_days % 7;

printf("Total days: %d\n", total_days);

printf("Weeks: %d\n", weeks);

printf("Remaining days: %d\n", remaining_days);

return 0;

OUTPUT
Q6
#include <stdio.h>

void return_class(int percent);

void mark(int c);

int main() {

int marks[5];

int totalM = 0;

printf("Enter five subject marks:\n");

for (int i = 0; i < 5; i++) {

printf("Subject %d: ", i + 1);

scanf("%d", &marks[i]);

totalM += marks[i];

int percent = totalM / 5.0;

return_class(percent);

return 0;

void return_class(int percent) {

int c;

if (percent < 35) {

c = 0;

} else if (percent >= 35 && percent < 45) {

c = 1;

} else if (percent >= 45 && percent < 60) {

c = 2;

} else if (percent >= 60 && percent < 70) {

c = 3;
 } else {

c = 4;

mark(c);

void mark(int c) {

switch (c) {

case 0:

printf("Fail\n");

break;

case 1:

printf("Pass Class\n");

break;

case 2:

printf("Second Class\n");

break;

case 3:

printf("First Class\n");

break;

case 4:

printf("Distinction\n");

break;

default:

printf("Invalid class\n");

}
OUTPUT

Q7(i) Q7(iii)
#include <stdio.h>
#include <stdio.h> int main() {
int main() { int n = 5;
int i,j; int i, j;
for(i=1;i<=5;i++) for (i = 1; i <= n; i++) {
for (j = 1; j <= n; j++) {
{
if (j == 1|| j == n || i == 1 || i == n) {
for(j=1;j<=i;j++) printf("* ");
{ } else {
printf("%d",i); printf(" ");
} }
printf("\n"); }
} printf("\n");
return 0; }
} return 0;
}

OUTPUT
OUTPUT
Q7 (iv) Q7(ii)
#include <stdio.h> #include <stdio.h>

int main() { int main() {

return 0; for (int j = 1; j <= i; j++) {

printf("\n");
sp--;
}
return 0;
}

OUTPUT
OUTPUT