Write the program described below.
Write a program to accept a sentence which may be terminated by either ‘.’ , ‘?’ or ‘!’ only. The words are to be separated by a single blank space and are in lower case. Perform the following tasks:
(a) Check for the validity of the accepted sentence and for the terminating character.
(b) Arrange the words contained in the sentence according to the size of the words in ascending order. If two words are of the same length then the first occurring comes first. The sentence should begin with a capital alphabet in both the cases i.e. Input and Output.
(c) Display both the sentences separately with each sentence beginning with a capital alphabet.
Design your program which will enable the output in the format given below:
Sample input/output
Sample 1
INPUT: the lines are printed in reverse order.
OUTPUT:
The lines are printed in reverse order.
In the are lines order printed reverse.
Sample 2
INPUT: print the sentence in ascending order.
OUTPUT:
Print the sentence in ascending order.
In the print order sentence ascending.
Sample 3
INPUT: i love my country.
OUTPUT:
I love my country.
I my love country.Show answer
Answer
AI2(a): This part checks the validity and the terminating character. The complete program for parts (a), (b) and (c) is:
import java.util.Scanner;
public class SentenceSort
{
public static void main(String args[])
{
Scanner sc = new Scanner(System.in);
System.out.print("INPUT: ");
String s = sc.nextLine();
// (a) validity of the sentence and of the terminating character
boolean valid = s.length() > 1;
if (valid)
{
char last = s.charAt(s.length() - 1);
if (last != '.' && last != '?' && last != '!')
valid = false;
}
if (valid)
{
String body = s.substring(0, s.length() - 1);
if (body.startsWith(" ") || body.endsWith(" ") || body.indexOf(" ") != -1)
valid = false;
for (int i = 0; i < body.length() && valid; i++)
{
char c = body.charAt(i);
if (!(c >= 'a' && c <= 'z') && c != ' ')
valid = false;
}
}
if (!valid)
{
System.out.println("INVALID INPUT");
return;
}
char term = s.charAt(s.length() - 1);
String body = s.substring(0, s.length() - 1);
String w[] = body.split(" ");
int n = w.length;
// (b) arrange the words by length (insertion sort keeps the original order of equal lengths)
for (int i = 1; i < n; i++)
{
String key = w[i];
int j = i - 1;
while (j >= 0 && w[j].length() > key.length())
{
w[j + 1] = w[j];
j--;
}
w[j + 1] = key;
}
String sorted = "";
for (int i = 0; i < n; i++)
sorted = sorted + w[i] + " ";
sorted = sorted.trim();
// (c) display both sentences, each beginning with a capital letter
String first = Character.toUpperCase(body.charAt(0)) + body.substring(1) + term;
String second = Character.toUpperCase(sorted.charAt(0)) + sorted.substring(1) + term;
System.out.println();
System.out.println("OUTPUT:");
System.out.println(first);
System.out.println(second);
}
}for (int i = 1; i < n; i++)
{
String key = w[i];
int j = i - 1;
while (j >= 0 && w[j].length() > key.length())
{
w[j + 1] = w[j];
j--;
}
w[j + 1] = key;
}String first = Character.toUpperCase(body.charAt(0)) + body.substring(1) + term;
String second = Character.toUpperCase(sorted.charAt(0)) + sorted.substring(1) + term;
System.out.println(first);
System.out.println(second);