3. A palindrome is a string that reads the same forward and backward, i.e., the letters are the same whether you read them from right to left or from left to right. Examples: a) radar → is a palindrome b) Able was I ere I saw Elba → is a palindrome c) good → not a palindrome Write a java program to read a line of text and tell if the line is a palindrome. Use a stack to read each non-blank character on a stack. Treat both upper-case and lower-case version of the letter as being the same character. - Provide these 5 sample outputs and tell if each is a palindrome or not. Too bad--I hid a boot Some men interpret eight memos "Go Hang a Salami! I'm a Lasagna Hog" (title of a book on palindromes by Jon Agee, 1991) A man, a plan, a canal-Panama Gateman sees my name, garageman sees name tag
3. A palindrome is a string that reads the same forward and backward, i.e., the letters are the same whether you read them from right to left or from left to right. Examples: a) radar → is a palindrome b) Able was I ere I saw Elba → is a palindrome c) good → not a palindrome Write a java program to read a line of text and tell if the line is a palindrome. Use a stack to read each non-blank character on a stack. Treat both upper-case and lower-case version of the letter as being the same character. - Provide these 5 sample outputs and tell if each is a palindrome or not. Too bad--I hid a boot Some men interpret eight memos "Go Hang a Salami! I'm a Lasagna Hog" (title of a book on palindromes by Jon Agee, 1991) A man, a plan, a canal-Panama Gateman sees my name, garageman sees name tag
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
The first image is the main question, the second image is the directions for the
.
- **`Able was I ere I saw Elba`**: is a [palindrome](https://en.wikipedia.org/wiki/Palindrome).
- **`good`**: not a palindrome.
### Task: Palindrome Checker
Write a Java program to read a line of text and determine if the line is a palindrome. Use a stack to process each non-blank character, treating both upper-case and lower-case versions of the letter as the same character.
### Sample Outputs
Below are five sample outputs. Determine whether each line is a palindrome:
1. **Too bad--I hid a [boot](https://en.wikipedia.org/wiki/Boot)**
2. **Some men interpret eight [memos](https://en.wikipedia.org/wiki/Memo)**
3. **"Go Hang a Salami! I'm a Lasagna Hog"** (title of a book on palindromes by Jon Agee, 1991)
4. **A man, a plan, a canal—Panama**
5. **Gateman sees my name, garageman sees name [tag](https://en.wikipedia.org/wiki/Tag)**
**Note:** In each example, spaces, punctuation, and case differences should be ignored when determining if the sentence is a palindrome.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fd3ed3f65-79b2-4bdf-866b-dcdc9cf257bd%2F2d76a505-71bd-46b2-897c-2a8e7d6b9226%2Fmbkh5n_processed.png&w=3840&q=75)
Transcribed Image Text:### Understanding Palindromes
A palindrome is a string that reads the same forward and backward, i.e., the letters are the same whether you read them from right to left or from left to right.
#### Examples:
- **`radar`**: is a [palindrome](https://en.wikipedia.org/wiki/Palindrome).
- **`Able was I ere I saw Elba`**: is a [palindrome](https://en.wikipedia.org/wiki/Palindrome).
- **`good`**: not a palindrome.
### Task: Palindrome Checker
Write a Java program to read a line of text and determine if the line is a palindrome. Use a stack to process each non-blank character, treating both upper-case and lower-case versions of the letter as the same character.
### Sample Outputs
Below are five sample outputs. Determine whether each line is a palindrome:
1. **Too bad--I hid a [boot](https://en.wikipedia.org/wiki/Boot)**
2. **Some men interpret eight [memos](https://en.wikipedia.org/wiki/Memo)**
3. **"Go Hang a Salami! I'm a Lasagna Hog"** (title of a book on palindromes by Jon Agee, 1991)
4. **A man, a plan, a canal—Panama**
5. **Gateman sees my name, garageman sees name [tag](https://en.wikipedia.org/wiki/Tag)**
**Note:** In each example, spaces, punctuation, and case differences should be ignored when determining if the sentence is a palindrome.
![### Program #3
1. **Show the LinkedStackADT\<T> interface**
2. **Create a LinkedStackDS\<T> with the following methods:**
- Default constructor
- Overloaded constructor
- Copy constructor
- `isEmptyStack`
- `push`
- `peek`
- `pop`
3. **Create a private inner StackNode\<T> class with the following methods:**
- Default constructor
- Overloaded constructor
- `toString`
4. **Exception classes:**
- `StackException`
- `StackUnderflowException`
- `StackOverflowException`
5. **Create a PalindromeDemo class that instantiates a LinkedStackDS\<Character> object.**
- Execute a do-while loop that asks the user using dialog boxes to "Input a String for Palindrome Test."
- Use the `replaceAll` method to remove all blanks and special characters from `testStr`.
- Output whether or not it is a palindrome in a dialog box.
- \[Use the 5 inputs given on the other handout sheet for testing.\]](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fd3ed3f65-79b2-4bdf-866b-dcdc9cf257bd%2F2d76a505-71bd-46b2-897c-2a8e7d6b9226%2F8gw7mc_processed.png&w=3840&q=75)
Transcribed Image Text:### Program #3
1. **Show the LinkedStackADT\<T> interface**
2. **Create a LinkedStackDS\<T> with the following methods:**
- Default constructor
- Overloaded constructor
- Copy constructor
- `isEmptyStack`
- `push`
- `peek`
- `pop`
3. **Create a private inner StackNode\<T> class with the following methods:**
- Default constructor
- Overloaded constructor
- `toString`
4. **Exception classes:**
- `StackException`
- `StackUnderflowException`
- `StackOverflowException`
5. **Create a PalindromeDemo class that instantiates a LinkedStackDS\<Character> object.**
- Execute a do-while loop that asks the user using dialog boxes to "Input a String for Palindrome Test."
- Use the `replaceAll` method to remove all blanks and special characters from `testStr`.
- Output whether or not it is a palindrome in a dialog box.
- \[Use the 5 inputs given on the other handout sheet for testing.\]
Expert Solution

This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 4 steps with 13 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