1.
Define Array and Explain Declaration and Initialization with Example Program
Definition:
An array is a collection of variables of the same data type stored in contiguous memory locations.
It allows storing multiple values under a single name, accessible using an index.
Declaration and Initialization:
- Declaration: Syntax: data_type array_name[size];
Example: int arr[5];
- Initialization: Syntax: data_type array_name[size] = {value1, value2, ..., valueN};
Example: int arr[5] = {10, 20, 30, 40, 50};
Example Program:
#include <stdio.h>
int main() {
int arr[5] = {10, 20, 30, 40, 50};
printf("Array elements are: ");
for (int i = 0; i < 5; i++) {
printf("%d ", arr[i]);
return 0;
2. C Program to Find Sum of All Elements of an Array
#include <stdio.h>
int main() {
int arr[5], sum = 0;
printf("Enter 5 elements: ");
for (int i = 0; i < 5; i++) {
scanf("%d", &arr[i]);
sum += arr[i];
printf("Sum of all elements: %d\n", sum);
return 0;
3. C Program to Print Even Elements Present in an Array
#include <stdio.h>
int main() {
int arr[5];
printf("Enter 5 elements: ");
for (int i = 0; i < 5; i++) {
scanf("%d", &arr[i]);
printf("Even elements are: ");
for (int i = 0; i < 5; i++) {
if (arr[i] % 2 == 0) {
printf("%d ", arr[i]);
return 0;
}
4. C Program to Find Smallest Element in Array and Its Position
#include <stdio.h>
int main() {
int arr[5], min, pos;
printf("Enter 5 elements: ");
for (int i = 0; i < 5; i++) {
scanf("%d", &arr[i]);
min = arr[0];
pos = 0;
for (int i = 1; i < 5; i++) {
if (arr[i] < min) {
min = arr[i];
pos = i;
printf("Smallest element: %d, Position: %d\n", min, pos);
return 0;
5. C Program to Merge Two One-Dimensional Arrays
#include <stdio.h>
int main() {
int arr1[3], arr2[3], merged[6];
printf("Enter 3 elements for first array: ");
for (int i = 0; i < 3; i++) {
scanf("%d", &arr1[i]);
merged[i] = arr1[i];
printf("Enter 3 elements for second array: ");
for (int i = 0; i < 3; i++) {
scanf("%d", &arr2[i]);
merged[i + 3] = arr2[i];
printf("Merged array: ");
for (int i = 0; i < 6; i++) {
printf("%d ", merged[i]);
return 0;
6. C Program to Subtract Two One-Dimensional Arrays
#include <stdio.h>
int main() {
int arr1[5], arr2[5], result[5];
printf("Enter 5 elements for first array: ");
for (int i = 0; i < 5; i++) scanf("%d", &arr1[i]);
printf("Enter 5 elements for second array: ");
for (int i = 0; i < 5; i++) scanf("%d", &arr2[i]);
for (int i = 0; i < 5; i++) result[i] = arr1[i] - arr2[i];
printf("Resultant array after subtraction: ");
for (int i = 0; i < 5; i++) printf("%d ", result[i]);
return 0;
}
7. C Program to Arrange Numbers in Ascending Order Using Bubble Sort
#include <stdio.h>
int main() {
int n, arr[100], temp;
printf("Enter number of elements: ");
scanf("%d", &n);
printf("Enter %d elements: ", n);
for (int i = 0; i < n; i++) scanf("%d", &arr[i]);
for (int i = 0; i < n - 1; i++) {
for (int j = 0; j < n - i - 1; j++) {
if (arr[j] > arr[j + 1]) {
temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
printf("Array in ascending order: ");
for (int i = 0; i < n; i++) printf("%d ", arr[i]);
return 0;
8. C Program to Copy Elements of One Array to Another
#include <stdio.h>
int main() {
int arr1[5], arr2[5];
printf("Enter 5 elements for the first array: ");
for (int i = 0; i < 5; i++) scanf("%d", &arr1[i]);
for (int i = 0; i < 5; i++) arr2[i] = arr1[i];
printf("Copied array: ");
for (int i = 0; i < 5; i++) printf("%d ", arr2[i]);
return 0;
9. C Program to Search Key Element Using Linear Search
#include <stdio.h>
int main() {
int arr[5], key, found = 0;
printf("Enter 5 elements: ");
for (int i = 0; i < 5; i++) scanf("%d", &arr[i]);
printf("Enter key to search: ");
scanf("%d", &key);
for (int i = 0; i < 5; i++) {
if (arr[i] == key) {
printf("Key found at position %d\n", i);
found = 1;
break;
if (!found) printf("Key not found\n");
return 0;
}
10. C Program to Search Key Element Using Binary Search
#include <stdio.h>
int main() {
int n, arr[100], key, low, high, mid;
printf("Enter number of elements: ");
scanf("%d", &n);
printf("Enter %d elements in sorted order: ", n);
for (int i = 0; i < n; i++) scanf("%d", &arr[i]);
printf("Enter key to search: ");
scanf("%d", &key);
low = 0, high = n - 1;
while (low <= high) {
mid = (low + high) / 2;
if (arr[mid] == key) {
printf("Key found at position %d\n", mid);
return 0;
} else if (arr[mid] < key) low = mid + 1;
else high = mid - 1;
printf("Key not found\n");
return 0;
11. Components of User-Defined Function
A user-defined function has the following components:
1. Function declaration (prototype)
2. Function definition (body)
3. Function call
Example Program:
#include <stdio.h>
void greet() {
printf("Hello, World!\n");
int main() {
greet();
return 0;
12. Categories of User-Defined Functions
Categories:
1. No arguments and no return value
2. Arguments but no return value
3. No arguments but return value
4. Arguments and return value
Example for Category 4:
#include <stdio.h>
int add(int a, int b) {
return a + b;
int main() {
int sum = add(5, 10);
printf("Sum: %d\n", sum);
return 0;
13. C Program to Check Prime Number Using User-Defined Function
#include <stdio.h>
int is_prime(int num) {
if (num <= 1) return 0;
for (int i = 2; i <= num / 2; i++) {
if (num % i == 0) return 0;
return 1;
int main() {
int num;
printf("Enter a number: ");
scanf("%d", &num);
if (is_prime(num)) printf("%d is a prime number\n", num);
else printf("%d is not a prime number\n", num);
return 0;
14. Define Recursion and Program for Factorial Using Recursion
Recursion is a process in which a function calls itself.
Program:
#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: %d\n", factorial(num));
return 0;
15. C Program to Determine 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 number of terms: ");
scanf("%d", &n);
printf("Fibonacci series: ");
for (int i = 0; i < n; i++) {
printf("%d ", fibonacci(i));
return 0;
}
16. C Program to Find Sum of Odd Elements in an Array
#include <stdio.h>
int sum_of_odds(int arr[], int n) {
int sum = 0;
for (int i = 0; i < n; i++) {
if (arr[i] % 2 != 0) sum += arr[i];
return sum;
int main() {
int n, arr[100];
printf("Enter number of elements: ");
scanf("%d", &n);
printf("Enter %d elements: ", n);
for (int i = 0; i < n; i++) scanf("%d", &arr[i]);
printf("Sum of odd elements: %d\n", sum_of_odds(arr, n));
return 0;
