Fascinating Number program Solved ISC practical 2021 Question 1
Fascinating Number program Solved ISC…: solved Java program for ISC Class 12 Computer Science with complete BlueJ code, explanation and sample output.
Fascinating Number program
Frequency of letters
import java.util.*;
class Fascinating
{
void mergnum(int n)
{
int a = n*2;int mergnum;
int b = n*3;
String n1,n2,n3;String m;
n1 = Integer.toString(n);
n2 = Integer.toString(a);
n3 = Integer.toString(b);
m = n1+n2+n3;
mergnum = Integer.valueOf(m);
}
boolean isFacinating()
{
int c = 0;
int i = 0;
char ch[] = {'1','2','3','4','5','6','7','8','9'};
char temp = ch;
int flag = 0;
while(mergnum>0)
{ int rem = mergnum%10;
if(rem == (int)temp[i])
{
temp[i]=' ';
c++;
i++;
}
else
{
i++;
}
mergnum = mergnum/10;
if(c==9)
{
return true;
}
else
{
return false;
}
}
public static void main()
{
Fascinating obj = new Fascinating();
Scanner sc = new Scanner(System.in);
System.out.println("Enter the lower limit greter then 99");
int lo = sc.nextInt();
System.out.println("Enetr the upper limit less then 10000");
int ul = sc.nextInt();
int count = 0; System.out.println("THE FASCINATING NUMBERS ARE ");
if(ul<lo||ul>10000||lo<99)
{
System.out.println("INVALID INPUT");
}
else
{
for(int j = lo;j<ul;j++)
{
if(isFascinating(j))
{
if(count>0)
{
System.out.println(j);}
if(count==0)
{
System.out.println("NULL");}
}
count++;
System.out.println("THE FREQUENCY OF THE FASCINATING NUBERS IS : "+count);
}}}
http://www.youtube.com/trushnatej
Related Posts
Continue learning with these related articles

ISC Practical 2027: College Enrolment Code Validator and Stream Report – Algorithm and Java Program
Fully solved ISC Computer Science Practical 2027 question: validate college enrolment codes made of a stream, year and serial number, give the exact reason for each rejection, auto-correct lowercase streams and prepare a stream-wise report.

ISC Practical 2027: Digital Lock Security Code Analyzer – Algorithm and Java Program
Fully solved ISC Computer Science Practical 2027 number-logic question: for a 5 to 10 digit security code, find the first and last digits, odd and even position sums, product of non-zero digits, digit frequency and classify the code as STRONG, MODERATE or WEAK.

Boolean Algebra for ISC Class 12: Laws, Canonical SOP and POS, and Simplification
ISC Class 12 Computer Science notes on Boolean algebra: all the laws and theorems, duality, De Morgan's laws, minterms and maxterms, converting to canonical SOP and POS, and step-by-step algebraic simplification with solved examples.