Common Words ISC Computer Science 2021 Practical

-

Write a program to accept a paragraph containing two sentences only. The sentences may be terminated by either '.', '?' or '!' only. Any other character may be ignored. The words are to be separated by a single blank space and must be in uppercase.

Perform the following tasks:

(a) Check for the validity of the accepted paragraph for the number of sentences and for the terminating character.

(b) Separate the two sentences from the paragraph and find the common words in the two sentences with their frequency of occurrence in the paragraph.

(c) Display both the sentences separately along with the common words and their frequency, in the format given below.

Test your program for the following data and some random data:

Example 1:
INPUT:
IS IT RAINING? YOU MAY GET WET IF IT IS RAINING.
OUTPUT:
IS IT RAINING?
YOU MAY GET WET IF IT IS RAINING.

COMMON WORDSFREQUENCY
IS2
IT2
RAINING2

Example 2:
INPUT:
INDIA IS MY MOTHERLAND AND I AM PROUD OF MY MOTHERLAND. ALL INDIANS ARE MY BROTHERS AND SISTERS.
OUTPUT:
INDIA IS MY MOTHERLAND AND I AM PROUD OF MY MOTHERLAND.
ALL INDIANS ARE MY BROTHERS AND SISTERS.
COMMON WORDSFREQUENCY
MY3
AND2

Example 3:
INPUT:
ARE YOU COMING? I AM GETTING LATE.
OUTPUT:
ARE YOU COMING?
I AM GETTING LATE.

NO COMMON WORDS

Example 4:
INPUT:
AT LAST, THE TIGER WAS SAVED.
OUTPUT:
INVALID INPUT

import java.util.Scanner;
import java.util.StringTokenizer;
class CommonWords{
    public static void main(String[] args){
        Scanner in = new Scanner(System.in);
        System.out.print("Paragraph: ");
        String p = in.nextLine().toUpperCase();
        p = p.trim();
        if(!isValid(p)){
            System.out.println("INVALID INPUT");
            return;
        }
        int pos = 0;
        for(int i = 0; i < p.length(); i++){
            char ch = p.charAt(i);
            if(".?!".indexOf(ch) >= 0){
                pos = i;
                break;
            }
        }
        String s1 = p.substring(0, pos + 1);
        String s2 = p.substring(pos + 1).trim();
        System.out.println(s1);
        System.out.println(s2);
        StringTokenizer st = new StringTokenizer(s1, " .?!");
        int count = st.countTokens();
        String w1[] = new String[count];
        for(int i = 0; i < count; i++)
            w1[i] = st.nextToken();
        st = new StringTokenizer(s2, " .?!");
        count = st.countTokens();
        String w2[] = new String[count];
        for(int i = 0; i < count; i++)
            w2[i] = st.nextToken();
        String taken[] = new String[w1.length + w2.length];
        int index = 0;
        boolean isCommon = false;
        for(int i = 0; i < w1.length; i++){
            for(int j = 0; j < w2.length; j++){
                if(w1[i].equals(w2[j])){
                    isCommon = true;
                    break;
                }
            }
        }
        if(isCommon)
            System.out.println("COMMON WORDS\tFREQUENCY");
        for(int i = 0; i < w1.length; i++){
            count = 0;
            for(int j = 0; j < w1.length; j++){
                if(w1[i].equals(w1[j]))
                    count++;
            }
            boolean flag = false;
            for(int k = 0; k < w2.length; k++){
                if(w1[i].equals(w2[k])){
                    count++;
                    flag = true;
                    isCommon = true;
                }
            }
            if(count > 1 && flag && !inTaken(taken, w1[i])){
                System.out.println(w1[i] + "\t\t" + count);
                taken[index++] = w1[i];
            }
        }
        if(!isCommon)
            System.out.println("NO COMMON WORDS");
    }
    public static boolean isValid(String p){
        int len = p.length();
        char last = p.charAt(len - 1);
        if(".?!".indexOf(last) == -1)
            return false;
        int count = 0;
        for(int i = 0; i < len; i++){
            char ch = p.charAt(i);
            if(".?!".indexOf(ch) >= 0)
                count++;
        }
        if(count != 2)
            return false;
        return true;
    }
    public static boolean inTaken(String t[], String w){
        boolean status = false;
        for(int i = 0; i < t.length; i++){
            if(w.equals(t[i])){
                status = true;
                break;
            }
        }
        return status;
    }
}
Location: Asansol, West Bengal, India

Comments

Post a Comment

Popular posts from this blog

Encrypt Program ISC Specimen 2023 Theory

-
A class Encrypt has been defined to replace only the vowels in a word by the next corresponding vowel and forms a new word, i.e. A → E, E  → I, I  → O, O  → U and U  → A. Example : Input: COMPUTER Output: CUMPATIR Some of the members of the class are given below: Class name : Encrypt Data members/instance variables : wrd: to store a word len: integer to store the length of the word newWrd: to store the encrypted word Methods/Member functions : Encrypt(): default constructor to initialize data members with legal initial values void acceptWord(): to accept a word in uppercase void freqVowCon(): finds the frequency of the vowels void nextVowel(): replaces only the vowels from the word stored in 'wrd' by the next corresponding vowel and assigns it to 'newWrd', with the remaining alphabets unchanged void disp(): displays the original word along with the encrypted word Specify the class Encrypt giving details of the constructor, void acceptWord(), void freqVowCon(), void ...
Read more

No Repeat Program ISC Computer Science 2022 Semester 2 Theory

-
Design a class NoRepeat which checks whether a word has no repeated alphabets in it. Example : COMPUTER has no repeated alphabets but SCIENCE has repeated alphabets. The details of the class are given below: Class name : NoRepeat Data members/instance variables : word: to store the word len: to store the length of the word Methods/Member functions : NoRepeat(String wd): parameterized constructor to initialize word = wd boolean check(): checks whether a word has no repeated alphabets and returns true else returns false void prn(): displays the word along with an appropriate message Specify the class NoRepeat, giving details of the constructor, boolean check() and void prn(). Define the main() function to create an object and call the functions accordingly to enable the task. import java.util.Scanner; class NoRepeat{     String word;     int len;     public NoRepeat(String wd){         word = wd;         len = word.le...
Read more

Bank Inheritance Program ISC Specimen 2023 Theory

-
A super class Bank has been defined to store the details of the customer in a bank. Define a subclass Interest to calculate the compound interest. The details of the members of both the classes are given below: Class name : Bank Data members/instance variables : name: to store the name of the customer accNo: integer to store the account number principal: to store the principal amount in decimals Methods/member functions : Bank(...): parameterized constructor to assign values to the data members void display(): to display the customer details Class name : Interest Data members/instance variables : rate: to store the interest rate in decimals time: to store the time period in decimals Methods/member functions : Interest(...): parameterized constructor to assign values to the data members of both the classes double calculate(): to calculate and return the compound interest using the formula: CI = P(1 + R / 100) N - P, where P is the principal, R is the rate and N is the time void displ...
Read more