Question

7.8 LAB: Palindrome A palindrome is a word or a phrase that is the same when read both forward and backward. Examples are: "bob," "sees," or "never odd or even" (ignoring spaces). Write a program whose input is a word or phrase, and that outputs whether the input is a palindrome.

Answer 1

A palindrome is a word or phrase that is the same when read forward and backward. To determine if a word or phrase is a palindrome, compare characters from the beginning and end, moving inward until reaching the middle or finding a mismatched pair of characters.

Step-by-step explanation:

A palindrome is a word or phrase that reads the same forward and backward. To determine whether a word or phrase is a palindrome, you can compare the characters from the beginning and end of the word/phrase. If they are the same, continue comparing inward until you reach the middle or until you find a mismatched pair of characters. If all the pairs are the same, then the word/phrase is a palindrome.

For example, let's take the word 'level'. Starting from the first and last characters, 'l' is equal to 'l'. Next, we move inward and compare 'e' with 'e'. Finally, we compare 'v' with 'v'. Since all the characters match, the word 'level' is a palindrome.

Answer 2

To determine if an input is a palindrome in a computer program, normalize the input by removing spaces and non-alphanumeric characters, convert to lowercase, and then compare it with its reversed form.

Step-by-step explanation:

A palindrome is a word or phrase that reads the same forward and backward when ignoring spaces, punctuation, and capitalization. To check if an input is a palindrome, you can write a program that normalizes the string by removing non-alphanumeric characters and converting it to the same case. Then the program should compare the string with its reverse to determine if the input is a palindrome.

Here's a step-by-step guide to writing such a program:

Take the input string from the user.

Remove all spaces and non-alphanumeric characters from the string.

Convert all characters to lowercase to ensure uniformity in comparison.

Reverse the cleaned string.

Compare the cleaned string with its reversed version.

If they are identical, the input is a palindrome; otherwise, it is not.

For example, the input 'Never odd or even' would first be converted to 'neveroddoreven', which would then be compared to 'neveroddoreven' (its own reverse), confirming it's a palindrome.