PF Rec 6a-7b
PF Rec 6a-7b
DATE:
o STEP 1: Start
o STEP 2: Initialize arr[] = {1, 2, 3, 4, 5}
o STEP 3: Set sum = 0
o STEP 4: length= sizeof(arr)/sizeof(arr[0])
o STEP 5: Set i=0. repeat STEP 6 and STEP 7 until i<length
o STEP 6: sum = sum + arr[i]
o STEP 7: i=i+1.
o STEP 8: PRINT "Sum of all the elements of an array:" by assigning sum.
o STEP 9: RETURN 0.
o STEP 10: End.
PROGRAM:
#include<stdio.h>
int main()
{
int arr[] ={1,2,3,4,5,6};
int sum =;
int length= sizeof(arr)/sizeof(arr[0]);
for (int i = 0; i < length;i++)
{
sum = sum+arr[i];
}
printf(“sum of all the elements of an array:%d”,sum);
return 0;
}
OUTPUT:
sum of all the elements of an array:21
EX.NO:6b COPY ELEMENTS OF ONE ARRAY INTO ANOTHER
DATE:
ALGORITHIM:
o STEP 1: Start
o STEP 2: Initialize arr1[] ={1, 2, 3, 4, 5}
o STEP 3: length = sizeof(arr1)/sizeof(arr1[0])
o STEP 4: Define arr2[length]
o STEP 5: set i=0. repeat STEP 6 and STEP 7 until (i<length)
o STEP 6: arr2[i] =arr1[i]
o STEP 7: i=i+1.
o STEP 8: Display elements of arr1[].
o STEP 9: set i=0. repeat step 10 and step 11 until (i<length)
o STEP 10: Print arr1[i]
o STEP 11: i=i+1.
o STEP 12: Print new line.
o STEP 13: Display elements of arr2[].
o STEP 14: Set i=0. repeat step 13 until (i<length)
o STEP 15: Print arr2[i].
o STEP 16: i=i+1.
o STEP 17: RETURN 0.
o STEP 18: End
PROGRAM:
#include <stdio.h>
int main()
{
int arr1[] = {1, 2, 3, 4, 5};
int length = sizeof(arr1)/sizeof(arr1[0]);
int arr2[length];
for (int i = 0; i < length; i++)
{
arr2[i] = arr1[i];
}
printf("Elements of original array: \n");
for (int i = 0; i < length; i++) {
printf("%d ", arr1[i]);
}
printf("\n");
printf("Elements of new array: \n");
for (int i = 0; i < length; i++)
{
printf("%d ", arr2[i]);
}
return 0;
}
OUTPUT:
Elements of original array
12345
Elements of new array
12345
RESULT: The elements of the array is copied
DATE:
o STEP 1: Start
o STEP 2: Initialize arr[] = {1, 2, 3, 4, 5}
o STEP 3: length= sizeof(arr)/sizeof(arr[0])
o STEP 4: Print "Original Array:"
o STEP 5: Repeat STEP 6 and STEP 7 UNTIL i<length
o STEP 6: Print arr[i]
o STEP 7: i=i+1
o STEP 8: Print new line.
o STEP 9: Print "Array in reverse order"
o STEP 10: Set i=length-1. Repeat STEP 11 and STEP 12 UNTIL i>=0
o STEP 11: Print a[i]
o STEP 12: i=i-1
o STEP 13: RETURN 0.
o STEP 14: End
PROGRAM:
#include <stdio.h>
int main() {
int arr[] = {1, 2, 3, 4, 5};
int length = sizeof(arr)/sizeof(arr[0]);
printf("Original array: \n");
s1[length] = '\0';
printf("After concatenation: ");
puts(s1);
return 0;
}
OUTPUT:
After concatenation: GoodDay
EX.NO: 7b CHECK IF THE GIVEN NUMBER IS A PALINDROME OR NOT
DATE:
ALGORITHM:
INPUT:
#include <stdio.h>
#include <string.h>
int checkpalindrome(char*s)
int i,c=0,n;
n=strlen(s);
for(i=0;i<n/2;i++)
if(s[i]==s[n-i-1])
c++;
if(c==i)
return 1;
else
return 0;
int main()
char s[1000];
if(checkpalindrome(s)){
printf("string is palindrome");
else{
OUTPUT:
string is palindrome