Skip to main content

ISC Program: Highest and Lowest ASCII code in lowercase and uppercase characters

 Write a program in Java to enter the string. Count and display:
The character with lowest ASCII code in lower case
The character with highest ASCII code in lower case
The character with lowest ASCII code in upper case
The character with highest ASCII code in upper case
Sample Output:
The character with lowest ASCII code in lower case: a
The character with highest ASCII code in lower case: y
The character with lowest ASCII code in upper case: E
The character with highest ASCII code in upper case: P



Solution:

import ISjava.util.Scanner;
class lowhighascii
{
    public static void main(){
        Scanner sc=new Scanner(System.in);
        System.out.println("Enter a sentence:");
        String s = sc.nextLine();
        int p=0,q=999,r=0,t=999;
        for(int i=0;i<s.length();i++)
        {
            char ch = s.charAt(i);
            if(Character.isUpperCase(ch))
            {
                p=Math.max(p,(int)ch);
                q=Math.min(q,(int)ch);
            }
            else if(Character.isLowerCase(ch)){
                r=Math.max(r,(int)ch);
                t=Math.min(t,(int)ch);
            }
        }
        System.out.println("The character with lowest ASCII code in lower case:"+(char)t);
        System.out.println("The character with highest ASCII code in lower case:"+(char)r);
        System.out.println("The character with lowest ASCII code in upper case:"+(char)q);
        System.out.println("The character with highest ASCII code in upper case:"+(char)p);
    }
}
Labels:

Popular posts from this blog

Panagram ISC 2025 Specimen Practical Paper

import java.util.*; class panagram //ISC 2025 Practical Question {     //str for storing the sentence     String str;     panagram()     {         str="";     }     void accept()     {         Scanner sc=new Scanner(System.in);         System.out.println("Enter a sentence:");         str=sc.nextLine();     }     void panagramcheck()     {         int letters[]=new int[26];          StringTokenizer st=new StringTokenizer(str);         while(st.hasMoreTokens())         {             String w = st.nextToken().toUpperCase();             for(int i=65;i<=90;i++)             {                 for(int j=...
Read more

Program in Java: ISC Program CellPhone Keystrokes

import java.util.Scanner; public class Keypad {     public static void main(String args[])     {         //Array to hold keystrokes for each letter         int keys[] = new int[26];         //intialise         keys['A'-'A']=1; //A         keys['B'-'A']=2; //B         keys['C'-'A']=3; //C         keys['D'-'A']=1; //D         keys['E'-'A']=2; //E         keys['F'-'A']=3; //F         keys['G'-'A']=1; //G         keys['H'-'A']=2; //H         keys['I'-'A']=3; //I         keys['J'-'A']=1; //J         keys['K'-'A']=2; //K         keys['L'-'A']=3; //L         keys['M'-'A']=1; //M         keys['N'-'A']=2; //N       ...
Read more

ISC Program: Predict day of the week from date

Algorithm : 1)Take the last two digits of the year. 2)Divide by 4, discarding any fraction. 3)Add the day of the month. 4)Add the month's key value: JFM AMJ JAS OND 144 025 036 146 5)Subtract 1 for January or February of a leap year. 6)For a Gregorian date, add 0 for 1900's, 6 for 2000's, 4 for 1700's, 2 for 1800's; for other years, add or subtract multiples of 400. 7)For a Julian date, add 1 for 1700's, and 1 for every additional century you go back. 8)Add the last two digits of the year. 9)Divide by 7 and take the remainder. Example : Let's take a date: 26/03/2027 Last two digit of the year = 27 Divide by 4 discard fraction = 27/4 = 6.75 = 6 Add day = 6 + 26 = 32 Month key = 4 + 32 = 36 Add year code = 36 + 6 = 42 Now add two digits of the first year = 42 + 27 = 69 Now get the remainder after dividing by 7 = 69%7=6 So 1 is Sunday so 6 is Friday So 27/03/2027 Program : import java.util.Scanner; public class daydate {     public static void main(String[] arg...
Read more