ISC Computer 2012 Practical Paper Solved
Question : 1
Prime Palindrome Number ranges
between the integers M and N.
Sample
Input :
M
= 100
N
= 1000
Sample
Output :
THE
PRIME PALINDROME INTEGERS ARE :
101
131 151 181 191 313 353 373 383 727 757 787 797 919 929
FREQUENCY
OF PRIME PALINDROME INTEGERS : 15
//Publisher
: Sharma Tutorials Jamshedpur
//Author
: Shubham Kumar Sharma
//Uploaded
At : sharmatutorialsjsr.blogspot.com
import
java.util.*;
public
class Prime_Palindrome
{
int isPrime(int n)
{
int i,f=0,r=0;
for(i=1;i<=n;i++)
{
if(n%i==0)
f++;
}
if(f==2)
r=1;
return r;
}
int isPalindrome(int m)
{
int i,t,s=0,l,r=0;
t=m;
for(;t!=0;)
{
l=t%10;
s=s*10+l;
t=t/10;
}
if(s==m)
r=1;
return r;
}
public static void main()
{
Scanner in=new Scanner(System.in);
Prime_Palindrome ob=new
Prime_Palindrome();
int m,n,i,f=0;
System.out.println("Enter Starting
Range : ");
m=in.nextInt();
System.out.println("Enter Ending
Range : ");
n=in.nextInt();
if((m<3000)&&(n<3000))
{
System.out.println("THE PRIME
PALINDROME INTEGERS ARE : ");
for(i=m;i<=n;i++)
{
if((ob.isPrime(i)==1)&&(ob.isPalindrome(i)==1))
{
System.out.print(i+"
");
f++;
}
}
System.out.println();
System.out.println("FREQUENCY
OF PRIME PALINDROME INTEGERS : "+f);
}
else
System.out.println("OUT OF
RANGE");
}
}
Question : 2
To
arrange the words of a sentence in an alphabetical order.
Sample
Input :
SHUBHAM
RUNS SHARMA TUTORIALS JAMSHEDPUR.
Sample
Output :LENGTH : 5
REARRANGED
SENTENCE
JAMSHEDPUR
RUNS SHARMA SHUBHAM TUTORIALS
//Publisher
: Sharma Tutorials Jamshedpur
//Author
: Shubham Kumar Sharma
//Uploaded
At : sharmatutorialsjsr.blogspot.com
import
java.util.*;
public
class Arrange
{
public static void main()
{
Scanner in=new Scanner(System.in);
String s,w[],t,n="";
int l,i,j;
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("[.?! ]+");
l=w.length;
for(i=0;i<l-1;i++)
{
for(j=i+1;j<l;j++)
{
if(w[i].compareTo(w[j])>0)
{
t=w[i];
w[i]=w[j];
w[j]=t;
}
}
}
System.out.println("LENGTH :
"+l);
System.out.println("REARRANGED
SENTENCE");
for(i=0;i<l;i++)
{
n=n+w[i]+" ";
}
System.out.println(n);
}
else
System.out.println("INVALID
INPUT");
}
}
Question : 3
Inputs
a matrix of order M
N and displays original matrix, largest and
smallest number and arranged matrix in ascending order.
Sample
Input :
1 2 3 5
6 4 9 3
8 7 3 6
Sample
Output :
ORIGINAL
MATRIX
1 2 3 5
6 4 9 3
8 7 3 6
LARGEST
NUMBER : 9 IN ROW 1 AND COLUMN 2
SMALLEST
NUMBER : 1 IN ROW 0 AND COLUMN 0
REARRANGED
MATRIX
1 2 3 3
3 4 5 6
6 7 8 9
//Publisher
: Sharma Tutorials Jamshedpur
//Author
: Shubham Kumar Sharma
import
java.util.*;
public
class Matrix
{
public static void main()
{
Scanner in = new Scanner (System.in);
int m,n,i,j,t=0,r=0,c=0;
System.out.println("Enter no of
rows : ");
m=in.nextInt();
System.out.println("Enter no of
columns : ");
n=in.nextInt();
if((m>2)&&(m<20)&&(n>2)&&(n<20))
{
int a[][]=new int[m][n];
System.out.println("Enter
Elements in the matrix : ");
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
{
a[i][j]=in.nextInt();
}
}
System.out.println("ORIGINAL
MATRIX");
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
{
System.out.print(a[i][j]+"\t");
}
System.out.println();
}
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
{
if(a[i][j]>t)
{
t=a[i][j];
r=i;
c=j;
}
}
}
System.out.println("LARGEST
NUMBER : "+t+" IN ROW "+r+" AND COLUMN "+c);
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
{
if(a[i][j]<t)
{
t=a[i][j];
r=i;
c=j;
}
}
}
System.out.println("SMALLEST
NUMBER : "+t+" IN ROW "+r+" AND COLUMN "+c);
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
{
for(r=0;r<m;r++)
{
for(c=0;c<n;c++)
{
if(a[i][j]<a[r][c])
{
t=a[i][j];
a[i][j]=a[r][c];
a[r][c]=t;
}
}
}
}
}
System.out.println("REARRANGED
MATRIX");
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
{
System.out.print(a[i][j]+"\t");
}
System.out.println();
}
}
else
System.out.println("SIZE OUT OF
RANGE");
}
}
No comments:
Post a Comment