ISC Computer 2016 Practical Paper Solved
Question :1
Inputs a number and check whether a
number is circular prime or not.
Sample
Input :
131
Sample
Output :
131
311
113
131
IS A CIRCULAR PRIME
//Publisher
: Sharma Tutorials Jamshedpur
//Author
: Shubham Kumar Sharma
//Uploaded
At : sharmatutorialsjsr.blogspot.com
import
java.util.*;
public
class Circular_Prime
{
public static void main()
{
Scanner in=new Scanner(System.in);
intn,d,i,r,c,j,f=0,pr=0,t;
System.out.print("Enter
your number : ");
n=in.nextInt();
t=n;
d=Integer.toString(n).length();
for(i=0;i<d;i++)
{
System.out.println(n);
r=n%(int)(Math.pow(10,d-1));
c=r*10+n/(int)(Math.pow(10,d-1));
for(j=1;j<=c;j++)
{
if(c%j==0)
f++;
}
if(f==2)
{
pr++;
f=0;
}
n=c;
}
if(pr==d)
System.out.println(t+"
IS A CIRCULAR PRIME");
else
System.out.println(t+"
IS NOT A CIRCULAR PRIME");
}
}
Question : 2
Inputs
a matrix of order M
M and displays original matrix, arranged
matrix in ascending order, elements of both the diagonal and sum of its
diagonals.
Sample
Input :
1 2 3 4 5
6 9 8 7 7
8 9 6 5 4
3 2 15 6 4
9 3 8 9 2
Sample
Output :
ORIGINAL
MATRIX
1 2 3 4 5
6 9 8 7 7
8 9 6 5 4
3 2 15 6 4
9 3 8 9 2
REARRANGED
MATRIX
1 2 3 4 5
6 2 5 6 7
8 6 7 8 4
3 9 9 15 4
9 3 8 9 2
DIAGONAL
ELEMENTS
1 5
2 6
7
9 15
9 2
SUM
OF THE DIAGONAL ELEMENTS : 56
//Publisher
: Sharma Tutorials Jamshedpur
//Author
: Shubham Kumar Sharma
//Uploaded
At : sharmatutorialsjsr.blogspot.com
import
java.util.*;
public
class Matrix_2
{
public static void main()
{
Scanner in=new Scanner(System.in);
intm,i,j,k,l,t,s=0;
System.out.println("Enter
size of matrix : ");
m=in.nextInt();
if((m>3)&&(m<10))
{
inta[][]=new
int[m][m];
intb[][]=new
int[m][m];
System.out.println("Enter
Elements in the matrix : ");
for(i=0;i<m;i++)
{
for(j=0;j<m;j++)
{
a[i][j]=in.nextInt();
}
}
System.out.println("ORIGINAL
MATRIX");
for(i=0;i<m;i++)
{
for(j=0;j<m;j++)
{
System.out.print(a[i][j]+"\t");
}
System.out.println();
}
for(i=1;i<m-1;i++)
{
for(j=1;j<m-1;j++)
{
for(k=1;k<m-1;k++)
{
for(l=1;l<m-1;l++)
{
if(a[i][j]<a[k][l])
{
t=a[i][j];
a[i][j]=a[k][l];
a[k][l]=t;
}
}
}
}
}
System.out.println("REARRANGED
MATRIX");
for(i=0;i<m;i++)
{
for(j=0;j<m;j++)
{
System.out.print(a[i][j]+"\t");
}
System.out.println();
}
System.out.println("DIAGONAL
ELEMENTS");
for(i=0;i<m;i++)
{
for(j=0;j<m;j++)
{
if((i==j)||((i+j)==(m-1)))
{
System.out.print(a[i][j]+"\t");
s=s+a[i][j];
}
else
System.out.print("\t");
}
System.out.println();
}
System.out.println("SUM
OF THE DIAGONAL ELEMENTS : "+s);
}
else
System.out.println("THE
MATRIX SIZE IS OUT OF RANGE");
}
}
Question : 3
Inputs
a sentence in upper case and display the number of words that starts and ends
with vowel. Also displays a new sentence containing all the words that starts
and ends with vowels followed by rest of the words.
Sample
Input :
ANISHA
AND ANAMIKA ARE READING THE PROGRAMS AT SHARMA TUTORIALS JAMSHEDPUR.
Sample
Output :
NUMBER
OF WORDS BEGINNING AND ENDING WITH A VOWEL : 3
NEW
STRING :
ANISHA
ANAMIKA ARE AND READING THE PROGRAMS AT SHARMA TUTORIALS JAMSHEDPUR
//Publisher
: Sharma Tutorials Jamshedpur
//Author
: Shubham Kumar Sharma
//Uploaded
At : sharmatutorialsjsr.blogspot.com
import
java.util.*;
public
class Sentence_2
{
public static void main()
{
Scanner in=new Scanner(System.in);
String
s,w[],v="",nv="",str;
char f,l;
inti,count=0;
System.out.println("Enter
Your Sentence : ");
s=in.nextLine();
if((s.charAt(s.length()-1)=='?')||(s.charAt(s.length()-1)=='.')||(s.charAt(s.length()-1)=='!'))
{
w=s.split("[.?! ]+");
for(i=0;i<w.length;i++)
{
f=w[i].charAt(0);
l=w[i].charAt(w[i].length()-1);
if(((f=='a')||(f=='e')||(f=='i')||(f=='o')||(f=='u')||(f=='A')||(f=='E')||(f=='I')||(f=='O')||(f=='U'))&&((l=='a')||(l=='e')||(l=='i')||(l=='o')||(l=='u')||(l=='A')||(l=='E')||(l=='I')||(l=='O')||(l=='U')))
{
count++;
v=v+w[i]+" ";
}
else
{
nv=nv+w[i]+"
";
}
}
str=v.trim()+"
"+nv.trim();
str=str.trim();
System.out.println("NUMBER
OF WORDS BEGINNING AND ENDING WITH A VOWEL : "+count);
System.out.println("NEW
STRING : \n"+str);
}
else
System.out.println("INVALID
INPUT");
}
}
