Write a function cyclic_toptail() which takes a single argument sentence in the form of a non-empty string, and returns True if ll words in sentence start with the final letter of the word that precedes them (including the first letter of the first word being the same as the last letter of the last word), and False otherwise. You may assume that sentence is all lowercase, does not contain any punctuation, and that words are separated by spaces. For example, in the case of sentence being "giraffes sing", the function should return True, as: (a) the first word ("giraffes") ends in the same letter as the first letter of the second word ("sing"), i.e. s; and (b) the first letter of the first word is the same as the last letter of the last word, e.g. g. In the case of "giraffes sulk", on the other hand, the function should return False, as the first letter of the first word (g) is not the same as the last letter of the last word (k). Example calls to the function are: >>» cyclic_toptail("giraffes sing") True >>> cyclic_toptail("giraffes sulk") False >>> cyclic_toptail("seals slurping green negronis") True >>> cyclic_toptail("abracadabra") True >>> cyclic_toptail("alakazam") False >>> cyclic_toptail("the cat sat on the mat") False
Write a function cyclic_toptail() which takes a single argument sentence in the form of a non-empty string, and returns True if ll words in sentence start with the final letter of the word that precedes them (including the first letter of the first word being the same as the last letter of the last word), and False otherwise. You may assume that sentence is all lowercase, does not contain any punctuation, and that words are separated by spaces. For example, in the case of sentence being "giraffes sing", the function should return True, as: (a) the first word ("giraffes") ends in the same letter as the first letter of the second word ("sing"), i.e. s; and (b) the first letter of the first word is the same as the last letter of the last word, e.g. g. In the case of "giraffes sulk", on the other hand, the function should return False, as the first letter of the first word (g) is not the same as the last letter of the last word (k). Example calls to the function are: >>» cyclic_toptail("giraffes sing") True >>> cyclic_toptail("giraffes sulk") False >>> cyclic_toptail("seals slurping green negronis") True >>> cyclic_toptail("abracadabra") True >>> cyclic_toptail("alakazam") False >>> cyclic_toptail("the cat sat on the mat") False
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
Transcribed Image Text:Write a function cyclic_toptail() which takes a single argument
sentence in the form of a non-empty string, and returns True if ll
words in sentence start with the final letter of the word that
precedes them (including the first letter of the first word being the
same as the last letter of the last word), and False otherwise. You
may assume that sentence is all lowercase, does not contain any
punctuation, and that words are separated by spaces.
For example, in the case of sentence being "giraffes sing", the
function should return True, as: (a) the first word ("giraffes") ends
in the same letter as the first letter of the second word ("sing"), i.e.
s; and (b) the first letter of the first word is the same as the last letter
of the last word, e.g. g. In the case of "giraffes sulk", on the
other hand, the function should return False, as the first letter of
the first word (g) is not the same as the last letter of the last word (k).
Example calls to the function are:
>>» cyclic_toptail("giraffes sing")
True
>>> cyclic_toptail("giraffes sulk")
False
>>> cyclic_toptail("seals slurping green negronis")
True
>>> cyclic_toptail("abracadabra")
True
>>> cyclic_toptail("alakazam")
False
>>> cyclic_toptail("the cat sat on the mat")
False
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 4 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