BlueJ for ISCE Boards

Java programming comes naturally to some lucky few. But that's not the same for the majority of the population. Some need more help in understanding the concept than others. That's the reason why I created this blog. Going through my blog will help you get a better understanding of the concepts involved in Java programming.

This blog was made with ICSE students in mind. The programs I've written are the recurring questions in ICSE board exams. All the programming was written and compiled in BlueJ. In case you haven't got BlueJ to practise on, you can download it for free from here. Install the latest version of BlueJ and you're good to go.

Important programs to try out

 1. Factorial of a number

2. Prime Number

3. Palindrome

4. Automorphic Number

5. Bubble Sort

6. Selection Sort

After you gain enough confidence, you can try out unsolved programming questions which are available on the internet. In case you have any doubts regarding the subject, feel free to drop a comment.

Happy coding and best wishes for your exams. 


Comments

  1. Unknown20 September 2017 at 09:13

    Wonderful

    ReplyDelete
  2. Unknown15 February 2018 at 08:09

    Is this Piglatin program correct?
    ↓ ↓ ↓ ↓ ↓ ↓ ↓ ↓ ↓ ↓ ↓ ↓

    import java.io.*;
    class Piglatin
    {
    public static void main(String args[])throws IOException
    {
    BufferedReader br =new BufferedReader(new InputStreamReader(System.in));
    System.out.print("Enter any word : ");
    String s=br.readLine();
    String s1,s2,s3;
    s=s.toUpperCase();
    int l=s.length();
    int i;
    char ch;
    for(i=0; i<l; i++)
    {
    ch=s.charAt(i);
    }
    if(ch=='A'||ch=='E'||ch=='I'||ch=='O'||ch=='U')
    {
    break;
    }
    for(i=0; i<l; i++)
    {
    s1=s.charAt(0,i);
    s2=s.charAt(i);
    s3=s2+s1+"AY";
    }
    System.out.println("The piglatin of the word"+s+"is : "+3);
    }
    }





    ReplyDelete

Post a Comment

Popular posts from this blog

Automorphic number

/* Write a program to check whether an entered number is an automorphic number or not.  * A number is said to be an automorphic number if it is present in the last digits of its square  */ import java.io.*; class automorphic { public static void main()throws IOException { BufferedReader br=new BufferedReader(new InputStreamReader(System.in)); int m,b,p; double r=0; System.out.println("Enter a number"); int n=Integer.parseInt(br.readLine()); m=n; p=m*m; int c=0; do { c++; m=m/10; }while(m!=0); int q= p%(int)Math.pow(10,c); if(n==q) System.out.println(n+" is an Automorphic number"); else System.out.println(n+" is not an Automorphic number"); }}
Read more

Bubble sort

/*  *Write a program to implement bubble sort on a list of names and numbers according to user's choice  */ import java.io.*; class bubble_sort { public void main()throws IOException { BufferedReader br=new BufferedReader(new InputStreamReader(System.in)); System.out.println("Enter your choice \n 1.Sorting names \n 2.Sorting numbers"); int ch=Integer.parseInt(br.readLine()); switch(ch) { case 1:System.out.println("Enter number of names"); int n=Integer.parseInt(br.readLine()); String s[]=new String[n]; System.out.println("Enter names"); for(int i=0;i<n;i++) s[i]=br.readLine(); String temp=""; for(int i=0;i<n-1;i++) { for(int j=0;j<n-i-1;j++) { if(s[j].compareTo(s[j+1])>0) { temp=s[j]; s[j]=s[j+1]; s[j+1]=temp; }}} System.out.println("Sorted array"); for(int i=0;i<n;i++) System.out.println(s[i]+" "); break; case 2:System.out.println("Enter number of numbers"); in
Read more

Prime number

This is a Java program to check whether a given number is prime or not. A prime number is a non-negative integer which is divisible only by 1 and itself. For example, Five being divisible by only one and five, is a prime number. Six, on the other hand is divisible by one, two, three and six and hence is not a prime number. PROGRAM CODE import java.io.*; class prime { public void main()throws IOException { BufferedReader br=new BufferedReader(new InputStreamReader(System.in)); System.out.println("Enter a number"); int a=Integer.parseInt(br.readLine()); int flag=0;   for(int i=2;i<=a/2;i++)                                               { if (a%i==0) { flag=1; break;}} if(flag==0) System.out.println("PRIME"); else System.out.println("NOT PRIME"); }}
Read more