
Database System Concepts
7th Edition
ISBN: 9780078022159
Author: Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher: McGraw-Hill Education
expand_more
expand_more
format_list_bulleted
Question
![Instructions
Write a program that uses the function is Palindrome given in Example 6-6 (Palindrome). Test
your program on the following strings:
madam, abba, 22, 67876, 444244, trymeuemyrt
Modify the function isPalindrome of Example 6-6 so that when determining whether a string is
a palindrome, cases are ignored, that is, uppercase and lowercase letters are considered the same.
The isPalindrome function from Example 6-6 has been included below for your convenience.
bool isPalindrome (string str)
{
int length = str.length();
for (int i = 0; i < length / 2; i++) {
if (str[i] != str[length - 1 - i]) {
return false;
} // if
} // for loop
return true;
}// isPalindrome
Your program should print a message indicating if a string is a palindrome:
madam is a palindrome](https://content.bartleby.com/qna-images/question/598ad0e4-ac4e-4ea4-abd5-a768a803782f/2f92c8dc-d4db-4a3d-8ec3-bebd3ecbb391/ihpxe0n_thumbnail.png)
Transcribed Image Text:Instructions
Write a program that uses the function is Palindrome given in Example 6-6 (Palindrome). Test
your program on the following strings:
madam, abba, 22, 67876, 444244, trymeuemyrt
Modify the function isPalindrome of Example 6-6 so that when determining whether a string is
a palindrome, cases are ignored, that is, uppercase and lowercase letters are considered the same.
The isPalindrome function from Example 6-6 has been included below for your convenience.
bool isPalindrome (string str)
{
int length = str.length();
for (int i = 0; i < length / 2; i++) {
if (str[i] != str[length - 1 - i]) {
return false;
} // if
} // for loop
return true;
}// isPalindrome
Your program should print a message indicating if a string is a palindrome:
madam is a palindrome
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 nowThis is a popular solution!
Step by stepSolved in 2 steps with 1 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.Similar questions
- Write a function to pig_latin that converts a word into pig latin, by: 1. Removing the first character from the start of the string, 2. Adding the first character to the end of the string, 3. Adding "ay" to the end of the string. So, for example, this function converts "hello" to "ellohay". Call the function twice to demonstrate the behavior. There is a worked example for this kind of problem.arrow_forwardWrite a program in C programming language that takes two arguments at the command line, both strings. The program checks to see whether or not the second string is a substring of the first (without using the substr -- or any other library -- function). One caveat: any * in the second string can match zero or more characters in the first string, so if the input were abcd and the substring was a*c, then it would count as a substring. Also, include functionality to allow an asterisk to be taken literally if preceded by a \, and a \ is taken literally except when preceding an asterisk.arrow_forwardPrograming Carrow_forward
- A function that turns an argument to a string (call it “toString(…)”) is a great use of function overloading. In one sentence, why might this be? In one sentence, why should we generally verify the arguments are what we expect when writing a function?arrow_forwardWrite a function hasBothCases that takes a a c-string and determines if it contains both the upper and lowercase forms of a letter, returning 11 if both the upper and lowercase form of a letter are part of the string and returning 00 if no such letter exists. For example, hasBothCases should return 11 for the strings "Nine", "Lowell", and "o_O", but should return 00 for "nine", "Massachusetts", and "zyBooks". HINTS: You can make use of either the following: (1) Assume that the <ctype.h> library has already been #included. 2) Upper case letter A starts at 65 and Upper case Z is 90 in ASCII code, while lower case a starts at 97 and z is 122. NOTE: You only need to write the function. In C programmingarrow_forwardWrite out a function that prints out all the permutations of a string. For example, abc would give you abc, acb, bac, bca, cab, cba.arrow_forward
arrow_back_ios
arrow_forward_ios
Recommended textbooks for you
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education

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