Skip to main content

REQUESTED PROGRAM 1

PROGRAM:   REQUESTED  BY ANKUR ACHARYA.

ISC 2016 QUESTION

Write a program to accept a sentence which may be terminated by either ‘.’, ‘?’ or ‘!’ only. The words are separated with a blank space, and are in uppercase.

Perform the following:

Find the number of words beginning and ending with a vowel.
Place the words which begin and end with a vowel at the beginning, followed by the remaining words as they occur in the sentence.

Test your program with the sample data and some random data:

Example 1:
INPUT: ANAMIKA AND SUSAN ARE NEVER GOING TO QUARREL ANYMORE.
OUTPUT: NUMBER OF WORDS BEGINNING AND ENDING WITH A VOWEL: 3
ANAMIKA ARE ANYMORE AND SUSAN NEVER GOING TO QUARREL.

Example 2:
INPUT: YOU MUST AIM TO BE A BETTER PERSON TOMORROW THAN YOU ARE TODAY.
OUTPUT: NUMBER OF WORDS BEGINNING AND ENDING WITH A VOWEL: 2
A ARE YOU MUST AIM TO BE BETTER PERSON TOMORROW THAN YOU TODAY.

Example 3:
INPUT: LOOK BEFORE YOU LEAP.
OUTPUT: NUMBER OF WORDS BEGINNING AND ENDING WITH A VOWEL: 0
LOOK BEFORE YOU LEAP.

Example 4:
INPUT: HOW ARE YOU@
OUTPUT: Sentence must begin with ‘.’, ‘!’ or ‘?’.


SYNTAX


import java.io.*;
import java.util.*;
class Vowels_seperable
{
    public static void main(String args[])throws IOException
    {
        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
        String s,nstr="";int c=0;
        System.out.println("ENTER A STRING");
        s=br.readLine();
        Boolean flag1=false,flag2=false;
        s=s.trim();
        String vowel="",conso="";
        int l=s.length();
        s=s.toUpperCase();
        String s1= s.substring(0,l-1);
        if((s.charAt(l-1)=='.')||(s.charAt(l-1)=='?')||(s.charAt(l-1)=='!'))
        {
            String []a=s1.split(" ");
            for(int z=0; z<a.length;z++) {
                nstr=a[z];
                char ch=nstr.charAt(0);
                switch (ch){
                    case 'A': 
                    case 'E':
                    case 'I':
                    case 'O':
                    case 'U':flag1=true;
                    break;
                    default : flag1=false;
                }
                char ch1= nstr.charAt(nstr.length()-1);
                switch (ch1){
                    case 'A': 
                    case 'E':
                    case 'I':
                    case 'O':
                    case 'U':flag2=true;
                    break;
                    default : flag2=false;
                }
                if(flag1==true &&flag2==true){
                    vowel+=nstr+" ";c++;}
                else
                    conso+=nstr+" ";
            }
            String fin=vowel+conso;
            fin.trim();
            System.out.println("NUMBER OF WORDS STARTING AND ENDING WITH VOWELS: "+c);
            System.out.println(fin);
        }
        else System.out.println("SENTENCE MUST END WITH . ? or !");
    }}

TESTED OK.

Comments

Post a Comment

Popular posts from this blog

Arranging according to potential.

PROGRAM: Requested by Sir  Ankur Acharya   ARRANGING WORDS IN A STRING ACCORDING TO THEIR POTENTIAL The encryption of alphabets are to be done as follows: A = 1 B = 2 C = 3 . . . Z = 26 The potential of a word is found by adding the encrypted value of the alphabets. Example: KITE Potential = 11 + 9 + 20 + 5 = 45 Accept a sentence which is terminated by either “ . ” , “ ? ” or “ ! ”. Each word of sentence is separated by single space. Decode the words according to their potential and arrange them in ascending order. Output the result in format given below: Example 1 INPUT : THE SKY IS THE LIMIT. POTENTIAL : THE = 33 SKY = 55 IS = 28 THE = 33 LIMIT = 63 OUTPUT : IS THE THE SKY LIMIT Example 2 INPUT : LOOK BEFORE YOU LEAP. POTENTIAL : LOOK = 53 BEFORE = 51 YOU = 61 LEAP = 34 OUTPUT : LEAP BEFORE LOOK YOU SYNTAX import java.io.*; class Potential {     public static void main(String args[])throws IOException     {         BufferedReader br=new BufferedReader(new Inp
3 comments
Read more

SMITH NUMBER

PROGRAM: SMITH NUMBER A   Smith number  is a composite number, the sum of whose digits is the sum of the digits of its prime factors obtained as a result of prime factorization (excluding 1). The first few such numbers are 4, 22, 58, 85, 94, 121 ……………….. For Example 58=> 5+8=13 2+(2+9) of 29 =13 Since sum of digits=sum of digits of prime factors 58 is a SMITH NUMBER SYNTAX: import java.io.*; class smith_no { static int sum,sum1;     public static void main(String args[])throws IOException     {         BufferedReader br=new BufferedReader(new InputStreamReader(System.in));         int n;int c=0;         System.out.println("Enter a Number");         n=Integer.parseInt(br.readLine());         int n1=n;         while(n1!=0){         int d=n1%10;         sum1+=d;         n1=n1/10;}         for(int i=2;i<n;i++)         {             if(n%i==0)             {                 for(int j=2;j<i;j++)                 {                     if(i
Post a Comment
Read more

MAGICAL/ MAGIC NUMBER USING RECURSION

PROGRAM :  MAGICAL NUMBER BY RECURSION This  program  checks if a  number  is a  Magic number  in  JAVA . A  number  is said to be a  Magic number  if the sum of its digits are calculated till a single digit is obtained by recursively adding the sum of its digits. If the single digit comes to be 1 then the  number  is a  magic number . Example: 10999 => 1+0+9+9+9=28=>2+8=>10=>1+0= 1                  199    =>1+9+9 =>19=> 1+9=>10=>1+0= 1 SYNTAX import java.io.*; class magic  {    static int c;     public static void main(String arsg[])throws IOException     {         BufferedReader br=new BufferedReader(new InputStreamReader(System.in));         int n;int d=0;int m;         System.out.println("ENter a NUmber");         n=Integer.parseInt(br.readLine());         m=n;         while(n!=0)         {d=n%10;             n=n/10;             c++;         }         magical(m);              }     public static void magical(int x)
3 comments
Read more