0% found this document useful (0 votes)
2 views

Assignment

The document contains a series of C programming tasks designed for a computer fundamentals lab. Each task includes a description and corresponding code to perform operations such as calculating sums, counting even and odd numbers, finding the smallest and largest numbers, reversing arrays, splitting arrays, modifying arrays, counting prime numbers, and identifying the second largest and smallest numbers. The document serves as a practical guide for students to apply their programming skills in various scenarios.

Uploaded by

MAHAM ALI
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
2 views

Assignment

The document contains a series of C programming tasks designed for a computer fundamentals lab. Each task includes a description and corresponding code to perform operations such as calculating sums, counting even and odd numbers, finding the smallest and largest numbers, reversing arrays, splitting arrays, modifying arrays, counting prime numbers, and identifying the second largest and smallest numbers. The document serves as a practical guide for students to apply their programming skills in various scenarios.

Uploaded by

MAHAM ALI
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 15

PAKISTAN INSTITUTE OF ENGINEERING AND APPLIED SCIENCES

COMPUTER FUNDAMENTALS LAB


LAB 10

Submitted by:
Syeda Maham Ali

11-3-046-2020

BSChE (20-24)
Task 1
Create a C program, to calculate sum of 10 numbers given by user , must use array

Code:
#include <stdio.h>

int main()

int numbers[10];

int sum = 0;

//User to enter 10 numbers


printf("Enter 10 numbers:\n");

// Loop to read numbers into array

for (int i = 0; i < 10; i++)

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

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

}
// Loop to calculate sum of numbers

for (int i = 0; i < 10; i++)

sum += numbers[i];

// Displaying sum

printf("The sum of the 10 numbers is: %d\n", sum);


return 0;

}
Output:

Task 2
Create a C program in which take array of 10 numbers and take user inputs. Count how
many numbers are even or odd.

Code:
#include <stdio.h>

int main()

int numbers[10];

int even_count = 0;
int odd_count = 0;

// User to enter 10 numbers


printf("Enter 10 numbers:\n");

// Loop to read numbers into array

for (int i = 0; i < 10; i++)

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


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

// Loop to count even and odd numbers

for (int i = 0; i < 10; i++)


{
if (numbers[i] % 2 == 0)

even_count++;

} else
{

odd_count++;

// Displaying count of even and odd numbers

printf("The count of even numbers is: %d\n", even_count);

printf("The count of odd numbers is: %d\n", odd_count);


return 0;
}

Output:

Task 3
Create a C program to take array of size n, where n is taken by user. Print the smallest
and largest number.

Code:
#include <stdio.h>

int main()

{
int n;
//User to enter size of array

printf("Enter array size: ");

scanf("%d", &n);

//Declaring an array of size n


int numbers[n];

//User to enter n numbers

printf("Enter %d numbers:\n", n);

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

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

scanf("%d", &numbers[i]);
}
// Initializing smallest and largest with first element of array

int smallest = numbers[0];

int largest = numbers[0];

// Loop to find smallest and largest numbers

for (int i = 1; i < n; i++)

if (numbers[i] < smallest)


{

smallest = numbers[i];

Output:
Task 4
Create a C program to take array of 10 numbers and reverse it.

Code:
#include <stdio.h>

int main()

int numbers[10];
int reversed[10];

// User to enter 10 numbers

printf("Enter 10 numbers:\n");

for (int i = 0; i < 10; i++)


{

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

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

// Loop to reverse array

for (int i = 0; i < 10; i++)

reversed[i] = numbers[10 - 1 - i];

// Displaying reversed array

printf("Reversed array is:\n");


for (int i = 0; i < 10; i++)

printf("%d ", reversed[i]);

printf("\n");

return 0;
}
Output:

Task 5
Create a C program in which you split the array in two equal size , if array size is not
even, then one array can be +1 larger of size.

Code:
#include <stdio.h>

int main()
{

int n;

// User to enter the size of array

printf("Enter the size of the array: ");

scanf("%d", &n);

// Declare array of size n

int numbers[n];

// User to enter n numbers


printf("Enter %d numbers:\n", n);

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

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

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

// Determine sizes of subarrays


int size1 = n / 2;
int size2 = n - size1;

// Declare two subarrays

int first_half[size1];

int second_half[size2];
// Split array into halves

for (int i = 0; i < size1; i++)

first_half[i] = numbers[i];

for (int i = 0; i < size2; i++)

{
second_half[i] = numbers[size1 + i];
}

// Display two subarrays

printf("First half of the array:\n");

for (int i = 0; i < size1; i++)

printf("%d ", first_half[i]);

}
printf("\n");

printf("Second half of the array:\n");

for (int i = 0; i < size2; i++)

printf("%d ", second_half[i]);

printf("\n");
return 0;

}
Output:

Task 6
Create array {1,8,10,29,289,010,102,2092,2021}. Replace all even index with 0 . Don’t take
user input.

Code:
#include <stdio.h>
int main()

// Initialize array with specified values

int numbers[] = {1, 8, 10, 29, 289, 010, 102, 2092, 2021};

int size = sizeof(numbers) / sizeof(numbers[0]);

// Replace all elements at even indices with 0

for (int i = 0; i < size; i += 2)

{
numbers[i] = 0;

// Print modified array

printf("Modified array:\n");

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

printf("%d ", numbers[i]);

}
printf("\n");

return 0;
}
Output:

Task 7
Create a C program, in which take 10 numbers from user and check total number of prime
numbers.

Code:
#include <stdio.h>

int main()

int numbers[10];

int prime_count = 0;

// User to enter 10 numbers

printf("Enter 10 numbers:\n");
for (int i = 0; i < 10; i++)

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

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

// Check each number for primality

for (int i = 0; i < 10; i++)


{

int num = numbers[i];

int is_prime = 1; // Assume the number is prime

if (num <= 1)

is_prime = 0; // Numbers less than or equal to 1 are not prime

}
else
{
for (int j = 2; j * j <= num; j++)

if (num % j == 0)

{
is_prime = 0; // Found a divisor, not prime

break;

if (is_prime)

{
prime_count++;
}

// Display count of prime numbers

printf("Total number of prime numbers is: %d\n", prime_count);

return 0;

Output:

Task 8
Create a C program, in which you need to print the second largest number of the array

Code:
#include <stdio.h>
int main()

int n;

// User to enter the size of the array


printf("Enter size of array: ");

scanf("%d", &n);

// Declare array of size n

int numbers[n];

// User to enter n numbers

printf("Enter %d numbers:\n", n);

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


{
printf("Enter number %d: ", i + 1);

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

// Initializing largest and second largest to smallest possible integer

int largest = numbers[0];

int second_largest = numbers[0];

// Loop to find largest and second largest numbers


for (int i = 1; i < n; i++)

if (numbers[i] > largest)

second_largest = largest;

largest = numbers[i];

}
else if (numbers[i] > second_largest && numbers[i] != largest)

{
second_largest = numbers[i];
}

printf("Second largest number is: %d\n", second_largest);

return 0;
}

Output:

Task 9
Create a C Program in which you need to print second smallest number of array

Code:
#include <stdio.h>

int main()

int n;

// Enter size of the array


printf("Enter size of array: ");

scanf("%d", &n);

// Declare array of size n

int numbers[n];
// User to enter n numbers

printf("Enter %d numbers:\n", n);

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

{
printf("Enter number %d: ", i + 1);

scanf("%d", &numbers[i]);
}
// Initializing smallest and second smallest

int smallest = numbers[0];

int second_smallest = numbers[0];

// Find initial smallest number in array


for (int i = 1; i < n; i++)

if (numbers[i] < smallest)

smallest = numbers[i];

}
// Initialize second smallest to a value larger than smallest
second_smallest = numbers[0] == smallest ? numbers[1] : numbers[0];

// Loop to find the second smallest number

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

if (numbers[i] < second_smallest && numbers[i] != smallest)

second_smallest = numbers[i];
}

printf("Second smallest number is: %d\n", second_smallest);

return 0;

Output:

You might also like