COMPUTER SCIENCE PRACTICAL SOLVED QUESTIONS - ISC BOARD 2016
Question 1:
A Circular Prime is a prime
number that remains prime under cyclic shifts of its digits. When the leftmost
digit is removed and replaced at the end of the remaining string of digits, the
generated number is still prime. The process is repeated until the original
number is reached again.
A number is said to be prime if it has only two factors I and itself.
A number is said to be prime if it has only two factors I and itself.
Example:
131
311
113
Hence, 131 is a circular prime.
131
311
113
Hence, 131 is a circular prime.
Test your program with
the sample data and some random data:
Example 1
INPUT :N = 197
OUTPUT:
197
971
719
197 IS A CIRCULAR PRIME
OUTPUT:
197
971
719
197 IS A CIRCULAR PRIME
Example 2
INPUT :N = 1193
OUTPUT:
1193
1931
9311
3119
1193 IS A CIRCULAR PRIME
OUTPUT:
1193
1931
9311
3119
1193 IS A CIRCULAR PRIME
Example 3
INPUT :N = 29
OUTPUT:
29
92
29 IS NOT A CIRCULAR PRIME
OUTPUT:
29
92
29 IS NOT A CIRCULAR PRIME
Programming Code:
import java.util.*;
class CircularPrime_Q1_ISC2016
{
boolean isPrime(int n) // Function for
checking whether a number is prime or not
{
int c = 0;
for(int i = 1; i<=n; i++)
{
if(n%i == 0)
c++;
}
if(c == 2)
return true;
else
return false;
}
int circulate(int n) //Function for
circulating the digits to form new number
{
String s = Integer.toString(n);
String p = s.substring(1)+s.charAt(0);
int a = Integer.parseInt(p);
return a;
}
void isCircularPrime(int n) //Function to
check for circular prime
{
int f = 0,a = n;
do
{
System.out.println(a);
if(isPrime(a)==false)
{
f = 1;
break;
}
a = circulate(a);
}while(a!=n);
if(f==1)
System.out.println(n+" IS NOT A CIRCULAR
PRIME");
else
System.out.println(n+" IS A CIRCULAR
PRIME");
}
public static void main(String args[])
{
CircularPrime_Q1_ISC2016 ob = new CircularPrime_Q1_ISC2016();
Scanner sc = new Scanner(System.in);
System.out.print("Enter a number :
");
int n = sc.nextInt();
ob.isCircularPrime(n);
}
}
--------------------------*--------------------------
Question 2:
Write a program to
declare a square matrix A[][] of order (M x M) where ‘M’ must be greater than 3
and less than 10. Allow the user to input positive integers into this matrix.
Perform the following tasks on the matrix:
(a) Sort the non-boundary elements in ascending order using any
standard sorting technique and rearrange them in the matrix.
(b) Calculate the sum of both the diagonals.
(c) Display the original matrix, rearranged matrix and only the diagonal elements of the rearranged matrix with their sum.
(b) Calculate the sum of both the diagonals.
(c) Display the original matrix, rearranged matrix and only the diagonal elements of the rearranged matrix with their sum.
Test your program with
the sample data and some random data:
Example 1
INPUT :M = 4
9 2 1 5
8 13 8 4
15 6 3 11
7 12 23 8
OUTPUT:
ORIGINAL MATRIX
9 2 1 5
8 13 8 4
15 6 3 11
7 12 23 8
REARRANGED MATRIX
9 2 1 5
8 3 6 4
15 8 13 11
7 12 23 8
DIAGONAL ELEMENTS
9 5
3 6
8 13
7 8
SUM OF THE DIAGONAL
ELEMENTS = 59
Programming Code:
import java.util.*;
class SortNonBoundary_ISC2016
{
int A[][],B[],m,n;
void input() //Function for taking all the
necessary inputs
{
Scanner sc = new Scanner(System.in);
System.out.print("Enter the size of the
square matrix : ");
m=sc.nextInt();
if(m<4 || m>10)
{
System.out.println("Invalid Range");
System.exit(0);
}
else
{
A = new int[m][m];
n = (m-2)*(m-2);
B = new int[n]; //Array to store Non-Boundary
Elements
System.out.println("Enter the elements of
the Matrix : ");
for(int i=0;i<m;i++)
{
for(int j=0;j<m;j++)
{
System.out.print("Enter a value :
");
A[i][j]=sc.nextInt();
}
}
}
}
/* The below function stores Non-Boundary
elements
* from array A[][] to array B[] if s = 1
* else stores the Non-Boundary elements in
array A[][] from array B[]
*/
void convert(int s)
{
int x=0;
for(int i=0;i<m;i++)
{
for(int j=0;j<m;j++)
{
if(i != 0 && j != 0 && i !=
m-1 && j != m-1)
{
if(s==1)
B[x] = A[i][j];
else
A[i][j] = B[x];
x++;
}
}
}
}
void sortArray() //Function for sorting
Non-Boundary elements stored in array B[]
{
int c = 0;
for(int i=0; i<n-1; i++)
{
for(int j=i+1; j<n; j++)
{
if(B[i]>B[j])
{
c = B[i];
B[i] = B[j];
B[j] = c;
}
}
}
}
void printArray() //Function for printing the
array A[][]
{
for(int i=0;i<m;i++)
{
for(int j=0;j<m;j++)
{
System.out.print(A[i][j]+"\t");
}
System.out.println();
}
}
void printDiagonal() //Function for printing
the diagonal elements and their sum
{
int sum = 0;
for(int i=0;i<m;i++)
{
for(int j=0;j<m;j++)
{
if(i==j || (i+j)==m-1)
{
System.out.print(A[i][j]+"\t");
sum = sum + A[i][j];
}
else
System.out.print("\t");
}
System.out.println();
}
System.out.println("Sum of the Diagonal
Elements : "+sum);
}
public static void main(String args[])
{
SortNonBoundary_ISC2016 ob = new SortNonBoundary_ISC2016();
ob.input();
System.out.println("*********************");
System.out.println("The original
matrix:");
System.out.println("*********************");
ob.printArray(); //Printing the original array
ob.convert(1); //Storing Non-Boundary elements
to a 1-D array
ob.sortArray(); //Sorting the 1-D array (i.e.
Non-Diagonal Elements)
ob.convert(2); //Storing the sorted
Non-Boundary elements back to original 2-D array
System.out.println("*********************");
System.out.println("The Rearranged
matrix:");
System.out.println("*********************");
ob.printArray(); //Printing the rearranged
array
System.out.println("*********************");
System.out.println("The Diagonal
Elements:");
System.out.println("*********************");
ob.printDiagonal(); //Printing the diagonal
elements and their sum
}
}
Question 3:
Write a program to accept a sentence which may be terminated by
either’.’, ‘?’or’!’ only. The words may be separated by more than one blank
space and are in UPPER CASE.
Perform the following tasks:
(a) Find the number of words beginning and ending with a vowel.
(b) Place the words which begin and end with a vowel at the
beginning, followed by the remaining words as they occur in the sentence.
Test your program with the sample data and some random data:
Example
1
INPUT: ANAMIKA
AND SUSAN ARE NEVER GOING TO QUARREL ANYMORE.
OUTPUT: NUMBER
OF WORDS BEGINNING AND ENDING WITH A VOWEL= 3
ANAMIKA
ARE ANYMORE AND SUSAN NEVER GOING TO QUARREL
Example
2
INPUT: YOU
MUST AIM TO BE A BETTER PERSON TOMORROW THAN YOU ARE TODAY.
OUTPUT: NUMBER
OF WORDS BEGINNING AND ENDING WITH A VOWEL= 2
A
ARE YOU MUST AIM TO BE BETTER PERSON TOMORROW THAN YOU TODAY
Example
3
INPUT: LOOK
BEFORE YOU LEAP.
OUTPUT: NUMBER
OF WORDS BEGINNING AND ENDING WITH A VOWEL= 0
LOOK
BEFORE YOU LEAP
Example
4
INPUT: HOW
ARE YOU@
OUTPUT: INVALID
INPUT
Programming Code:
import java.util.*;
class ISC2016_Q3
{
boolean isVowel(String w) // Function to check
if a word begins and ends with a vowel or not
{
int l = w.length();
char ch1 = w.charAt(0); // Storing the first
character
char ch2 = w.charAt(l-1); // Storing the last
character
if((ch1=='A' || ch1=='E' || ch1=='I' ||
ch1=='O' || ch1=='U') &&
(ch2=='A' || ch2=='E' || ch2=='I' || ch2=='O' ||
ch2=='U'))
{
return true;
}
else
{
return false;
}
}
public static void main(String args[])
{
ISC2016_Q3 ob = new ISC2016_Q3();
Scanner sc = new Scanner(System.in);
System.out.print("Enter a sentence :
");
String s = sc.nextLine();
s = s.toUpperCase();
int l = s.length();
char last = s.charAt(l-1); // Extracting the
last character
/* Checking whether the sentence ends with '.'
or '?' or not */
if(last != '.' && last != '?' &&
last != '!')
{
System.out.println("Invalid Input. End a
sentence with either '.', '?' or '!' only");
}
else
{
StringTokenizer str = new StringTokenizer(s,"
.?!");
int x = str.countTokens();
int c = 0;
String w = "", a = "", b =
"";
for(int i=1; i<=x; i++)
{
w = str.nextToken(); // Extracting words and
saving them in w
if(ob.isVowel(w))
{
c++; // Counting all words beginning and
ending with a vowel
a = a + w + " "; // Saving all words
beginning and ending with a vowel in variable 'a'
}
else
b = b + w + " "; // Saving all other
words in variable 'b'
}
System.out.println("OUTPUT : \nNUMBER OF
WORDS BEGINNING AND ENDING WITH A VOWEL = " + c);
System.out.println(a+b);
}
}
}
excellant
ReplyDelete