Q2: Palindromes Write a function called palindrome which takes a string as parameter and returns True if the string is a palindrome (meaning it is the same forwards as backwards), and False otherwise. Some useful things to remember: • Use the function len to find the length of a string. • To get just a piece of a string, use the slice operator. For example: astring = 'hello' substr = astring[1:-1] #sets substr to 'ell' Page 4 of 5 • Try to make your function correctly identify palindromes that have spaces (such as 'able was i ere i saw elba') You can have a look at string.join method here if it could help you. • string.lower may also be a useful function. ● BE SURE TO TEST WELL! Include multiple test cases, including one where the word isn't a palindrome, but the first and last letters are equal (such as "yummy"). ● It is easiest to do this with a while loop, although there are a few different ways of structuring such a loop. Think about what conditions need to be met for a palindrome to be true, and when you can stop testing for one. (hint: the words 'ana' and 'anna' are both palindromes; when do we know to stop checking?)
Q2: Palindromes Write a function called palindrome which takes a string as parameter and returns True if the string is a palindrome (meaning it is the same forwards as backwards), and False otherwise. Some useful things to remember: • Use the function len to find the length of a string. • To get just a piece of a string, use the slice operator. For example: astring = 'hello' substr = astring[1:-1] #sets substr to 'ell' Page 4 of 5 • Try to make your function correctly identify palindromes that have spaces (such as 'able was i ere i saw elba') You can have a look at string.join method here if it could help you. • string.lower may also be a useful function. ● BE SURE TO TEST WELL! Include multiple test cases, including one where the word isn't a palindrome, but the first and last letters are equal (such as "yummy"). ● It is easiest to do this with a while loop, although there are a few different ways of structuring such a loop. Think about what conditions need to be met for a palindrome to be true, and when you can stop testing for one. (hint: the words 'ana' and 'anna' are both palindromes; when do we know to stop checking?)
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
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 2 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