Question

Palindromes A palindrome is a nonempty string over some alphabet that reads the same forward and backward. Examples of palindromes are all strings of length 1, civic, racecar, noon, and aibohphobia (fear of palindromes). You may assume that in the problems below, an input string is given as an array of characters. For example, input string noon is given as an array s[L.4], where s[1] = n, s[2] = o, s[3] = o, and s[4] = n. (a) (15 pts) Give a recursive algorithm that tests if the input string is a palindrome. Write down the pseudocode and use induction to prove that your algorithm correctly identifies palindromes. Analyze your algorithm's running time. (b) (15 pts) Sometimes removing a single character from the string, turns it into a palindrome. For example, if we remove 1 from the revolver, we will get a palindrome. We call such strings almost palindromes. Write down the pseudocode for an algorithm that tests if the input string is an almost palindrome. Analyze your algorithm's running time.

Answer 1

I

pallindrome -Notepad File Edit Format View Help package xyz; import java.util.*; public class Abc { public static void main(Stringl] args) String str, rev- i //array initialization //permissions to get values from user Scanner sc-new Scanner (System.in); System.out.println("Enter a string:"); str sc.nextLine ); int length - str.1ength) for ( int i-length-l; i >-8; i--) //getting the string from user /declaring a variable to store length of string /loop for storing the stringl from last element to first in string2 rev - rev str.charAt(i); if (str.equals (rev)) //to check booth strings are equal or not System.out.println(str+" is a palindrome); else System.out.println(str+" is not a palindrome"); 22:21 O Type here to search ^慘脈49 06-03-2018

Just know the 1st question to check palindrome or not