Question : 1

Given a square matrix M [ ] [ ] of order n. The maximum value possible for n is 10. Accept
three different characters from the keyboard and fill the array according to the instruction given
below.

Fill the upper and lower elements formed by the intersection of the diagonals by character 1.
Fill the left and right elements formed by the intersection of the diagonals by character 2.
Fill both the diagonals by character 3.

Output the result in format given below:

Example 1

ENTER SIZE : 4
INPUT : FIRST CHARACTER : *
SECOND CHARACTER : ?
THIRD CHARACTER : #

OUTPUT :

# * * #
? # # ?
? # # ?
# * * #

Example 2

ENTER SIZE : 5
INPUT : FIRST CHARACTER : $
SECOND CHARACTER : !
THIRD CHARACTER : @

OUTPUT :

@ $ $ $ @
! @ $ @ !
! ! @ ! !
! @ $ @ !
@ $ $ $ @

Example 3

ENTER SIZE : 65
OUTPUT : SIZE OUT OF RANGE

/**
* The class MatrixFill creates a matrix using 3 characters taken as inputs
* Upper and lower elements formed by the intersection of the diagonals are
filled by character 1.
* Left and right elements formed by the intersection of the diagonals are
filled by character 2.
* Both the diagonals are filled by character 3.
* @author : www.guideforschool.com
* @Program Type : BlueJ Program - Java
* @ISC Computer Science Practical Specimen Paper - Question 2
*/

import java.util.*;
class MatrixFill
{
public static void main(String args[])
{
Scanner sc = new Scanner(System.in);
System.out.print("Enter size of the matrix : ");
int n = sc.nextInt();

if(n<2 || n>10)
System.out.println("Size out of Range");
else
{
char A[][]=new char[n][n];
System.out.print("Enter the 1st character : ");
char c1 = sc.next().charAt(0);
System.out.print("Enter the 2nd character : ");
char c2 = sc.next().charAt(0);
System.out.print("Enter the 3rd character : ");
char c3 = sc.next().charAt(0);

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

{
for(int j=0; j<n; j++)
{
if(i==j || (i+j)==(n-1))
A[i][j] = c3; // Filling the diagonals with 3rd
character
else
A[i][j] = c2; // Filling all other positions with 2nd
character
}
}

for(int i=0; i<n/2; i++)

{
for(int j=i+1; j<n-1-i; j++)
{
A[i][j] = c1; // Filling the upper positions formed by
intersection of diagonals
A[n-1-i][j] = c1; // Filling the lower positions formed
by intersection of diagonals
}
}
 // Printing the Matrix
System.out.println("\nOutput : \n");
for(int i=0; i<n; i++)
{
for(int j=0; j<n; j++)
{
System.out.print(A[i][j]+" ");
}
System.out.println();
}
}
}
}

Output:

Enter size of the matrix : 7

Enter the 1st character : @
Enter the 2nd character : #
Enter the 3rd character : %

Output :

% @ @ @ @ @ %
# % @ @ @ % #
# # % @ % # #
# # # % # # #
# # % @ % # #
# % @ @ @ % #
% @ @ @ @ @ %

Question: 2
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

/**
* The class WordPotential inputs a sentence and arranges the words
* in ascending order of their potential
* @author : www.guideforschool.com
* @Program Type : BlueJ Program - Java
* @ISC Computer Science Practical Specimen Paper - Question 2
*/

import java.util.*;
class WordPotential
{
int findPotential(String s) // Function to find potential of a word
{
s = s.toUpperCase();
int p = 0, l = s.length();
char ch;
for(int i=0; i<l; i++)
{
ch = s.charAt(i);
p = p + (ch-64); // if ch = 'A', then 'A'-64 = ASCII value of 'A'
- 64 = 65-64 = 1
}
return p;
 }

// Function to sort the words in ascending order of their potential

void sortPotential(String w[], int p[])
{
int n = w.length, t1 = 0;
String t2 = "";

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

{
for(int j=i+1; j<n; j++)
{
if(p[i]>p[j])
{
t1 = p[i];
p[i] = p[j];
p[j] = t1;
t2 = w[i];
w[i] = w[j];
w[j] = t2;
}
}
}

printResult(w,p);
}

void printResult(String w[], int p[]) // Function to print the final

result
{
int n = w.length;
String ans = "";
for(int i=0; i<n; i++)
{
ans = ans + " " + w[i];
}
ans = ans.trim();
System.out.println("\nOutput\t\t : \t"+ans);
}

public static void main(String args[])

{
WordPotential ob = new WordPotential();
Scanner sc = new Scanner(System.in);

System.out.print("Enter a sentence : \t");

String s = sc.nextLine();

StringTokenizer str = new StringTokenizer(s," .,?!");

int n = str.countTokens();

String words[] = new String[n];

int potential[] = new int[n];
 for(int i=0; i<n; i++)
{
words[i] = str.nextToken(); // Saving words one by one in an
array
potential[i] = ob.findPotential(words[i]); // Saving potential of
every word
}

// Printing the words along with their potential

System.out.print("\nPotential\t : \t");
for(int i=0; i<n; i++)
{
System.out.println(words[i]+"\t= "+potential[i]);
System.out.print("\t\t\t");
}

ob.sortPotential(words,potential);
}
}

Output:

Enter a sentence : Look before you leap.

Potential : Look = 53
before = 51
you = 61
leap = 34

Output : leap before Look you

Enter a sentence : The sky is the limit.

Potential : The = 33
sky = 55
is = 28
the = 33
limit = 63

Output : is The the sky limit

 Question:3
Write a Program in Java to input a number and check whether it is an Evil Number or not.

Evil Number : An Evil number is a positive whole number which has even number of 1s in its
binary equivalent.

Example: Binary equivalent of 9 is 1001, which contains even number of 1s.

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

Design a program to accept a positive whole number and find the binary equivalent of the
number and count the number of 1s in it and display whether it is a Evil number or not with an
appropriate message. Output the result in format given below:

Example 1
INPUT : 15
BINARY EQUIVALENT : 1111
NO. OF 1s : 4
OUTPUT : EVIL NUMBER

Example 2
INPUT : 26
BINARY EQUIVALENT : 11010
NO. OF 1s : 3
OUTPUT : NOT AN EVIL NUMBER

/**
* The class EvilNumber inputs a number and checks whether it is an Evil
Number or not
* @author : www.guideforschool.com
* @Program Type : BlueJ Program - Java
* @ISC Computer Science Practical Specimen Paper - Question 1
*/
import java.util.*;
class EvilNumber
{
String toBinary(int n) // Function to convert a number to Binary
{
int r;
String s=""; //variable for storing the result

char dig[]={'0','1'}; //array storing the digits (as characters) in a

binary number system

while(n>0)
{
r=n%2; //finding remainder by dividing the number by 2
s=dig[r]+s; //adding the remainder to the result and
reversing at the same time
 n=n/2;
}
return s;
}

int countOne(String s) // Function to count no of 1's in binary number

{
int c = 0, l = s.length();
char ch;
for(int i=0; i<l; i++)
{
ch=s.charAt(i);
if(ch=='1')
{
c++;
}
}
return c;
}

public static void main(String args[])

{
EvilNumber ob = new EvilNumber();
Scanner sc = new Scanner(System.in);

System.out.print("Enter a positive number : ");

int n = sc.nextInt();

String bin = ob.toBinary(n);

System.out.println("Binary Equivalent = "+bin);

int x = ob.countOne(bin);
System.out.println("Number of Ones = "+x);

if(x%2==0)
System.out.println(n+" is an Evil Number.");
else
System.out.println(n+" is Not an Evil Number.");
}
}

Output:

Enter a positive number : 26

Binary Equivalent = 11010
Number of Ones = 3
26 is Not an Evil Number.

Enter a positive number : 420

Binary Equivalent = 110100100
Number of Ones = 4
420 is an Evil Number.

Enter a positive number : 659

Binary Equivalent = 1010010011
Number of Ones = 5
659 is Not an Evil Number.

Question:

The MOBIUS function M(N) for a natural number N is defined as follows:

M(N) = 1 if N = 1 [Condition 1]

M(N) = 0 if any prime factor of N is contained in N more than once [Condition

2]

M(N) = (-1)p if N is a product of p distinct prime factors [Condition 3]

Example :

M(78) = -1 ( for 78 = 2 * 3 * 13 M(78) = ( -1)3 = -1 )

M(34) = 1 ( for 34 = 2 * 17 M(34) = ( -1)2 = 1 )

M(12) = 0 ( for 12 = 2 * 2 * 3 M(12) = 0 for 2 appears two times)

M(17) = -1 ( for 17 = 17 M(17) = ( -1)1 = -1 )

Design a class MobiusFn to define Mobius function for a natural number n.

Class name : MobiusFn

Data members/Instance variables:

n : stores an integer number

Member functions:
MobiusFn() : default constructor
void input() : input value of n
int primeFac() : to check and count prime factors of n
void display() : to find and print values of Mobius function

Specify the class MobiusFn giving details of the constructors, void input(), int primeFac(),
and void display(). Also define the main function to create an object and call methods
accordingly to enable the task.
Programming Code:

/**
* The class MobiusFn inputs a number and calculates the value of Mobius
Function
* @author : www.guideforschool.com
* @Program Type : BlueJ Program - Java
* @Question Year : ISC Theory 1999
*/

import java.util.*;
class MobiusFn
{
int n;

MobiusFn()
{
n = 0;
}

void input()
{
Scanner sc = new Scanner(System.in);
System.out.print("Enter a number : ");
n = sc.nextInt();
}

/* The function primefac() either returns '0' if prime factors are

repeated
* or returns the no.of prime factors */
int primeFac()
{
int a=n, i=2, m=0, c=0, f=0;

while(a > 1) // loop to generate prime factors

{
c = 0; // variable to store frequency of every prime factor
while(a%i == 0) // if 'i' is a prime factor
{
c++; // counting frequency of 'i'
f++; // counting no of prime factors
a=a/i;
}
i++;

if(c > 1) // returning '0' if prime factors are repeated

return 0;
}
return f; // returning no. of prime factors
}

void display() // function to display value of mobius function

{
int mob,x;
if(n == 1) // condition 1
 mob = 1;
else
{
x = primeFac();
if(x == 0) // condition 2
mob = 0;
else // condition 3
mob = (int)Math.pow(-1,x);
}
System.out.println("Value of Mobius Function : "+mob);
}

public static void main(String args[])

{
MobiusFn ob = new MobiusFn();
ob.input();
ob.display();
}
}

Output:

Enter a number : 78
Value of Mobius Function : -1

Enter a number : 12
Value of Mobius Function : 0

Enter a number : 34
Value of Mobius Function : 1

Enter a number : 17
Value of Mobius Function : -1

Question:

Write a Program in Java to input a number and check whether it is a Pronic Number or
Heteromecic Number or not.
Pronic Number : A pronic number, oblong number, rectangular number or heteromecic number,
is a number which is the product of two consecutive integers, that is, n (n + 1).

The first few pronic numbers are:

0, 2, 6, 12, 20, 30, 42, 56, 72, 90, 110, 132, 156, 182, 210, 240, 272, 306, 342, 380, 420, 462
etc

/**
* The class HarshadNumber inputs a number and checks if it a Pronic Number or
not
* @author : www.guideforschool.com
* @Program Type : BlueJ Program - Java
*/

import java.util.*;
class PronicNumber
{
public static void main(String args[])
{
Scanner sc = new Scanner(System.in);

System.out.print("Enter a number : ");

int n = sc.nextInt();
int flag = 0;

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

{
if(i*(i+1) == n)
{
flag = 1;
break;
}
}

if(flag == 1)
System.out.println(n+" is a Pronic Number.");
else
System.out.println(n+" is not a Pronic Number.");
}
}

Output:

Enter a number : 110

110 is a Pronic Number.

Enter a number : 73
73 is not a Pronic Number.

Enter a number : 342

342 is a Pronic Number.

Enter a number : 15
15 is not a Pronic Number.

Question:

Write a Program in Java to input a number and check whether it is a Harshad Number or Niven
Number or not..

Harshad Number : In recreational mathematics, a Harshad number (or Niven number), is an

integer (in base 10) that is divisible by the sum of its digits.

Lets understand the concept of Harshad Number through the following example:

The number 18 is a Harshad number in base 10, because the sum of the digits 1 and 8 is 9
(1 + 8 = 9), and 18 is divisible by 9 (since 18 % 9 = 0)
The number 1729 is a Harshad number in base 10, because the sum of the digits 1 ,7, 2
and 9 is 19 (1 + 7 + 2 + 9 = 19), and 1729 is divisible by 19 (1729 = 19 * 91)
The number 19 is not a Harshad number in base 10, because the sum of the digits 1 and 9
is 10 (1 + 9 = 10), and 19 is not divisible by 10 (since 19 % 10 = 9)

The first few Harshad numbers in base 10 are:

1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 18, 20, 21, 24, 27, 30, 36, 40, 42, 45, 48, 50, 54, 60, 63, 70, 72, 80,
81, 84, 90, 100, 102, 108, 110, 111, 112, 114, 117, 120, 126, 132, 133, 135, 140, 144, 150, 152,
153, 156, 162, 171, 180, 190, 192, 195, 198, 200 etc.

/**
* The class HarshadNumber inputs a number and checks if it a Harshad Number
or not
* @author : www.guideforschool.com
* @Program Type : BlueJ Program - Java
*/

import java.util.*;
class HarshadNumber
{
public static void main(String args[])
{
Scanner sc = new Scanner(System.in);

System.out.print("Enter a number : ");

int n = sc.nextInt();
int c = n, d, sum = 0;

//finding sum of digits

 while(c>0)
{
d = c%10;
sum = sum + d;
c = c/10;
}

if(n%sum == 0)
System.out.println(n+" is a Harshad Number.");
else
System.out.println(n+" is not a Harshad Number.");
}
}

Output:

Enter a number : 195

195 is a Harshad Number.

Enter a number : 194

194 is not a Harshad Number.

Enter a number : 190

190 is a Harshad Number.

Enter a number : 111

111 is a Harshad Number.

Question:

Write a Program in Java to input a word and print its anagrams..

Note: Anagrams are words made up of all the characters present in the original word by re-
arranging the characters.

Example: Anagrams of the word TOP are: TOP, TPO, OPT, OTP, PTO and POT

/**
* The class Anagrams inputs a word and generates its anagrams
* @author : www.guideforschool.com
* @Program Type : BlueJ Program - Java
*/

import java.util.*;
class Anagrams
{
int c = 0;

void input()throws Exception

{
 Scanner sc = new Scanner(System.in);
System.out.print("Enter a word : ");
String s = sc.next();
System.out.println("The Anagrams are : ");
display("",s);
System.out.println("Total Number of Anagrams = "+c);
}

void display(String s1, String s2)

{
if(s2.length()<=1)
{
c++;
System.out.println(s1+s2);
}
else
{
for(int i=0; i<s2.length(); i++)
{
String x = s2.substring(i, i+1);
String y = s2.substring(0, i);
String z = s2.substring(i+1);
display(s1+x, y+z);
}
}
}

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

{
Anagrams ob=new Anagrams();
ob.input();
}
}

Output:

Enter a word : BACK

The Anagrams are :
BACK
BAKC
BCAK
BCKA
BKAC
BKCA
ABCK
ABKC
ACBK
ACKB
AKBC
AKCB
CBAK
CBKA
CABK
CAKB
CKBA
CKAB
KBAC
KBCA
KABC
KACB
KCBA
KCAB
Total Number of Anagrams = 24

Question:

Write a Program in Java to input a number and check whether it is a Fascinating Number or
not..

Fascinating Numbers : Some numbers of 3 digits or more exhibit a very interesting property.
The property is such that, when the number is multiplied by 2 and 3, and both these products are
concatenated with the original number, all digits from 1 to 9 are present exactly once, regardless
of the number of zeroes.

Lets understand the concept of Fascinating Number through the following example:

Consider the number 192,

192 x 1 = 192
192 x 2 = 384
192 x 3 = 576

Concatenating the results : 192384576

It could be observed that 192384576 consists of all digits from 1 to 9 exactly once. Hence, it
could be concluded that 192 is a Fascinating Number.

Some examples of fascinating Numbers are : 192, 219, 273, 327, 1902, 1920, 2019 etc.

/**
* The class FascinatingNumber inputs a number and checks if it a Fascinating
Number or not
* @author : www.guideforschool.com
* @Program Type : BlueJ Program - Java
*/

import java.util.*;
class FascinatingNumber
{
boolean isUnique(String q)
{
int A[] = {0,0,0,0,0,0,0,0,0,0}; //to store frequency of every digit
from '0' to '9'
int i, flag = 0;
char ch;
for(i=0; i<q.length(); i++)
{
ch = q.charAt(i);
 A[ch-48]++;
/* increasing A[5] if ch='5' as '5'-48 = 53-48=5
* (ASCII values of '0' to '9' are 48 to 57) */
}

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

{
//checking if every digit from '1' to '9' are present exactly
once or not
if(A[i]!=1)
{
flag = 1; //flag is set to 1 if frequency is not 1
break;
}
}

if(flag == 1)
return false;
else
return true;
}
public static void main(String args[])
{
Scanner sc = new Scanner(System.in);
FascinatingNumber ob = new FascinatingNumber();

System.out.print("Enter a number : ");

int n = sc.nextInt();
String p = Integer.toString(n); //converting the number to String

if(p.length()<3)
System.out.println("Number should be of atleast 3 digits.");

else
{
String s = Integer.toString(n*1) + Integer.toString(n*2) +
Integer.toString(n*3);
/* Joining the first, second and third multiple of the number
* by converting them to Strings and concatenating them*/
if(ob.isUnique(s))
System.out.println(n+" is a Fascinating Number.");
else
System.out.println(n+" is not a Fascinating Number.");
}
}
}

Output:

Enter a number : 273

273 is a Fascinating Number.

Enter a number : 853

853 is not a Fascinating Number.
Enter a number : 95
Number should be of atleast 3 digits.

Question:

Write a Program in Java to input a number and check whether it is a Keith Number or not.

Note:A Keith Number is an integer N with d digits with the following property:

If a Fibonacci-like sequence (in which each term in the sequence is the sum of the d previous
terms) is formed, with the first d terms being the decimal digits of the number N, then N itself
occurs as a term in the sequence.

For example, 197 is a Keith number since it generates the sequence

1, 9, 7, 17, 33, 57, 107, 197, ..

Some keith numbers are: 14 ,19, 28 , 47 , 61, 75, 197, 742, 1104, 1537

/**
* The class Keith inputs a number and checks whether it is a Keith Number or
not
* @author : www.javaforschool.com
* @Program Type : BlueJ Program - Java
*/

import java.io.*;
class Keith
{
public static void main(String args[])throws IOException
{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
System.out.print("Enter the number : "); //inputting the number
int n=Integer.parseInt(br.readLine());

int copy=n;
String s=Integer.toString(n);
int d=s.length(); //finding the number of digits (d) in the number
int arr[]=new int[n]; //array for storing the terms of the series

for(int i=d-1; i>=0; i--)

{
arr[i]=copy%10; //storing the digits of the number in the array
copy=copy/10;

int i=d,sum=0;
while(sum<n) //finding the sum till it is less than the number
{
sum = 0;
for(int j=1; j<=d; j++) //loop for generating and adding the previous
'd' terms
{
sum=sum+arr[i-j];
}
arr[i]=sum; //storing the sum in the array
i++;
}

/* When the control comes out of the while loop, either the
sum is equal to the number or greater than it */

if(sum==n) //if sum is equal to the number, then it is a Keith number

System.out.println("The number is a Keith Number");
else
System.out.println("The number is a not a Keith Number");
}
}

Output:

Enter the number : 197

The number is a Keith Number

Enter the number : 14

The number is a Keith Number

Enter the number : 53

The number is a not a Keith Number