Question

Texts: Without using the reverse() method or list comprehension, such as [::-1], write a program to test whether a string is a palindrome or not using the following algorithm: (1) Print a welcome message. (2) Using a loop, prompt the user for a word or alphabet 'q' to quit the program. (3) Check to see if the user wants to quit. If so, exit the loop. (4) If they don't want to quit, then use a for loop to create a second string that is the reverse of the first (see the lecture slides). (5) If the two strings are equal, print a message saying that the word is a palindrome; otherwise, print a statement/message saying it isn't. (6) After the loop started in step 2 is done, print a message and close the program.

          Texts: Without using the reverse() method or list comprehension, such as [::-1], write a program to test whether a string is a palindrome or not using the following algorithm:

(1) Print a welcome message.
(2) Using a loop, prompt the user for a word or alphabet 'q' to quit the program.
(3) Check to see if the user wants to quit. If so, exit the loop.
(4) If they don't want to quit, then use a for loop to create a second string that is the reverse of the first (see the lecture slides).
(5) If the two strings are equal, print a message saying that the word is a palindrome; otherwise, print a statement/message saying it isn't.
(6) After the loop started in step 2 is done, print a message and close the program.

Added by Domingo N.

Question

Please give Ace some feedback