Goal: Stacks and Queues to implement a programming solution Make sure you thorou

Question

Goal: Stacks and Queues to implement a programming solution

Make sure you thoroughly read and understand the directions before you begin.

Problem Statement
A palindrome is a character string that is equal to its reverse. A simple palindrome would be a word that is the same spelled forward or backward such as

Explanation / Answer

int main( ) { queue q; stack s; string the_string; int mismatches = 0; cout > the_string[i]; if (isalpha(the_string[i])) { q.push(toupper(the_string[i])); s.push(toupper(the_string[i])); } i++; } while ((!q.empty()) && (!s.empty())) { if (q.front() != s.top()) ++mismatches; q.pop(); s.pop(); } if (mismatches == 0) cout

Related Questions

Navigate

• Browse (All)
• Browse G
• Subjects

---