Write recursive methods for the following operations: • removeDup(String s): takes string s and returns another string r constructed from s after removing all duplicates. For example, when s = "pineapples", r will be "pineals". • intersection(String s1, String s2): takes two duplicate-free strings and returns the string consisting of all letters that appear in both s1 and s2. • union(String s1, String s2): takes two duplicate-free strings and returns the string consisting of all letters that appear in either s1 or s2. • difference(String s1, String s2): takes two duplicate-free strings and returns the string consisting of all letters that appear only in s1. For example, when s1 = "aples" and s2 = "pears", intersection(s1, s2) will return "apes", union(s1, s2) will "aplesr", and difference(s1, s2) "l". Calling method removeDup() is not allowed in intersection(s1, s2) , union(s1, s2) or difference(s1, s2) method. Your program should check strings are duplicate free before they are passed to those methods. Note that all the methods must be recursive and should not contain any loops. Your main method in this program should demonstrate the use of your methods with a menu for the user to pick the method to try and enter their strings for use in the method. The strings should be entered after the user picks their choice of either remove duplicates, union, intersection, or difference so they can test each method with different strings. Also, the main method should print the strings that are returned by each method since the methods themselves shouldn’t print anything.
Write recursive methods for the following operations: • removeDup(String s): takes string s and returns another string r constructed from s after removing all duplicates. For example, when s = "pineapples", r will be "pineals". • intersection(String s1, String s2): takes two duplicate-free strings and returns the string consisting of all letters that appear in both s1 and s2. • union(String s1, String s2): takes two duplicate-free strings and returns the string consisting of all letters that appear in either s1 or s2. • difference(String s1, String s2): takes two duplicate-free strings and returns the string consisting of all letters that appear only in s1. For example, when s1 = "aples" and s2 = "pears", intersection(s1, s2) will return "apes", union(s1, s2) will "aplesr", and difference(s1, s2) "l". Calling method removeDup() is not allowed in intersection(s1, s2) , union(s1, s2) or difference(s1, s2) method. Your program should check strings are duplicate free before they are passed to those methods. Note that all the methods must be recursive and should not contain any loops. Your main method in this program should demonstrate the use of your methods with a menu for the user to pick the method to try and enter their strings for use in the method. The strings should be entered after the user picks their choice of either remove duplicates, union, intersection, or difference so they can test each method with different strings. Also, the main method should print the strings that are returned by each method since the methods themselves shouldn’t print anything.
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
Write recursive methods for the following operations:
• removeDup(String s): takes string s and returns another string r constructed from s
after removing all duplicates. For example, when s = "pineapples", r will be
"pineals".
• intersection(String s1, String s2): takes two duplicate-free strings and returns
the string consisting of all letters that appear in both s1 and s2.
• union(String s1, String s2): takes two duplicate-free strings and returns the string
consisting of all letters that appear in either s1 or s2.
• difference(String s1, String s2): takes two duplicate-free strings and returns the
string consisting of all letters that appear only in s1.
For example, when s1 = "aples" and s2 = "pears", intersection(s1, s2) will return
"apes", union(s1, s2) will "aplesr", and difference(s1, s2) "l".
Calling method removeDup() is not allowed in intersection(s1, s2) , union(s1, s2) or
difference(s1, s2) method. Your program should check strings are duplicate free before
they are passed to those methods.
Note that all the methods must be recursive and should not contain any loops.
Your main method in this program should demonstrate the use of your methods with a menu for
the user to pick the method to try and enter their strings for use in the method. The strings
should be entered after the user picks their choice of either remove duplicates, union,
intersection, or difference so they can test each method with different strings. Also, the main
method should print the strings that are returned by each method since the methods themselves
shouldn’t print anything.
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 5 steps with 3 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