Answered: write a recursive function that checks…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Concept explainers

Question

write a recursive function that checks see if the first letter matches the last letter, return the middle letters and check until only 0 or 1 letters are left. It returns True or False.

Here is python code that needs to be fixed

# Returns the first character of the string str

def firstCharacter(str):

return str[:1]

# Returns the last character of a string str

def lastCharacter(str):

return str[-1:]

# Returns the string that results from removing the first

# and last characters from str

def middleCharacters(str):

return str[1:-1]

def isPalindrome(str):

# base case #1

# base case #2

# recursive case

pass

def isPalindrome(string):

reversedString = string[::-1]

if reversedString == string:

return True

else:

return False

inputString = input()

string = inputString.replace(" ", "")

if isPalindrome(string):

print(inputString,"is a palindrome")

else:

print(inputString,"is not a palindrome")

if __name__ == "__main__":

assert firstCharacter('boot') == 'b'

assert lastCharacter('boot') == 't'

assert middleCharacters('boot') == 'oo'

assert isPalindrome("a") == True

assert isPalindrome("motor") == False

assert isPalindrome("rotor") == True

Expert Solution

Step by step

Solved in 3 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions