Question

C Programming Language only please. Your help is greatly appreciated. Will give thumbs up for quality work.
Lab 8 (this is to be turned in) Palindrome is a string that is the same as backwards or forwards “otto” “ababa” “noon” “ababbbbaba” In this lab we will work with strings (so we will be using character arrays). 1. Write a program that reads two strings strl and str2 from the keyboard 2. Print both strings 3. Write a function computeLength and call this function in main to compute the length of the string strl and str2. 4. if the string strl is of length 1 the program will terminate 5. if the string str2 is of length 0 the program will terminate Next A prefix of a string is a nonempty string that is an initial segment Example “moondog” has prefixes of “moo”, “m”, “moon”, “mo”, “moond”,. 6. Write a function isPrefix (str1, str2) that returns 1 if the string str2 is a prefix of strl substring of strl then isPrefix should return a ONE , if not return a ZERO. See class discussion for the definition 7. Call this function with strl and str2 in main and output your result 8. Now write a function isPalindrome(str) that returns a l if str is a palindrome and 0 otherwise. To get full credit use isPrefix in your function 9. Call your function is Palindrome (str1) 10. Output the correct conclusion either PALINDROME or NOT PALINDROME You are NOT to use any standard library functions except for I/O functions.

Answer 1

#include<stdio.h>
//method to find lenght of str
int computeLength(char *str)
{
   int i=0;
   while(str[i]!='\0')//runs upto end of the string
   i++;
   return i;//returning length
}

//method to find prefix
int isPrefix(char *str1,char *str2)
{
   int i=0;
   while(str2[i]!='\0')
   {
       if(str1[i]==str2[i])
       i++;  
       else
       break;//if not prefix
   }
   int n= computeLength(str2);
   if(i==n)//means prefix
   return 1;
   return 0;//other wise returning 0
}

int isPalindrome(char *str)
{
   int n =computeLength(str);
   int i=0,j=n-1;
   while(i<n)
   {
       if(str[i]==str[j])
       {
           i++;
           j--;
              
       }
       else break;  
   }
   if(i==n)return 1;//if palindrome
   return 0;
}

int main()
{
   char str1[100],str2[100];
  
  
   printf("Enter string 1:");
   scanf("%s",str1);
  
   if(computeLength(str1)<=1)
   return 0;//terminations program if length =1

   printf("Enter string 2:");
   scanf("%s",str2);
  
   if(computeLength(str2)==0)
   return 0;//terminations program if length =1  
  
  
   if(isPrefix(str1,str2)==1)printf("Prefix\n");
   else printf("Not a prefix\n");
  
   if(isPalindrome(str1)==1)printf("Palindrome\n");
   else printf("Not a palindrome\n");
  
   return 0;
}

output:

Enter string 1:amma
Enter string 2:am
Prefix
Palindrome

Process exited normally.
Press any key to continue . . .