A palindrome is a string that is spelled the same way forward and backward. Some examples of palindromes are "radar", "deed", "sees". The following are also palindromes if you ignore the punctuations and spaces: "a man a plan a canal panama". amanaplanacanalpanama "Madam I'm Adam" ---> madamimadam Notice that in palindromes the first letter matches the last, the second matches the next-to- last, and so on. Write a recursive function that returns a value of 1 if its string argument is a palindrome and zero otherwise. * Note that for the function parameters, you need to accommodate for the shrinking string, so that the string shrinks both from beginning and end after each recursive call. ** Think about the simple cases or base cases. The 2 base cases have conditions that would return O and return 1 independently. For the palindrome, create a driver program. First ask the user to enter any string through the keyboard. Then remove all the spaces and punctuations from the string. Also, remove any letter capitalization from the string. Finally, pass the string to the palindrome function through a function call.
A palindrome is a string that is spelled the same way forward and backward. Some examples of palindromes are "radar", "deed", "sees". The following are also palindromes if you ignore the punctuations and spaces: "a man a plan a canal panama". amanaplanacanalpanama "Madam I'm Adam" ---> madamimadam Notice that in palindromes the first letter matches the last, the second matches the next-to- last, and so on. Write a recursive function that returns a value of 1 if its string argument is a palindrome and zero otherwise. * Note that for the function parameters, you need to accommodate for the shrinking string, so that the string shrinks both from beginning and end after each recursive call. ** Think about the simple cases or base cases. The 2 base cases have conditions that would return O and return 1 independently. For the palindrome, create a driver program. First ask the user to enter any string through the keyboard. Then remove all the spaces and punctuations from the string. Also, remove any letter capitalization from the string. Finally, pass the string to the palindrome function through a function call.
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
Related questions
Question
in c
Transcribed Image Text:A palindrome is a string that is spelled the same way forward and backward.
Some examples of palindromes are "radar", "deed", "sees".
The following are also palindromes if you ignore the punctuations and spaces:
"a man a plan a canal panama". --->
amanaplanacanalpanama
"Madam I'm Adam"
---> madamimadam
Notice that in palindromes the first letter matches the last, the second matches the next-to-
last, and so on.
Write a recursive function that returns a value of 1 if its string argument is a
palindrome and zero otherwise.
* Note that for the function parameters, you need to accommodate for the shrinking
string, so that the string shrinks both from beginning and end after each recursive call.
** Think about the simple cases or base cases. The 2 base cases have conditions that
would return 0 and return 1 independently.
For the palindrome, create a driver program. First ask the user to enter any
string through the keyboard. Then remove all the spaces and punctuations from the
string. Also, remove any letter capitalization from the string. Finally, pass the string to
the palindrome function through a function call.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 4 steps with 2 images
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.Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education