BlueJ and Python For ICSE ISC and CBSE

BlueJ Program To Display Names With Surname in Alphabetical Order of Surnames

2025-01-07T19:26:00.005+05:30

import java.util.*;
class S
{
String name[], surname[];
int i,j,n;
String s;
Scanner sc=new Scanner(System.in);
public void show()
{
System.out.print("\nEnter the No of persons:");
n=sc.nextInt();
name=new String[n];
surname=new String[n];
for(i=0;i<n;i++)
{
System.out.print("\nName:");
name[i]=sc.next().toUpperCase();
System.out.print("\nSurname:");
surname[i]=sc.next().toUpperCase();
}
for(i=0;i<n;i++)
{
for(j=i+1;j<n;j++)
{
if(surname[i].compareTo(surname[j])>0)
{
s=surname[i];
surname[i]=surname[j];
surname[j]=s;
s=name[i];
name[i]=name[j];
name[j]=s;
}
}
}
System.out.println("Name with Surname in alphabetical order of surname");
for(i=0;i<n;i++)
System.out.println(name[i]+ " "+surname[i]);

}
}

BlueJ Program Eliminating Duplicate Letters From A Senrence

2024-12-23T18:03:00.004+05:30

import java.util.*;
class S
{
String str,str1;
int i,j,len,c;
char ch[],ch1;
Scanner sc=new Scanner(System.in);
public void show()
{
str1="";
c=0;
System.out.print("\nEnter the sentence:");
str=sc.nextLine().toLowerCase();
len=str.length();
ch=new char[len];
System.out.print("\nEntered sentence:"+str);
for(i=0;i<len;i++)
{
ch1=str.charAt(i);
for(j=0;j<c;j++)
{
if( str1.charAt(j)==ch1)
break;
}
if(j==c)
{
str1=str1+ch1;
ch[c++]=ch1;
}
}

System.out.print("\nSentence elimination of repeated letters:"+str1);

}
}

BlueJ Program To Display Words of A Sentence In Alphabetical Order

2024-12-16T19:08:00.002+05:30

import java.util.*;
class Sen
{
String arr[]=new String[15];
String str,t;
int i,j,c;
Scanner sc=new Scanner(System.in);
public void show()
{
System.out.print("\nEnter the sentence:");
str=sc.nextLine()+" ";
c=0;
while(true)
{
i=str.indexOf(' ');
if(i<0)
break;
arr[c++]=str.substring(0,i);
str=str.substring(i+1);
}

for(i=0;i<c-1;i++)
{
for(j=i+1;j<c;j++)
{
if(arr[i].compareToIgnoreCase(arr[j])>0)
{
t=arr[i];
arr[i]=arr[j];
arr[j]=t;
}
}
}

System.out.print("\nWords in alphabetical order\n");
for(i=0;i<c;i++)
{

System.out.print(" "+arr[i]);
}

}
}

BlueJ Program Upper Triangular Matrix Checking

2024-12-16T18:45:00.002+05:30

What is upper triangular matrix?

A matrix where all elements below the left diagonal are zero is called upper triangular matrix.

import java.util.*;
class UTMatrix
{
int arr[][];
int i,j,c,n;
Scanner sc=new Scanner(System.in);
public void show()
{
System.out.print("\nEnter the size of array:");
n=sc.nextInt();
arr=new int[n][n];
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
System.out.print("\nValue:");
arr[i][j]=sc.nextInt();
}
}

System.out.print("\nMatrix Values\n");
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
System.out.print(" "+arr[i][j]);
}
System.out.println();
}
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
if(arr[i][j]!=0 && j<i)
{
c=1;
break;
}
}
}
if(c==0)
System.out.print("\nThis is an upper traingular Matrix");
else
System.out.print("\nThis is not an upper traingular Matrix");
}
}

BlueJ Program To Check For 2-D Array With Binary Values

2024-12-10T19:25:00.002+05:30

What is array with binary values? If an array contains only 0 and 1, it is called binary array.

import java.util.*;
class Arr
{
int arr[][]=new int [3][4];
int i,j,c;
Scanner sc=new Scanner(System.in);
public void show()
{
c=0;
for(i=0;i<3;i++)
{
for(j=0;j<4;j++)
{
System.out.print("\nValue:");
arr[i][j]=sc.nextInt();
}
}

System.out.print("\nValues=");
for(i=0;i<3;i++)
{
for(j=0;j<4;j++)
{
System.out.print(" "+arr[i][j]);
}
System.out.println();
}
for(i=0;i<3;i++)
{
for(j=0;j<4;j++)
{
if(arr[i][j]!=0 || arr[i][j]!=1)
{
c=1;
break;
}
}
}
if(c==0)
System.out.print("\nArray with binary values");
else
System.out.print("\nArray with not binary values");
}
}

BlueJ Program Display The Number With Number of Factors Among Few Elements In An Array

2024-12-05T19:13:00.002+05:30

import java.util.*;
class Arr
{
int arr[];
int i,j,n,m,no,c,max;
Scanner sc=new Scanner(System.in);
public void show()
{
System.out.print("\nHow many elements:");
n=sc.nextInt();
arr=new int[n];
for(i=0;i<n;i++)
{
System.out.print("\nValue:");
arr[i]=sc.nextInt();
}
max=0;
System.out.print("\nValues=");
for(i=0;i<n;i++)
System.out.print(" "+arr[i]);
for(i=0;i<n;i++)
{
no=arr[i];
c=0;
for(j=1;j<=no;j++)
{
if(no%j==0)
c++;
}
if(c>max)
{
max=c;
m=no;
}
}

System.out.print("\nNumber with maximum factors="+m + " and number of factors "+max);
}
}

BlueJ Program Display Maximum Prime Value From An Array of 20 Elements

2024-12-05T18:41:00.005+05:30

import java.util.*;
class Arr
{
int arr[]=new int[20];
int i,j,n,c,max;
Scanner sc=new Scanner(System.in);
public void show()
{

for(i=0;i<20;i++)
{
System.out.print("\nValue:");
arr[i]=sc.nextInt();
}
max=0;
System.out.print("\nValues=");
for(i=0;i<20;i++)
System.out.print(" "+arr[i]);
for(i=0;i<20;i++)
{
n=arr[i];
c=0;
for(j=1;j<=n;j++)
{
if(n%j==0)
c++;
}
if(c==2 && n>max)
max=n;
}
if(max==0)
System.out.print("\nList has no Prime Number");
else
System.out.print("\nMax Prime "+max);
}
}

BlueJ Program On 2 D Array and Sorting

2024-11-05T04:00:00.000+05:30

Details of The Program: CLICK HERE

import java.io.*;

public class P

{

void sort(int arr[]) //Taking single dimension array as parameter

{

int i, j, size = arr.length, temp,flag;

/*'size' holds the number of values in the array */

for(i=0;i

{

flag=0;

/*Sorting using bubble sort technique, so if there is no exchange of values in one pass there is no need to run the loop */

for(j=0;j

{

if(arr[j]>arr[j+1])

{

flag=1; temp = arr[j];

arr[j] = arr[j+1];

arr[j+1] = temp;

}

if(flag==0)

break;

}

void show(int arr[][]) /*Taking 2D array as parameter*/

{

int i, j; for(i=0;i

{

for(j=0;j

/* arr[i] gives one row at a time. arr[i].length gives the number of values in each row */

{

System.out.print(arr[i][j]+"\t");

}

System.out.println();

}

void sort2D(int arr[][])

{

/* In java, array is an object, so here the function calling technique is call be reference means any changes made to the formal parameter in this function will be reflected in the original parameter.*/

int i, j;

for(i=0;i

{

sort(arr[i]);

}

public static void main(String args[])throws Exception

{

BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

P obj = new P(); int arr[][], m, n, i, j;

System.out.println("Enter the number of rows: ");

m =

Integer.parseInt(br.readLine());

System.out.println("Enter the number of columns: ");

n = Integer.parseInt(br.readLine());

if(m< 2 && m >9||n >9 && n< 2)

{

System.out.println("Matrix out of range"); System.exit(0);

}

arr = new int[m][n];

for(i=0;i<

{

System.out.println("Enter values for row no "+(i+1) + ":"); for(j=0;j

{

System.out.print("\nColumn No " + (j+1) + ":"); arr[i][j] = Integer.parseInt(br.readLine());

}

System.out.println("Original Matrix: ");

obj.show(arr);

obj.sort2D(arr);

System.out.println("Matrix after sorting rows: "); obj.show(arr);

}

Variable Description

Type	Name	Use
BufferedReader	br	Intakes limit from user
int	arr	2 D array to hold the values
Int	m	Holds no of rows in the array
int	n	Holds no of columns in the
		array

int	I,j	Loop Control Variable
int	size	Holds the no of elements in
		each row the array
Algorithm

Step 1: Create BufferedReader object ‘br’ and int type variables ‘n’ and 'm' to store the column and row size of the 2 D array.

Step 2: Values of ‘n’ and 'm' are checked for validity and if it is invalid, terminate the program otherwise create the 2 D array 'arr'.

Step 3: Stores the values in the two dimensional array 'arr'.

Step 4: Display the original array

Step 5: Pass the two dimensional array to function 'sort2D()' which sends each rows of the 2 d array to 'sort()' function which sorts the elements bubble sort technique.

Back To 2018 Computer Practical Paper: CLICK HERE

Program To Check Neon number Using BlueJ

2024-04-28T16:48:00.000+05:30

What is neon number:

A neon number is that where sum of digits of square of the number is equal to the number.
For example if the input number is 9, it's square is 9*9 = 81 and sum of the digits is 9. 9 is a neon number

Java Program to check neon number

Download eBook on BlueJ
import java.io.*;
class Neon
{
int n,sq,sum=0;
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
public void showNeon() throws Exception
{
System.out.println("Enter the number:");
n=Integer.parseInt(br.readLine());
sq=n*n;
while(sq>0)
{
sum=sum+sq%10;
sq=sq/10;
}
if(n==sum)
System.out.println(n+ " is a neon number");
else
System.out.println(n+ " is not a neon number");
}
public static void main(String args[])throws Exception
{
Neon ob=new Neon();
ob.showNeon();
}
}

BlueJ Program On Neon Numbers Between 1 And 500

import java.io.*;
class Neon
{
int i,sq,sum=0;
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
public void showNeon() throws Exception
{
for(i=1;i<=500;i++)
{
sum=0;
sq=i*i;
while(sq>=1)
{
sum=sum+sq%10;
sq=sq/10;
}
if(i==sum)
System.out.println(i+ " is a neon number");
}
}
public static void main(String args[])throws Exception
{
Neon ob=new Neon();
ob.showNeon();
}
}

Related Post: BlueJ Programs on Number

Solved ICSE 2010 Computer Application Paper

2024-04-28T15:27:00.000+05:30

This is ICSE 2010 Computer Application Paper. All the questions are solved here. This page may be helpful to ICSE students.

SECTION – A (40 Marks)

Question 1.

(a) Define the term Byte Code. [2]

Ans: Byte code is a highly optimized set of instructions designed to be executed by java runtime system.

( b) What do you understand by type conversion? [2]

Ans: Type conversion is the technique of one type of data into the other type. There are two type of type conversion – Implicit conversion and Explicit conversion. In implicit conversion, lower type data is automatically converted into upper side and in explicit conversion, one type of data is converted into the other type forcefully.

And: break and continue are two jump statements in java. In java, break can be used inside a loop and switch statement to send the control out of the loop body or switch body.

Continue can be used only inside a loop body and it starts premature iteration of the loop.

(d) What is Exception ? Name two Exception Handling Blocks. [2]

Ans: Exception is a run time abnormality caused due to many reasons. Two exception handling blocks are try…catch and throws.

(a) Write two advantages of using functions in a program. [2]

Ans: Two advantages of using functions in a program can be defined as it breaks the program into number of small modules and secondly it makes the program simple.

Question 2.

(a) State the purpose and return data type of the following String functions: [2]

(i) indexOf ( ).

(ii) CompareTo ( )

Ans: Return data type of both the functions are int. The function indexOf() checks the existence of any single character or a string in the invoking string object and returns the first occurrence location if found otherwise it returns -1.

compareTo () checks two strings for equality. If both the strings are same it returns 0. If the invoking string is greater than the argument string it returns greater than 0 otherwise it returns less than 0.

(b) What is the result stored in x, after evaluating the following expression [2]

int x = 5;

x = x++ *2 + 3 * –x;

Ans: -8

(a) Differentiate between static and non-static data members. [2]

Ans: static data members are class members and so only one copy of such members are created for number of objects of the class. The same static data member is shared by all objects.

For each objects of a class, separate copy of non-static data members are created so each object has it’s own copy of non-static data member.

(b) Write the difference between length and length ( ) functions. [2]

Ans: length is a data member of array and it holds the number of elements stored in the array. length () is a function of String class and return type of the function is int which denotes the number of characters in the string object.

Ans: private members are accessible within the class only where as protected members are accessible within the class as well as by sub classes.

Question 3

(a) What do you understand by data abstraction? Explain with an example.[2]

Ans: Data abstraction is the mechanism of binding data members and function members together so that data members are safe from unauthorized access. Function members acts on the data members and thus complexity of the program is reduced.

A car is an object which has many physical components which are the data members of the object. Different functions like brake, horn etc are working on the physical components and we are getting the result without knowing details about the mechanism.

(b) What will be the output of the following code?

(i) int m=2; [2]

int n=15;

for(int i = 1; i<5 i="" o:p="">

m++; --n;

System.out.println(“m=” +m);

System.out.println(“n=”+n);

Ans: m=6

n=14

(ii) char x = ‘A’ ; int m; [2]

m=(x==’a’) ? ‘A’ : ‘a’;

System.out.println(“m=”+m);

Ans: m=97

Programming Section

Question 4.

Write a program to perform binary search on a list of integers given below, to search for an element input by the user. If it is found display the element along with its position, otherwise display the message “Search element not found”. [15]

5,7,9,11,15,20,30,45,89,97

Ans:

import java.io.*;

class BSearch

{

int i,n,low,high,mid;

int arr[]={5,7,9,11,15,20,30,45,89,97};

BufferedReader br=new BufferedReader (new InputStreamReader (System.in));

public void input() throws Exception

{

System.out.println("Enter the value to search:");

n=Integer.parseInt(br.readLine());

search();

}

void search()

{

low=0;high=9;

while(low<=high)

{

mid=(low+high)/2;

if(arr[mid]==n)

break;

else if(arr[mid]>n)

high=mid-1;

else

low=mid+1;

}

if(low<=high)

System.out.println("Element Found.");

else

System.out.println("Search element not found.");

}

public static void main(String args[])throws Exception

{

BSearch ob=new BSearch();

ob.input();

}

Question 5

Define a class ‘Student‘ described as below: [15]

Data members/instance variables : name,age,m1,m2,m3 (marks in 3 subjects),

maximum, average

Member methods :

(i) A parameterized constructor to initialize the date members.

(ii) To accept the details of a student.

(iii) To compute the average and the maximum out of three marks.

(iv) To display the name, age, marks in three subjects, maximum and average.

Write a main method to create an object of a class and call the above member methods.

Ans:

import java.io.*;

class Student

{

String name;

int age,m1,m2,m3,maximum;

double average;

BufferedReader br=new BufferedReader (new InputStreamReader (System.in));

Student(String n)

{

name=n;

}

public void input() throws Exception

{

System.out.println("Enter the age of "+name + ":");

age=Integer.parseInt(br.readLine());

System.out.println("Enter the 1st subject marks of "+name + ":");

m1=Integer.parseInt(br.readLine());

System.out.println("Enter the 2nd subject marks of "+name + ":");

m2=Integer.parseInt(br.readLine());

System.out.println("Enter the 3rd subject marks of "+name + ":");

m3=Integer.parseInt(br.readLine());

}

void compute()

{

average=(double)(m1+m2+m3)/3;

if(m1>m2 && m1>m3)

maximum=m1;

else if(m2>m1 && m2>m3)

maximum=m2;

else

maximum=m3;

}

void show()

{

System.out.println("Name:"+name);

System.out.println("Age:"+age);

System.out.println("First Subject:"+m1);

System.out.println("Second Subject:"+m2);

System.out.println("Third Subject:"+m3);

System.out.println("Maximum marks:"+maximum);

System.out.println("Average marks:"+average);

}

public static void main(String args[])throws Exception

{

String n;

BufferedReader br=new BufferedReader (new InputStreamReader (System.in));

System.out.println("Name of the student:");

n=br.readLine();

Student ob=new Student(n);

ob.input();

ob.compute();

ob.show();

}

Question 6

Shasha Travels Pvt. Ltd. gives the following discount to its customers: [15]

Ticket amount Discount

Above Rs 70000 18%

Rs 55001 to Rs 70000 16%

Rs 35001 to Rs 55000 12%

Rs 25001 to Rs 35000 10%

less than Rs 25001 2%

Write a program to input the name and ticket amount for the customer and calculate the discount amount and net amount to be paid. Display the output in the following format for each customer :

SL. NO.	Name	Ticket charges	Discount	Net amount

(Assume that there are 15 customers, first customer is given the serial no (SlNo.) 1, next customer 2 ……… and so on.

import java.io.*;

class Fare

{

String name[]=new String[5];

int amount[]=new int[5];

int i;

double discount,net;

BufferedReader br=new BufferedReader (new InputStreamReader (System.in));

public void input() throws Exception

{

for(i=0;i<15 i="" o:p="">

{

System.out.println("Enter the name:");

name[i]=br.readLine();

System.out.println("Enter the amount for ticket in Rs.:");

amount[i]=Integer.parseInt(br.readLine());

}

void show()

{

System.out.println("SL. NO. Name Ticket charges Discount Net amount");

for(i=0;i<15 i="" o:p="">

{

if(amount[i]>70000)

{

discount= amount[i]*18.0/100;

net=amount[i]-discount;

}

else if(amount[i]>=55001 && amount[i]<=70000)

{

discount= amount[i]*16.0/100;

net=amount[i]-discount;

}

else if(amount[i]>=35001 && amount[i]<=55000)

{

discount= amount[i]*12.0/100;

net=amount[i]-discount;

}

else if(amount[i]>=25001 && amount[i]<=35000)

{

discount= amount[i]*10.0/100;

net=amount[i]-discount;

}

else

{

discount= amount[i]*2.0/100;

net=amount[i]-discount;

}

System.out.println((i+1)+ "\t\t"+name[i]+ " "+amount[i]+ " "+ discount+ " "+net);

}

public static void main(String args[])throws Exception

{

Fare ob=new Fare ();

ob.input();

ob.show();

}

Question 7

Write a menu driven program to accept a number and check and display whether it is a Prime Number or not OR an Automorphic Number or not. (Use switch-case statement). [15]

(a) Prime number : A number is said to be a prime number if it is divisible only by 1 and itself and not by any other number. Example : 3,5,7,11,13 etc.

(b) Automorphic number : An automorphic number is the number which is contained in the last digit(s) of its square.

Example: 25 is an automorphic number as its square is 625 and 25 is present as the last two digits.

import java.io.*;

class Library

{

public void automorphic(int n)

{

int no,digit=0,sq,rev=0;

no=n;

{

digit++;

no=no/10;

} while(no!=0);

sq=n*n;

{

rev=rev*10+sq%10;

sq=sq/10;

digit--;

if(digit==0)

break;

} while(true);

no=rev;

rev=0;

while(no!=0)

{

rev=rev*10+no%10;

no=no/10;

}

if(n==rev)

System.out.println(n+" is an Automorphic number");

else

System.out.println(n+" is not an Automorphic number");

}

public void prime(int n)

{

int i;

for(i=2;i

{

if(n%i==0)

break;

}

if (i==n)

System.out.println(n+" is a prime number");

else

System.out.println(n+" is not a prime number");

}

public static void main(String args[])throws Exception

{

BufferedReader br=new BufferedReader(new InputStreamReader(System.in));

int ch,n;

Library ob=new Library();

System.out.println("Enter 1 for automorphic number and 2 for prime number:");

ch=Integer.parseInt(br.readLine());

System.out.println("Enter the number:");

n=Integer.parseInt(br.readLine());

switch(ch)

{

case 1:

ob.automorphic(n);

break;

case 2:

ob.prime(n);

break;

default:

System.out.println("Wrong Choice:");

}

Question 8.

Write a program to store 6 element in an array P, and 4 elements in an array Q and produce a third array R, which does not contain common values of array P and Q. Display the resultant array [15]

EXAMPLE:

INPUT OUTPUT

P[ ] Q [ ] R [ ]

4 19 4

6 23 6

1 7 1

2 8 2

3 3

10 10

import java.io.*;

class Merge

{

int p[]=new int[6];
int q[]=new int[4];
int r[]=new int[10];
int i,j,x=0,y=0,k;
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));

public void takeValues() throws Exception
{
System.out.println("For 1st array:");

for(i=0;i< 6;i++)
{
System.out.println("Value:");
p[i]=Integer.parseInt(br.readLine());
}

System.out.println("For 2nd array:");

for(i=0;i< 4;i++)
{
System.out.println("Value:");
q[i]=Integer.parseInt(br.readLine());
}

System.out.print("First array:");

for(i=0;i< 6;i++)
System.out.print(" "+p[i]);

System.out.println();

System.out.print("Second array:");

for(i=0;i< 4;i++)
System.out.print(" "+q[i]);

for(i=0;i< 6;i++)
{
for(j=0;j< 4;j++)
{

if(q[j]==p[i])
break;
}

if(j==4)
{
r[x++]=p[i];
}

else
{
for(k=j;k< 3;k++)
{
q[k]=q[k+1];
}

y++;

}

}

for(i=0;i< 4;i++)
{
for(j=0;j< 10;j++)
{
if(q[i]==r[j])
break;
}

if(j==x)
{
r[x++]=q[i];
}
}
}

public void show()

{
System.out.println();
System.out.print("The resultant array:");
for(i=0;i< x;i++)
System.out.print(" "+r[i]);
}

public static void main(String args[])throws Exception
{
Merge ob=new Merge ();
ob.takeValues();
ob.show();
}
}

Question 9

Write a program to input a string in uppercase and print the frequency of each character. [15]

INPUT : COMPUTER HARDWARE

OUTPUT :

CHARACTERS FREQUENCY

A 2

C 1

D 1

E 2

H 1

M 1

O 1

P 1

R 3

T 1

U 1

W 1

import java.io.*;

class Frequency

{

String s;

int i,len,j,c;

char ch[],ch1;

BufferedReader br=new BufferedReader(new InputStreamReader(System.in));

public void takeString() throws Exception

{

System.out.println("Enter the sentence:");

s=br.readLine().toUpperCase();

ch=new char[s.length()];

}

public void show()

{

len=s.length();

for(i=0;i< len;i++)

ch[i]=s.charAt(i);

for(i=0;i< len-1;i++)

{

for(j=i+1;j< len;j++)

{

if(ch[i]>ch[j])

{

ch1=ch[i];

ch[i]=ch[j];

ch[j]=ch1;

}

ch1=ch[0];

c=1;

System.out.println("Characters Frequency");

for(i=1;i< len;i++)

{

if(ch1==ch[i])

c++;

else

{

System.out.println(ch1+ " \t\t\t\t"+c);

ch1=ch[i];

c=1;

}

public static void main(String args[])throws Exception

{

Frequency ob=new Frequency ();

ob.takeString();

ob.show();

}

BlueJ program on Pascal triangle using 2 d array

2024-04-28T12:09:00.000+05:30

We know that Java arrays are dynamic and 2 d array can be constructed with different number of columns. In this program we will create the 2 d array with 5 rows aned afterwards for the 1^st row number of columns will be 1, for the second rwo number of columns will be 3 and so on.

While creating the number of columns for each row of the 2 d array, the ist column and the last column of each row will be filled up with 1.

Next job is to fill up the vacant columns of rows starting from number 2 with previous rows values. And the sequence is like arr[i][j]=arr[i-1][j-1] + arr[i-1][j], arr[i][j+1]=arr[i-1][j] + arr[i-1][j+1]and so on. After filling up the 2 d array, display the 2 d array.

Here is the program:

class Pascal

{

int arr[][]=new int[5][];

int i,j,k;

Pascal()

{

arr[0]=new int [1];

arr[0][0]=1;

arr[1]=new int [2];

arr[1][0]=1;

arr[1][1]=1;

arr[2]=new int [3];

arr[2][0]=1;

arr[2][2]=1;

arr[3]=new int [4];

arr[3][0]=1;

arr[3][3]=1;

arr[4]=new int [5];

arr[4][0]=1;

arr[4][4]=1;

}

void show()

{

for(i=0;i< 5;i++)

{

for(k=i;k< 5;k++)

{

System.out.print(" ");

}

for(j=0;j< =i;j++)

{

System.out.print(arr[i][j]+ " ");

}

System.out.println();

}

void set()

{

for(i=2;i< 5;i++)

{

for(j=1;j< i;j++)

{

arr[i][j]=arr[i-1][j-1]+arr[i-1][j];

}

public static void main(String agrs[])

{

Pascal ob=new Pascal();

System.out.println(" Traingle with values at start and end of row only\n");

ob.show();

ob.set();

System.out.println(" Final array\n");

ob.show();

}

Related Post: BlueJ Programs on Numeric Array

Sort an array and display the elements in descending order along with its original index

2024-04-28T11:13:00.000+05:30

This is a BlueJ Program where the elements of an array will be displayed in descending order and the original index of the elements will also be displayed.

In this program, two numeric arrays are used - one to store the elements and the other to store the original index of the elements.

import java.util.*;

class Arrange

{

int i,j,temp,n;

int arr[],arrindex[];

Scanner sc=new Scanner(System.in);

public void takeValues()

{

System.out.print("\nHow many elements to store: ");

n=sc.nextInt();

arr=new int[n];

arrindex=new int [n];

for(i=0;i< n;i++)

{

System.out.print("\nValue: ");

arr[i]=sc.nextInt();

arrindex[i]=i; // storing the index of the entered value

}

public void showValues()

{

System.out.println("\nEntered Value");

for(i=0;i< n;i++)

System.out.print(" "+arr[i]);

for(i=0;i< n-1;i++)

{

for(j=i+1;j< n;j++)

{

if(arr[i]< arr[j])

{

temp=arr[i];

arr[i]=arr[j];

arr[j]=temp;

// Values Interchanged

temp=arrindex[i];

arrindex[i]=arrindex[j];

arrindex[j]=temp;

// indexes Interchanged

}

System.out.println("\nSorted Elements with Original Indexes");

for(i=0;i< n;i++)

System.out.println(arr[i] + " " + arrindex[i]);

}

public static void main(String args[])

{

Arrange ob=new Arrange();

ob.takeValues();

ob.showValues();

}

Related Post: BlueJ Programs on Numeric Array

BlueJ Program On Magic Number Checking

2024-04-28T06:22:00.000+05:30

Magic numbers are those numbers where sum of the digits when converted into a single digit becomes 1.

Examples of some of the magic numbers are 100, 37, 55, 127

100 while converted in to single digit becomes 1+0+0=1

37 while converted in to single digit becomes 3+7 = 10 = 1+0=1

import java.io.*;

class Max

{

BufferedReader br=new BufferedReader(new InputStreamReader(System.in));

int a;

int sum;

public void show()throws Exception

{

System.out.println("Enter the number:");

a=Integer.parseInt(br.readLine());

while(true)

{

sum=0;

if(a<10)

break;

while(a>0)

{

sum=sum+a%10;

a=a/10;

}

a=sum;

sum=0;

}

if(a==1)

System.out.println("The number is a magic number.");

else

System.out.println("The number is not a magic number.");

}

public static void main(String args[])throws Exception

{

Max ob=new Max();

ob.show();

}

Related Post: BlueJ Programs on Number

Download eBook on BlueJ

Sample output:

Enter the number:

127

The number is a magic number.

Enter the number:

The number is not a magic number.

Display Automorphic Numbers From 1 To Any Specific Range

2024-04-28T05:21:00.000+05:30

This is a BlueJ program which will take the upper range and will display all the automorphic numbers starting from 1 to the specific number.

import java.io.*;

class AutoM

{

int x,i,n,no,sqn,revNum=0,digit=0;

BufferedReader br=new BufferedReader(new InputStreamReader(System.in));

public void getNumber() throws Exception

{

System.out.println("Enter the upper range:");

x=Integer.parseInt(br.readLine());

for(int j=1;j<=x;j++)

{

n=j;

digit=0;

revNum=0;

no=n;

{

digit++;

no=no/10;

} while(no!=0);

sqn=n*n;

showR();

}

public void showR()

{

revNum=revNum*10+sqn%10;

sqn=sqn/10;

digit--;

if(digit==0)

break;

} while(true);

revNum=revNumerse(revNum);

if(n==revNum)

System.out.println(n+" is an Automorphic number");

}

private int revNumerse(int n)

{

int r=0;

while(n!=0)

{

r=r*10+n%10;

n=n/10;

}

return r;

}

public static void main(String args[])throws Exception

{

AutoM obj=new AutoM();

obj.getNumber();

}

Related Post: BlueJ Programs on Number

Twist Number Program Using BlueJ

2024-04-27T23:04:00.000+05:30

BlueJ Program on Twist Number checking. In this BlueJ program, the consecutive digits in a number will exchange their positions. If the number has odd number of digits then the last digit would remain the same

Example: Enter the Number: 123456
Original : 123456
Modified : 214365
(The above number has 06 Digits)

Enter the Number: 123
Original : 123
Modified : 213
(The above number has 03 Digits)

import java.io.*;
class Twist
{
int n,n1;
int i,len;
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
public void take() throws Exception
{
System.out.print("\nEnter the Number:");
n=Integer.parseInt(br.readLine());
}
int countDigits(int m)
{
int c=0;
for(int i=m;i> 0;i=i/10)
c++;
return c;
}
public void show()
{
System.out.println("Original Number:"+n);
System.out.println("Modified Number:"+n1);
}
public void exchange()
{
len=countDigits(n);
System.out.println("Length="+len);
if(len%2!=0)
n1=n;
else
{
for(int i=n;i> 0;i=i/100)
n1=n1*100+i%100;
n1=rev(n1);
}
}
private int rev(int x)
{
int r=0;
for(int i=x;i> 0;i=i/10)
r=r*10+i%10;
return r;
}
public static void main(String args[]) throws Exception
{
Twist ob=new Twist();
ob.take();
ob.exchange();
ob.show();
}
}

Related Post: BlueJ Programs on Number

ICSE Project On Hotel Reservation

2024-04-27T16:13:00.000+05:30

This is a program on hotel reservation and similar type of programs are needed by ICSE students. In this program three String type arrays are used - one to hold hotel details like hotel name, contact number, land mark and star separated by special characters (array hotels[]), another array named hotel_rooms[] to store name of hotel, rate chart of different categories again separated by special characters and finally the third array named hotel_amenities holds the amenities offered by different hotels.

User enters his / her choice according to land mark or star rating and the hotel details according to the choice will be displayed.,

import java.io.*;
class Hotel_Reservation_System
{
String hotels[]={"Trident Hotel#jaipur# Contact no.-6250021522##near Sagar Lake#5 Star Hotel",
"Umaid Bhawan Heritage House Hotel#Jaipur#Contact no.-9265510028# #near Jangleshwar Ji Temple#4 Star Hotel",
"Hotel Arya Niwas#Jaipur# Contact no.-6180054231#near St. Andrews Church#3 Star Hotel",
"Hotel Jaipur#jaipur#Contact no.-8974734255#near Bani Park #2 Star Hotel",
"Hotel Tiwari#Jaipur#Contact no.-8974734255#near Sindhi Camp#1 Star Hotel"};

String hotel_rooms[]={"Trident Hotel#Single 10000#Double 15000#Triple 16000#Quad 17000#Queen 18000#King 20000",
"Umaid Bhawan Heritage House#Single 2000#Double 3500#Triple 4000#Quad 5000#Queen 6000#King 5500",
"Hotel Arya Niwas#Single 1050#Double 1900#Triple 2500#Quad 3000#Queen 4000#King 4500",
"Hotel Jaipur#Single 950#Double 1000#Triple 1500#Quad 2050#Queen 3900#King 4000",
"Hotel Tiwari#Single 320#Double 420#Triple 590#Quad 780#Queen990#King 1000"};

String hotel_amenities[]={"Banquet Hall#Restaurant Cum Bar#An Incredible Pool#Complimentary Wi-Fi#A Business Center#Onsite Dining#Fitness Center#Room Service",
"Banquet Hall#Restaurant Cum Bar#An Incredible Pool#Complimentary Wi-Fi#Business Center#Onsite Dining#Fitness Center#Room Service",
"An Incredible Pool#Complimentary Wi-Fi#Business Center#Onsite Dining#Fitness Center#Room Service",
"Restaurant#Flat LCD TV#Rooms With Air Conditioning#Room Service",
"Clean Towels & Linens#TV#Self Care Products & Toiletries"};
String choice;
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));

public void welcome() throws IOException
{
System.out.println(" WELCOME TO JAIPUR\n\n\n\n");
System.out.println(" PINK CITY OF INDIA\n\n\n\n");
System.out.println("****************@@@@@@@@@@@@@@@@@@@@@@@@@@@@@**************");
System.out.println(" JAIPUR HOTEL RESERVING SERVICE\n\n\n\n");
System.out.println(" We provide all type of hotels at any location of Jaipur. You can choose according to your specifications\n"+
" and budget. \n\n\n Customer Satisfaction is our first priority\n\n");

System.out.println(" Press any key to enter the Booking Zone...........");
br.read();
home();
}

private void home() throws IOException
{
int ch;
System.out.println(" WELCOME TO HOTEL BOOKING ZONE");
while(true)
{
System.out.println("You can choose hotel according to STAR or Specific Land Mark. Press 1 for Star Wise Selection & 2 for Landmark:");
ch=Integer.parseInt(br.readLine());
if(ch==1 || ch==2)
break;
else
System.out.println(" ENTER YOUR CHOICE PROPERLY");
}
if(ch==1)
starHotels();
else
landMarkHotels();

}
private void landMarkHotels() throws IOException
{
int i,j,k,x=0,bb,rate=0;
String s,s1="", roomBooked="";
String str[]=new String[100];
System.out.println(" WE HAVE HOTELS WITH FOLLOWING LAND MARKS");
for(i=0;i<hotels.length;i++)
{
s=hotels[i];
j=s.lastIndexOf('#');
s=s.substring(0,j);
j=s.lastIndexOf('#');
s1=s.substring(j+1);
for(k=0;k<x;k++)
{
if(s1.equals(str[k]))
break;
}
if(k==x)
{
System.out.println(s1);
str[x++]=s1;
}
}
System.out.println("\nEnter your Choice:");
choice=br.readLine();
System.out.println("\nMadam/Sir You can choose hotel from the followings:");
for(i=0;i<hotels.length;i++)
{
s=hotels[i];
j=s.lastIndexOf('#');
s=s.substring(0,j);
j=s.lastIndexOf('#');
s1=s.substring(j+1);
if(s1.equalsIgnoreCase(choice))
{
while(true)
{
j=s.indexOf('#');
if(j<0)
break;
s1=s.substring(0,j);
s=s.substring(j+1);
System.out.print(s1+"***");
}
System.out.println("***"+s);
s=hotel_rooms[i];
while(true)
{
j=s.indexOf('#');
if(j<0)
break;
s1=s.substring(0,j);
s=s.substring(j+1);
System.out.print("***"+s1);
}
System.out.println("***"+s);
s=hotel_amenities[i];
while(true)
{
j=s.indexOf('#');
if(j<0)
break;
s1=s.substring(0,j);
s=s.substring(j+1);
System.out.print("***"+s1);
}
System.out.println("***"+s+"\n\n\n");
}
}
// END OF if(s1.equalsIgnoreCase(choice))
s=br.readLine().toUpperCase();// CHOOSEN HOTEL IS ENTERED
for(i=0;i<hotel_rooms.length;i++)
{
s1=hotel_rooms[i].toUpperCase();;
if(s1.indexOf(s)!=-1)
{
bb=i;/* HOLDS THE INDEX OF THE SELECTED HOTEL IN ALL THE THREE ARRAYS*/
while(true)
{
j=s1.indexOf('#');
if(j<0)
break;
s=s1.substring(0,j);
s1=s1.substring(j+1);
System.out.println(s);
}
System.out.println(s1);// HOTEL ROOM S ALONG WITH RENT DISPLAYED
System.out.print("\nChoose your Room:");
s=br.readLine().toUpperCase();
roomBooked=s;
j=hotel_rooms[bb].toUpperCase().indexOf(s);
if(j!=-1)
{
k=hotel_rooms[bb].indexOf(' ',j);
s=hotel_rooms[bb].toUpperCase().substring(k);
j=s.indexOf('#');
if(j!=-1)
s1=s.substring(0,j).trim();
else
s1=s.substring(0).trim();
//s=hotel_rooms[bb].substring(k+1,j);
rate=Integer.parseInt(s1);
}
}
break;
}
displayBooking(roomBooked,rate);
}
private void starHotels() throws IOException
{
int i,j,k,x=0,bb,rate=0;
String s,s1="", roomBooked="";
String str[]=new String[100];
System.out.println(" WE HAVE HOTELS WITH FOLLOWING STARS");
for(i=0;i<hotels.length;i++)
{
s=hotels[i];
j=s.lastIndexOf('#');
s1=s.substring(j+1);
for(k=0;k<x;k++)
{
if(s1.equals(str[k]))
break;
}
if(k==x)
{
System.out.println(s1);
str[x++]=s1;
}
}
System.out.println("\nEnter your Choice:");
choice=br.readLine();
System.out.println("\nMadam/Sir You can choose hotel from the followings:");
for(i=0;i<hotels.length;i++)
{
s=hotels[i];
j=s.lastIndexOf('#');
s1=s.substring(j+1);
if(s1.equalsIgnoreCase(choice))
{
while(true)
{
j=s.indexOf('#');
if(j<0)
break;
s1=s.substring(0,j);
s=s.substring(j+1);
System.out.print(s1+"***");
}
System.out.println("***"+s);
s=hotel_rooms[i];
while(true)
{
j=s.indexOf('#');
if(j<0)
break;
s1=s.substring(0,j);
s=s.substring(j+1);
System.out.print("***"+s1);
}
System.out.println("***"+s);
s=hotel_amenities[i];
while(true)
{
j=s.indexOf('#');
if(j<0)
break;
s1=s.substring(0,j);
s=s.substring(j+1);
System.out.print("***"+s1);
}
System.out.println("***"+s+"\n\n\n");
}
}
// END OF if(s1.equalsIgnoreCase(choice))
s=br.readLine().toUpperCase();// CHOOSEN HOTEL IS ENTERED
for(i=0;i<hotel_rooms.length;i++)
{
s1=hotel_rooms[i].toUpperCase();;
if(s1.indexOf(s)!=-1)
{
bb=i;/* HOLDS THE INDEX OF THE SELECTED HOTEL IN ALL THE THREE ARRAYS*/
while(true)
{
j=s1.indexOf('#');
if(j<0)
break;
s=s1.substring(0,j);
s1=s1.substring(j+1);
System.out.println(s);
}
System.out.println(s1);/* HOTEL ROOM S ALONG WITH RENT DISPLAYED*/
System.out.print("\nChoose your Room:");
s=br.readLine().toUpperCase();
roomBooked=s;
j=hotel_rooms[bb].toUpperCase().indexOf(s);
if(j!=-1)
{
k=hotel_rooms[bb].indexOf(' ',j);
s=hotel_rooms[bb].toUpperCase().substring(k);
j=s.indexOf('#');
if(j!=-1)
s1=s.substring(0,j).trim();
else
s1=s.substring(0).trim();

//s=hotel_rooms[bb].substring(k+1,j);
rate=Integer.parseInt(s1);
}
}
break;
}
displayBooking(roomBooked,rate);
}
private void displayBooking(String s, int rate) throws IOException
{
System.out.println("\nEnter Date of Boarding (DD/MM/YYYY):");
String day1=br.readLine();
System.out.println("\nEnter Date of Leaving The Hotel (DD/MM/YYYY):");
String day2=br.readLine();
System.out.println("\nEnter Number of Rooms Needed:");
String no1=br.readLine();
System.out.println("\nEnter Number of Persons:");
String no2=br.readLine();
System.out.println("\n\nBOOKING CONFIRMED:");
System.out.println("\n"+ no1 + " "+ s + " "+ "Room / Rooms booked for "+ no2 + " Number of Persons from \n"+ day1 + " to "+ day2);
System.out.println("\n Total Rental Charge Including GST Rs. "+ rate*Integer.parseInt(no1));
System.out.println("\n Room Numbers will be alloted at the time of boarding.");
System.out.println("\n Check In Time 12.00 noon and Check Out Time 11.00 AM");

}

}

C Language Recursive Program To Check Palindrome

2024-03-10T11:21:00.001+05:30

#include <stdio.h>
#include <string.h>

int rev(char [], int,int);

int main()
{
char ch[100];
printf("Enter a string:");
scanf("%s",ch);
printf("\nEntered string is %s",ch);
int x=rev(ch,0,strlen(ch)-1);
if(x==1)
printf("\nPalindrome");
else
printf("\nNot Palindrome");
return 0;
}

int rev(char ch[],int start,int end)
{

if(ch[start]!=ch[end])
return 0;
else if(start==end)
return 1;
start++;
end--;
rev(ch,start,end);
}

C Language Recursive Function Program To Reverse A String

2024-03-10T11:19:00.010+05:30

#include <stdio.h>
#include <string.h>

void rev(char [],int, int);

int main()
{ char ch[100];
printf("Enter a string:");
scanf("%s",ch);
printf("\nEntered string is %s",ch);
rev(ch,0,strlen(ch)-1);
return 0;
}

void rev(char ch[],int i,int end)
{
char c;
if(end<=i)
{
printf("\nReverse=%s",ch);
return ;
}
c=ch[i];
ch[i]=ch[end];
ch[end]=c;
i++;
end--;
rev(ch,i,end);
}

Java Program Pell Number Series

2024-01-30T19:53:00.001+05:30

What is the Pell series?

Pell series starts with the first term as 0 and the second term as 1. The next term will be an addition to the second last term and two times to the last term. Now, if we compute the third term it will be the sum of the second last term (0), and twice of the last term (21) is 2 (0+2).

The fourth term will be the sum of the second last term (1) and twice of the last term (22) is 5 (1+4).

We can find more terms using the same method.

Relation of Pell series number: T(n) = T(n-2) + 2T(n-1)

T(1) = 0

T(2) = 1

T(3) = 0+2*1 = 0+2 = 2

T(4) = 1+2*2 = 1+4 = 5

T(5) = 2+2*5 = 2+10 = 12

T(n) = T(n-2) + 2*T(n-1)

import java.util.*;

class Pell

{

Scanner sc=new Scanner(System.in);

void main()

{

int i,n,a=0,b=1,next;

System.out.print("\nHow many Elements:");

n=sc.nextInt();

System.out.print("Series as follows "+a+" "+b);

for(i=0;i<n-2;i++)

{

next=a+2*b;

System.out.print(" "+next);

a=b;

b=next;

}

Java Program Triangular Number Series

2024-01-30T19:45:00.004+05:30

The first 10 terms of the Triangular number series:

1 3 6 10 15 21 28 36 45 55

class Triangular

{

void main()

{

int i,n=1;

System.out.println("Series as follows ");

for(i=0;i<10;i++)

{

n=n+i;

System.out.print(" "+n);

n++;

}

2 D Array To Store Only Composite Numbers - BlueJ Program

2023-12-10T16:38:00.003+05:30

A class Composite contains a two-dimensional array of order [m x n]. The maximum values possible for both ‘m’ and ‘n’ is 20. Design a class Composite to fill the array with the first (m x n) composite numbers in column wise. [Composite numbers are those which have more than two factors.]The details of the members of the class are given below:

Class name: Composite

Data members/instance variables :arr[ ] [ ] :integer array to store the composite numbers column wise

m :integer to store the number of rows

n:integer to store the number of columns

Member functions/methods:

Composite(int mm, int nn ):to initialize the size of the matrix, m=mm and n=nn

int isComposite( int p ):to return 1 if the number is composite otherwise returns 0

void fill ( ):to fill the elements of the array with the first (m × n) composite numbers in column wise

void display( ):to display the array in a matrix form Specify the class Composite giving details of the constructor(int,int), int isComposite(int), void fill( ) and void display( ). Define a main( ) function to create an object and call all the functions accordingly to enable the task.

import java.util.*;
class Composite
{
int m,n,arr[][];
Scanner sc=new Scanner(System.in);
Composite(int mm, int nn)
{
m=mm;
n=nn;
arr=new int [m][n];
}
private int isComposite( int p )
{
int i;
for(i=2;i<p;i++)
{
if(p%i==0)
break;
}
if(i==p)
return 0;
else
return 1;
}
private void display()
{
int i,j;
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
{
System.out.print(" "+arr[i][j]);
}
System.out.println();
}
}
void fill ( )
{
int i,j;
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
{
System.out.print("\nEnter Number:");
int d=sc.nextInt();
if(isComposite(d)==1)
arr[i][j]=d;
else
{
System.out.print("\nEnter Composite Number "+d + " is not composite");
j--;
}
}
}
}
public static void main(String args[])
{
int m,n;
Scanner sc=new Scanner(System.in);
while(true)
{
System.out.print("\nEnter Row Number:");
m=sc.nextInt();
if(m>0 && m<=20)
break;
}
while(true)
{
System.out.print("\nEnter Column Number:");
n=sc.nextInt();
if(n>0 && n<=20)
break;
}
Composite ob=new Composite(m,n);
ob.fill();
System.out.print("\nFinal Matrix\n");
ob.display();
}
}

Java Program To Check Boring Number

2023-12-08T12:22:00.005+05:30

Write a program in java to accept a number from user and check whether the number us a boring number or not.

Boring number is a positive number having all the digits at even position in the number as even and the digits at odd position odd

import java.util.*;
class BoringNumber
{
int n,rev,f;
Scanner sc=new Scanner(System.in);
public void take()
{
System.out.print("\nEnter The Number:");
n=sc.nextInt();
display();
}
private void display()
{
rev=0;
f=1;
System.out.print("\nEntered Number is:"+n);
while(n>0)
{
rev=rev*10+n%10;
n=n/10;
}
while(rev>0)
{
int d=rev%10;
if(f%2!=d%2)
break;
rev=rev/10;
f++;
}
if(rev>0)
System.out.print("\nEntered Number is not a boring number");
else
System.out.print("\nEntered Number is a boring number");
}
public static void main(String args[])
{
BoringNumber ob=new BoringNumber();
ob.take();
}
}

Sample Input Output

Enter The Number:1234
Entered Number is:1234
Entered Number is a boring number

Enter The Number:1321
Entered Number is:1321
Entered Number is not a boring number

C Language Program Finding Factorial Value Using Recursive Function

2023-10-15T09:47:00.005+05:30

#include<stdio.h>

long int fact(int n);

int main() {

int n;

printf("Enter a positive integer: ");

scanf("%d",&n);

printf("Factorial of %d = %ld", n, fact(n));

return 0;

}

long int fact(int n) {

if (n==1)

return 1;

int y=fact(n-1);

return n*y;

}

Converting Non-Palindrome Word Into Palindrome

2023-10-01T07:52:00.001+05:30

Convert the non-palindrome words of the sentence into palindrome words by concatenating the word by its reverse (excluding the last character).

Example: The reverse word of HELP would be LEH (omitting the last alphabet) and by concatenating both, the new palindrome word is HELPLEH. Thus the word HELP becomes HELPLEH.

Note: The words which end with repeated alphabets, for example ABB would become ABBA and not ABBBA and XAZZZ becomes XAZZZAX.

import java.util.*;

class Ab

{

String str1,str2;

Scanner sc=new Scanner(System.in);

int c=0;

void show()

{

int len,i;

c=1;

System.out.print("\nEnter the Word:");

str1=sc.next();

if(notPalin(str1))

{

len=str1.length();

for(i=len-1;i>0;i--)

{

if(str1.charAt(i)==str1.charAt(i-1))

c++; /* 'c' marks the index where mismatch of characters happen */

}

str2=leftRev(str1.substring(0,str1.length()-c));

str1=str1+str2;

System.out.println("\nModified="+str1);

}

private boolean notPalin(String str1)

{

int i,len;

len=str1.length()-1;

for(i=0;i<=len;i++)

{

if(str1.charAt(i)!=str1.charAt(len-1))

break;

}

if(i<=len)

return true;

else

return false;

}

private String leftRev(String str1)

{

int i,len;

String str2="";

len=str1.length();

for(i=len-1;i>=0;i--)

str2=str2+str1.charAt(i);

return str2;

}

public static void main(String args[])

{

Ab obj=new Ab();

obj.show();

}

List Of BlueJ Number Programs For ICSE And ISC Students

2023-09-30T06:30:00.005+05:30

Programs on Numbers using Java language for ICSE and ISC students are posted here. The programs can be executed on BlueJ or any other editors. Here you will get links to number of programs along with explanation. Hope it will help students.

To view the programs, click on the links

All Combinations Of Consecutive Natural Numbers

Appending Sum and Product of Numbers

Arranging The Digits In Ascending Order

Armstrong Number

Armstrong Number Using Recursive Function

Armstrong Number (2)

Automorphic Number

Automorphic Number (2)

Boring Number Checking Program

Buzz Number

Consecutive Number Combinations

Decimal To Binary And Hexadecimal Conversion

Decimal to Roman Number Conversion

Different Combinations Of A Number

Digits Frequency In A Number

Disarium Number

Disarium Numbers upto 2000

Displaying date in text format from digit format value

Displaying Number In Words

Duck Number

Emirp Number

Evil Number Checking Program

An Evil number is a positive whole number which has even number of 1’s in its binary equivalent.
Example: Binary equivalent of 9 is 1001, which contains even number of 1’s.
Thus, 9 is an Evil Number.

A few Evil numbers are 3, 5, 6, 9....

First Digit Of Any Number

Harshad Number

Keith Number

LCM And GCD-HCF

Longest Gap Between Two Non Prime Numbers (Using Array)

Longest Gap Between Two Non Prime Numbers (Without Array)

Lowest Prime Digit In A Number

Neon Numbers Between 1 and 500

Number Conversion

Palindrome and Prime Number

Perfect Number

Perfect Number Checking Of A Number Or Its Nearest Number

Prime - Adam Number Checking Program

A Prime-Adam integer is a positive integer (without leading zeros) which is prime as well as an Adam number.

Prime number: A number which has only two factors, i,e 1 and the number itself.
Example: 2,3,5,7 etc

Adam number: The square of a number and the square of it's reverse are reverse to each other.

Example: If n=13 and reverse of 'n'=31 then square of 13 = 169 and square of 31 is 961 which is reverse of 169.

Thus 13 is an Adam number

Prime and Pal Prime Numbers

Pythagorean Triplets

Saddle number

Smith Number

A number is called Smith Number if sum of the digits of the number is equal to the sum of the digits of the prime factors of the number are equal.

Sample Input: 666
Sum of the digits: 6 + 6 + 6 = 18
Prime factors are: 2, 3, 3, 37
Sum of the digits of the prime factors: 2 + 3 + 3 + (3 + 7) = 18
Thus, 666 is a Smith Number.

Unusual Number Checking

Unusual number : In Mathematics, an unusual number is a natural number whose greatest prime factor is strictly greater than square root of n.

The first few unusual numbers are –

2, 3, 5, 6, 7, 10, 11, 13, 14, 15, 17, 19, 20, 21, 22, 23, 26, 28, 29, 31, 33, 34, 35, 37, 38, 39, 41, 42, 43, 44, 46, 47, 51

Ugly Number

Ugly numbers are positive numbers whose only prime factors are 2, 3 or 5. First 10 ugly numbers are 1, 2, 3, 4, 5, 6, 8, 9, 10, 12. By convention, 1 is included.

Test Date:Input an integer number: 235

Output : It is not an ugly number.

Weak Arm Number

To Get More Programs:

ISC Practical Papers With Solution

ISC Theoretical Papers With Solution

ICSE Theoretical Papers With Solution