Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
Two words (spelt in uppercase) are similar if and only if all letters in the 1st word are in the 2nd word and all letters in the 2nd word are in the 1$st word; including the same number of duplications. For example, ABBA and BABA are similar; however, BABA and BAAA are not similar. To check two words which are similar, we can use two integer arrays, each has 26 elements (as we have 26 letters), you can assume that 1st array element stores the number of letter 'A', 2nd array element stores the number of letter 'B', and so on. What you need to do now is to check whether the two integer arrays are equal to decide whether the two words are similar. We propose following UML for this question: O TwoWords - String word1 - String word2 O Exam_04 + TwoWordso ••TwoWords(String word1, String word2) + TwoWords(TwoWords tw) O+ String getWord10 O• String getWord20 O+void setinfo(String word1, String word2) - int) countinfo(String word) - static Scanner input • static void main(Stringfl args) O+boolean areSimilaro The class TwoWords has two String instance variables. In this class, other than the constructors, accessor and mutator methods; we have two important methods: the countlnfo method receives a String parameter (a word, for example) counts and stores the letters' info in an integer array and returns this array; the areSimilar method is to check whether the two words are similar. Main method drives the following interaction: Enter two words: ABABABA ABABABA and BABABAB are not similar wish to continue? (y/Y/N/n): y ВАВАВАВ Enter two words: BABABABA BABABABA and ABABABAB are similar wish to continue? (y/Y/N/n): y АВАВАВАВ Enter two words: AAAAZZ AAAAZZZ and AZZzzzz are not similar wish to continue? (y/Y/N/n): n AZZZZZZ

Two words (spelt in uppercase) are similar if and only if all letters in the 1st word are in the 2nd word and all letters in the 2nd word are in the 1$st word; including the same number of duplications. For example, ABBA and BABA are similar; however, BABA and BAAA are not similar. To check two words which are similar, we can use two integer arrays, each has 26 elements (as we have 26 letters), you can assume that 1st array element stores the number of letter 'A', 2nd array element stores the number of letter 'B', and so on. What you need to do now is to check whether the two integer arrays are equal to decide whether the two words are similar. We propose following UML for this question: O TwoWords - String word1 - String word2 O Exam_04 + TwoWordso ••TwoWords(String word1, String word2) + TwoWords(TwoWords tw) O+ String getWord10 O• String getWord20 O+void setinfo(String word1, String word2) - int) countinfo(String word) - static Scanner input • static void main(Stringfl args) O+boolean areSimilaro The class TwoWords has two String instance variables. In this class, other than the constructors, accessor and mutator methods; we have two important methods: the countlnfo method receives a String parameter (a word, for example) counts and stores the letters' info in an integer array and returns this array; the areSimilar method is to check whether the two words are similar. Main method drives the following interaction: Enter two words: ABABABA ABABABA and BABABAB are not similar wish to continue? (y/Y/N/n): y ВАВАВАВ Enter two words: BABABABA BABABABA and ABABABAB are similar wish to continue? (y/Y/N/n): y АВАВАВАВ Enter two words: AAAAZZ AAAAZZZ and AZZzzzz are not similar wish to continue? (y/Y/N/n): n AZZZZZZ

Computer Networking: A Top-Down Approach (7th Edition)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
See similar textbooks
icon
Related questions
Question
Two words (spelt in uppercase) are similar if and only if all letters in the 1st word are in the 2nd word and all letters in the 2nd word are in the 1st word; including the same number of duplications. For example, ABBA and BABA are similar; however, BABA and BAAA are not similar. To check two words which are similar, we can use two integer arrays, each has 26 elements (as we have 26 letters), you can assume that 1st array element stores the number of letter 'A', 2nd array element stores the number of letter 'B', and so on. What you need to do now is to check whether the two integer arrays are equal to decide whether the two words are similar. We propose following UML for this question: O TwoWords - String word1 -String word2 O Exam_Q4 +TwoWords0 - static Scanner input +TwoWords(String word1, String word2) O+TwoWords(TwoWords tw) O+ String getWord10 O+ static void main(String args) O+ String getWord20 O+void setinfo(String word1, String word2) O -intj countinfo (String word) O+boolean areSimilaro The class TwoWords has two String instance variables. In this class, other than the constructors, accessor and mutator methods; we have two important methods: the countInfo method receives a String parameter (a word, for example) counts and stores the letters' info in an integer array and returns this array; the areSimilar method is to check whether the two words are similar. Main method drives the following interaction: Enter two words: ABABABA ABABABA and BABABAB are not similar wish to continue? (y/Y/N/n): y ВАВАBАB Enter two words: BABABABA BABABABA and ABABABAB are similar wish to continue? (y/Y/N/n): y АВАВАВАВ Enter two words: AAAAZZ AAAAZZZ and AZZzzzz are not similar wish to continue? (y/Y/N/n): n AZZZZZZ
Transcribed Image Text:Two words (spelt in uppercase) are similar if and only if all letters in the 1st word are in the 2nd word and all letters in the 2nd word are in the 1st word; including the same number of duplications. For example, ABBA and BABA are similar; however, BABA and BAAA are not similar. To check two words which are similar, we can use two integer arrays, each has 26 elements (as we have 26 letters), you can assume that 1st array element stores the number of letter 'A', 2nd array element stores the number of letter 'B', and so on. What you need to do now is to check whether the two integer arrays are equal to decide whether the two words are similar. We propose following UML for this question: O TwoWords - String word1 -String word2 O Exam_Q4 +TwoWords0 - static Scanner input +TwoWords(String word1, String word2) O+TwoWords(TwoWords tw) O+ String getWord10 O+ static void main(String args) O+ String getWord20 O+void setinfo(String word1, String word2) O -intj countinfo (String word) O+boolean areSimilaro The class TwoWords has two String instance variables. In this class, other than the constructors, accessor and mutator methods; we have two important methods: the countInfo method receives a String parameter (a word, for example) counts and stores the letters' info in an integer array and returns this array; the areSimilar method is to check whether the two words are similar. Main method drives the following interaction: Enter two words: ABABABA ABABABA and BABABAB are not similar wish to continue? (y/Y/N/n): y ВАВАBАB Enter two words: BABABABA BABABABA and ABABABAB are similar wish to continue? (y/Y/N/n): y АВАВАВАВ Enter two words: AAAAZZ AAAAZZZ and AZZzzzz are not similar wish to continue? (y/Y/N/n): n AZZZZZZ
Expert Solution
steps

Step by step

Solved in 2 steps with 1 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY
SEE MORE TEXTBOOKS