  Textbook Solutions Expert Q&A Practice Study Pack 

Find solutions for your homework Search

home / study / math / advanced mathematics / advanced mathematics solutions manuals / discrete mathematics and its applications / 6th edition / chapter 3.1 / problem 9e

Discrete Mathematics and Its Applications Post a question

(6th Edition)

Answers from our experts for your tough

homework questions

See this solution in the app Enter question

Chapter 3.1, Problem 9E Bookmark Show all steps: ON

Continue to post
Problem
0 questions remaining

A palindrome is a string that reads the same forward and backward. Describe an algorithm for
determining whether a string of n characters is a palindrome.
Snap a photo from your
phone to post a question
We'll send you a one-time
download link
Step-by-step solution
888-888-8888 Text me
Step 1 of 2
By providing your phone number, you agree to receive
a one-time automated text message with a link to get
the app. Standard messaging rates may apply.
A palindrome is a string that reads the same forward and backward.

The Objective is to describe an algorithm for the palindrome string.

My Textbook Solutions
Comment

Step 2 of 2

Discrete... Accounting Mechanics of

The algorithm for finding whether a string is palindrome or not. Information... Materials
6th Edition 8th Edition 8th Edition
Input: a, a string of length n .
View all solutions
Output:True/False.

• Input a String

• Initialize Len to zero , Flag to zero

• While String[Len] is not equal to NULL

• Increment Len

• Initialize I to zero , J to Len-1

• While I is less than (Len/2)+1

If String[I] equal to String[J]

Flag=0

else

Flag=1

Increment I , Decrement J

• If Flag equal to zero

Print Key Is a Palindrome

else

Print Key Is Not a Palindrome

• Stop

Comment

Was this solution helpful? 6 0

Recommended solutions for you in Chapter 3.1

Chapter 3.1, Problem 51E Chapter 3.1, Problem 45E

When a list of elements is in close to the correct How many comparisons does the insertion sort use
order, would it be better to use an insertion sort or to sort the list 1, 2, …, n?
its variation...
See solution
See solution

See more problems in subjects you study

  
COMPANY
Textbook Solutions
LEGAL & POLICIES
Expert Q&A Practice
CHEGG PRODUCTS AND SERVICES CHEGG NETWORK
Study Pack
CUSTOMER SERVICE


About Chegg Advertising Choices Cheap Textbooks Mobile Apps EasyBib Customer Service
Chegg For Good Cookie Notice Chegg Coupon Sell Textbooks Internships.com Give Us Feedback
College Marketing General Policies Chegg Play Solutions Manual Thinkful Help with eTextbooks
Corporate Development Intellectual Property Rights Chegg Study Help Study 101 Help to use EasyBib Plus
Investor Relations Terms of Use College Textbooks Textbook Rental Manage Chegg Study
Jobs Global Privacy Policy eTextbooks Used Textbooks Subscription
Join Our Affiliate Program DO NOT SELL MY INFO Flashcards Digital Access Codes Return Your Books
Media Center Honor Code Learn Chegg Money Textbook Return Policy
Site Map Honor Shield Chegg Math Solver

© 2003-2021 Chegg Inc. All rights reserved.