Vowels and Consonants ISC Computer Science 2015 Practical

-

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. Print the error message if the input does not terminate with '.' or '?'.

You can assume that no word in the sentence exceeds 15 characters, so that you get a proper formatted output.

Perform the following tasks:

(i) Convert the first letter of each word to uppercase.

(ii) Find the number of vowels and consonants in each word and display them with proper headings along with the words.

Test your program with the following inputs:

Example 1
INPUT: Intelligence plus character is education.
OUTPUT:
Intelligence Plus Character Is Education.

WordVowelsConsonants
Intelligence57
Plus13
Character36
Is11
Education54

Example 2
INPUT: God is great.
OUTPUT:
God Is Great.

WordVowelsConsonants
God12
Is11
Great23

Example 3
INPUT: All the best!
OUTPUT:
Invalid Input.

import java.util.Scanner;
import java.util.StringTokenizer;
class Find{
    public static void main(String[] args){
        Scanner in = new Scanner(System.in);
        System.out.print("Enter the sentence: ");
        String s = in.nextLine();
        char last = s.charAt(s.length() - 1);
        if(last != '.' && last != '?'){
            System.out.println("Invalid Input.");
            return;
        }
        String t = "";
        for(int i = 0; i < s.length(); i++){
            char ch = s.charAt(i);
            if(i == 0 || s.charAt(i - 1) == ' ')
                t += Character.toUpperCase(ch);
            else
                t += Character.toLowerCase(ch);
        }
        System.out.println(t);
        StringTokenizer st = new StringTokenizer(t, " .?");
        System.out.println("Words\tVowels\tConsonants");
        int count = st.countTokens();
        for(int i = 1; i <= count; i++){
            String w = st.nextToken();
            int c = 0;
            int v = 0;
            for(int j = 0; j < w.length(); j++){
                char ch = w.charAt(j);
                if(Character.isLetter(ch)){
                    if("AEIOUaeiou".indexOf(ch) >= 0)
                        v++;
                    else
                        c++;
                }
            }
            System.out.println(w + "\t" + v + "\t" + c);
        }
    }
}

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 nex
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.length();     }     public boolean check(){         for(int i = 0; i &l
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