1). Write a java Palindrome program that use a recursive function call isPalindrome that returns a Boolean and accepts a string as a parameter. The program should be called from the command line / console and prompt the user to enter a string to check or Q to quit. If the first and last characters in the phrase are different, the phrase is not a palindrome. Its see as a base case and that returns false. If the phrase has one character, another base case that returns true. If the first and last characters in the phrase are the same, it is possible that the phrase is a palindrome. Apply recursion and determine if the string in positions (first+1) through (last -1) is a palindrome. Example – racecar Call isPalindrome(racecar) First and last characters are the same: racecar Return true && isPalindrome(aceca) First and last characters are the same: aceca Return true && true && isPalindrome(cec) First and last characters are the same: cec Return true && true && true && isPalindrome(e) Return true && true && true && true 2). Show how this algorithm works on the following strings using pseudo code: rester able was i ere i saw elba

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
icon
Related questions
Question

1). Write a java Palindrome program that use a recursive function call isPalindrome that returns a Boolean and accepts a string as a parameter. The program should be called from the command line / console and prompt the user to enter a string to check or Q to quit.

If the first and last characters in the phrase are different, the phrase is not a palindrome. Its see as a base case and that returns false. If the phrase has one character, another base case that returns true. If the first and last characters in the phrase are the same, it is possible that the phrase is a palindrome. Apply recursion and determine if the string in positions (first+1) through (last -1) is a palindrome.

Example – racecar

  • Call isPalindrome(racecar)
  • First and last characters are the same: racecar
  • Return true && isPalindrome(aceca)
  • First and last characters are the same: aceca
  • Return true && true && isPalindrome(cec)
  • First and last characters are the same: cec
  • Return true && true && true && isPalindrome(e)
  • Return true && true && true && true

2). Show how this algorithm works on the following strings using pseudo code:

  • rester
  • able was i ere i saw elba
AI-Generated Solution
AI-generated content may present inaccurate or offensive content that does not represent bartleby’s views.
steps

Unlock instant AI solutions

Tap the button
to generate a solution

Knowledge Booster
Function Arguments
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
Recommended textbooks for you
Database System Concepts
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)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education