COMP 6481 Programming and problem solving Lab 4
Lab 4 Student ID:
4A Problem Description:
A word is "paired-isogram" if each letter in the given word appears exactly twice
(not less, not more) in the word. For example, the word teammate is a paired-
isogram since each letter in the word appears exactly twice (not less, not more),
but the word dad is not since the letter "a" of the word does not appear twice.
Write a Java program to determine whether a given word is a paired-isogram.
Input Specification:
Input to the program is given in one line which contain one word with character
length not exceeding 52. Input word will contain only lowercase letters (no other
characters) and will be at least one letter long.
Output Specification:
The output should be one line where you print all the unique alphabets in sorted
order followed by yes if the given word is a paired-isogram. You should print all
the non-repeating alphabets in a sorted order followed by no if it the word is not
a paired-isogram. All the alphabets prior to yes or no should be separated by a
single space.
Hint: ASCII values for [a-z] are 97-122 and [A-Z] are 65-90.
Sample Test Case:
SR. No Input Output
1 teammate a e m t yes
2 dad a no
3 ali a i l no
4 dood d o yes
5 immorior i m o r yes
Note: No extra spaces, tabs, blank lines, punctuations, or any other superfluous
characters are allowed. You must use only one scanner in your code.
This study source was downloaded by 100000850872992 from CourseHero.com on 09-26-2023 08:53:20 GMT -05:00
https://www.coursehero.com/file/155010646/prob-Lab4Apdf/
Lab 4 Student ID:
4A Problem Description:
A word is "paired-isogram" if each letter in the given word appears exactly twice
(not less, not more) in the word. For example, the word teammate is a paired-
isogram since each letter in the word appears exactly twice (not less, not more),
but the word dad is not since the letter "a" of the word does not appear twice.
Write a Java program to determine whether a given word is a paired-isogram.
Input Specification:
Input to the program is given in one line which contain one word with character
length not exceeding 52. Input word will contain only lowercase letters (no other
characters) and will be at least one letter long.
Output Specification:
The output should be one line where you print all the unique alphabets in sorted
order followed by yes if the given word is a paired-isogram. You should print all
the non-repeating alphabets in a sorted order followed by no if it the word is not
a paired-isogram. All the alphabets prior to yes or no should be separated by a
single space.
Hint: ASCII values for [a-z] are 97-122 and [A-Z] are 65-90.
Sample Test Case:
SR. No Input Output
1 teammate a e m t yes
2 dad a no
3 ali a i l no
4 dood d o yes
5 immorior i m o r yes
Note: No extra spaces, tabs, blank lines, punctuations, or any other superfluous
characters are allowed. You must use only one scanner in your code.
This study source was downloaded by 100000850872992 from CourseHero.com on 09-26-2023 08:53:20 GMT -05:00
https://www.coursehero.com/file/155010646/prob-Lab4Apdf/
