Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
You are to write a set of test cases which will test a static method which should say whether a string is a palindrome or not. You don't need to write a program for this question. Just a set of test cases. Each test case should consist of a string followed by a ':' followed by the word true or false. The specification of the palindrome method is to return true if the string is a palindrome and false if it is not a palindrome. Your job is to write test cases which can successfully test whether the method works or not. Another program will use your tests to evaluate the isPalindrome method. Your file should contain one test on each line. An example line would be: abba:true Which would indicate that the method would be checked with the string abba and that the result should be true (since "abba" is indeed a palindrome.) Your tests will be used to evaluate a number of isPalindrome methods, many of which are faulty in some way. What is a palindrome A palindrome is a string which reads the same forwards as backwards. That is, if you reverse the string, it is indistinguishable from the original. For this problem, all characters are considered. (Hint: your tests do not need special characters to be successful.) Requested files TestCases.txt 1 / Enter four stings which are designed to test a program which tests palindromes. 2 // So you should enter a string followed by a : and a boolean value true or false indicating whether the string is a palindrome or not. 3 // Each test case should be on a line of its own.

You are to write a set of test cases which will test a static method which should say whether a string is a palindrome or not. You don't need to write a program for this question. Just a set of test cases. Each test case should consist of a string followed by a ':' followed by the word true or false. The specification of the palindrome method is to return true if the string is a palindrome and false if it is not a palindrome. Your job is to write test cases which can successfully test whether the method works or not. Another program will use your tests to evaluate the isPalindrome method. Your file should contain one test on each line. An example line would be: abba:true Which would indicate that the method would be checked with the string abba and that the result should be true (since "abba" is indeed a palindrome.) Your tests will be used to evaluate a number of isPalindrome methods, many of which are faulty in some way. What is a palindrome A palindrome is a string which reads the same forwards as backwards. That is, if you reverse the string, it is indistinguishable from the original. For this problem, all characters are considered. (Hint: your tests do not need special characters to be successful.) Requested files TestCases.txt 1 / Enter four stings which are designed to test a program which tests palindromes. 2 // So you should enter a string followed by a : and a boolean value true or false indicating whether the string is a palindrome or not. 3 // Each test case should be on a line of its own.

Database System Concepts
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
See similar textbooks
icon
Related questions
Question

stuck on this java program

 

You are to write a set of test cases which will test a static method which should say whether a string is a palindrome or not. You don't need to write a program for this question. Just a set of test cases. Each test case should consist of a string followed by a ':' followed by the word true or false. The specification of the palindrome method is to return true if the string is a palindrome and false if it is not a palindrome. Your job is to write test cases which can successfully test whether the method works or not. Another program will use your tests to evaluate the isPalindrome method. Your file should contain one test on each line. An example line would be: abba:true Which would indicate that the method would be checked with the string abba and that the result should be true (since "abba" is indeed a palindrome.) Your tests will be used to evaluate a number of isPalindrome methods, many of which are faulty in some way. What is a palindrome A palindrome is a string which reads the same forwards as backwards. That is, if you reverse the string, it is indistinguishable from the original. For this problem, all characters are considered. (Hint: your tests do not need special characters to be successful.) Requested files TestCases.txt 1 // Enter four stings which are designed to test a program which tests palindromes. // So you should enter a string followed by a : and a boolean value true or false indicating whether the string is a palindrome or not. // Each test case should be on a line of its own.
Transcribed Image Text:You are to write a set of test cases which will test a static method which should say whether a string is a palindrome or not. You don't need to write a program for this question. Just a set of test cases. Each test case should consist of a string followed by a ':' followed by the word true or false. The specification of the palindrome method is to return true if the string is a palindrome and false if it is not a palindrome. Your job is to write test cases which can successfully test whether the method works or not. Another program will use your tests to evaluate the isPalindrome method. Your file should contain one test on each line. An example line would be: abba:true Which would indicate that the method would be checked with the string abba and that the result should be true (since "abba" is indeed a palindrome.) Your tests will be used to evaluate a number of isPalindrome methods, many of which are faulty in some way. What is a palindrome A palindrome is a string which reads the same forwards as backwards. That is, if you reverse the string, it is indistinguishable from the original. For this problem, all characters are considered. (Hint: your tests do not need special characters to be successful.) Requested files TestCases.txt 1 // Enter four stings which are designed to test a program which tests palindromes. // So you should enter a string followed by a : and a boolean value true or false indicating whether the string is a palindrome or not. // Each test case should be on a line of its own.
Expert Solution
steps

Step by step

Solved in 2 steps with 1 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Files and Directory
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
Recommended textbooks for you
Database System Concepts
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)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education
SEE MORE TEXTBOOKS