Au t h o r : Vi n od od S Sii n gh gh We bs bs i t e : h t t p : / / k o l k at a t a ma t h s . y ol o l a s i t e . c om om F o r So l u t i o n s o f I SC COMPUT ER ER SCI ENCE PRACT I CAL S o f f o l l o w t h e l i n k s b e l o w:
pr evi ous y ear
Telephone Directory ~ ISC COMPUTER SCIENCE PRACTICAL SOLLVED 2000 KEITH NUMBER JAVA CODE ISC COMPUTER SCIENCE PRACTICAL– 2000 Days Elapsed, ISC JAVA PROGRAMS ISC COMPUTER SCIENCE PRACTICAL– 2000 DIAMOND SHAPE PATTERN ISC COMPUTER SCIENCE PRACTICALS 2008 ~ Matrix Sort and Largest two elements ISC COMPUTER SCIENCE PRACTICALS 2008 ~ Vowels & Words Count ISC COMPUTER SCIENCE PRACTICAL 2005 ~ WORD WOR D SORT on Length ISC COMPUTER SCIENCE PRACTICALS SOLVED ~ 2008 ~ SMITH Number ISC COMPUTER SCIENCE PTRACTCALS ~ 2014 Symmetric Matrix ISC COMPUTER SCIENCE PRACTICAL 1998 SPIRAL MATRIX using recursion in JAVA, Python and an d C++ ISC COMPUTER SCIENCE PRACTICAL Solved ~ 2004 2 004 ISC COMPUTER SCIENCE PRACTICAL 2014~ COMPOSITE MAGIC ISC Computer Science Practical 2014 solved ISC Computer Science Practicals: Solved 2010 Kaprekar's Number in JAVA: ISC Computer Science Practicals 2010 ISC COMPUTER SCIENCE PRACTICALS, 2013 ISC Computer Science Practicals, 2012 ISC Computer Science Practicals Solved, 2011 ISC Computer Science Practicals Solved, 2013 ISC Computer Science Practical Paper-2013 ISC Computer Science Practicals, 2012 Solved ISC Computer Science Practical Solved, 2011 ISC Computer Science Practical Solved, 2010 ISC Computer Science Practical 2013
ISC Computer Science Practical 2014 1. Question 1
A composite Magic number is a positive integer which is composite as well as a magic number. Composite number: A composite number is a number which has more than two factors. For example: Factors of 10 are: 1,2,5,10. Magic number: A Magic number is a number in which the eventual sum of the digit is equal to 1. For example: 28 = 2+8=10= 1+0=1 Accept two positive integers m and n, where m is less than n as user input. Display the number of composite magic integers that are in the range between m and n (both inclusive) and output them along with frequency, in the format specified below: Example: Input: m=10 n=100 OUTPUT: The composite magic numbers are 10,28,46,55,64,82,91,100 Frequency of composite magic numbers: 8 Input: m=120 n=90 OUTPUT: Invalid input
1. Question 2
Write a program to declare a square matrix A[][] of order MXM where M is an positive integer and represents row and column. M should be greater than 2 and less than 10.Accept 10.A ccept the value of M from user. Display an appropriate message for invalid input. Perform the following task: a) Display the original matrix b) Check if the given matrix is symmetric or not. If the element of the ith row and jth co lumn is same as element of the jth row and ith column,. c)Find the sum of the left and right diagonal of o f the matrix and display them
Example 1: INPUT: M=3 123 245 356 OUTPUT: Original matrix 123 245 356
The given matrix is symmetric Sum of the left diagonal=11 di agonal=11 Sum of the right diagonal=10 Example 2: INPUT: M=4 OUTPUT: Original matrix: 7892 4563 8531 7642
The given matrix is not symmetric Sum of the left diagonal=17 di agonal=17 Sum of the right disgonal=20
Example 3: INPUT: M=12 OUTPUT: Matrix size is out of range
1. Question 3
Write a program to accept a sentence which may be terminated by either ',', '?' or '!' only. Any other character may be ignored. The words may be separated by more than one blank space and are in upper case. Perform the following tasks: a) Accept the sentence and reduce all extra blank spaces between two words to a single blank space. b) Accept a word from the user which is a part of the sentence along with its position number and delete the word and display di splay the sentence
Example 1: INPUT: A MORNING WALK IS A IS BLESSING FOR THE WHOLE DAY. WORD TO BE DELETED: IS WORD POSITION IN THE SENTENCE: 6 OUTPUT:A MORNING WALK IS A BLESSING FOR THE WHOLE DAY.
Example 2: INPUT: AS YOU SOW, SO SO YOU REAP WORD TO BE DELETED: SO WORD POSITION IN THE SENTENCE: 4 OUTPUT:AS YOU SOW, SO YOU REAP
Example 3: INPUT: STUDY WELL ## OUTPUT:INVALID INPUT
ISC Computer Science Practical 2013 1. Question 1
An ISBN (International Standard Book Number) is a ten digit di git code which uniquely identifies a book. The first nine digits represent the Group, Publisher and Title of the book and the last
digit is used to check whehter ISBN is correct or not. Each of the first nine digits of the code can take a value between 0 and 9. Sometimes it is necessary necessary to make the last digit equal to ten; this is done by writing the last digit of the code as X. To verify an ISBN, calculate 10 times the first digit, plus 9 times the second digit, plus 8 times the third and so on until we add 1 time the last digit. If the final number leaves no remainder when divided by 11, the code is a valid ISBN.
For example:
1. 02011003311 = 10*0 + 9*2 + 8*0 + 7*1 + 6*1 + 5*0 + 4*3 + 3*3 + 2*1 + 1*1 = 55 Since 55 leaves no remainder when divisible by 11, hence it is a valid ISBN. Design a program to accept a ten digit code from the user. For an invalid inout, display an appropriate message. Verify the code for its validity in the format specified below: Test your program with sample data and some random data.
Example 1 INPUT CODE: 0201530821 OUTPUT: SUM = 99 LEAVES NO REMAINDER - VALID ISBN CODE
Example 2 INPUT CODE : 035680324 OUTPUT : INVALID INPUT
Example 1 INPUT CODE : 0231428031 OUTPUT : SUM = 122 LEAVES REMAINDER - INVALID ISBN CODE
2. Question 2 Write a program to declare a square matrix A[][] of order (M X M) where 'M' is the number of rows and the number of columns such that M must be greater than 2 and less than 20. Allow
the user to input integers into this matrix. Display appropriate error message for an invalid input. Perform the following tasks:
(a) Display the input matrix. (b) Create a mirror image of the inputted matrix. (c) Display the mirror image matrix.
Test your program for the following data and some random data:
Example 1 INPUT
OUTPUT
:
M = 3
4
16
12
8
2
14
6
1
3
4
16
12
8
2
14
6
1
3
:
ORIGINAL MATRIX
MIRROR IMAGE MATRIX
12
16
4
14
2
8
3
1
6
Example 2 INPUT
:
M = 22
OUTPUT
:
SIZE OUT OF RANGE
3. Question 3 A palindrome is a word that may be read the same way in either direction. Accept a sentence in UPPER CASE which is terminated by either ".", "?", or "!". Each wo rd of the sentence is separated by a single blank space. Perform the following taks:
(a) display the count of palindromic words in the sentence. (b) Display the palindromic words in the sentence.
Example of palindromic words:
MADAM, ARORA, NOON
Test your program with the sample data and some random data:
Example 1 INPUT
:
MOM AND DAD ARE COMING AT NOON
OUTPUT
:
MOM DAD NOON NUMBER OF PALINDROMIC WORDS : 3
Example 2
INPUT
:
OUTPUT
:
HOW ARE YOU? NO PALINDROMIC WORDS
ISC Computer Science Practical 2012
1. Question 1
A prime palindrome integer is a positive integer (without leading zeros) which is prime as well as a palindrome. Given two positive integers m and n, where m < n, write a pro gram to determine how many prime-palindrome integers integers are there in the range between m and n (both inclusive) and output them. The input contains two positive integers integers m and n where m < 3000 and n < 3000. Display the number of prime palindrome integers in the specified range along with their values in the format specified below:
Test your program with the sample data and some random data:
Example 1: INPUT: m=100 N=1000
OUTPUT: The prime palindrome p alindrome integers are: 101,131,151,181,191,313,351,373,383,727,757,787,797,919,929 Frequency of prime palindrome integers: 15
Example 2: INPUT: M=100 N=5000
OUTPUT: Out of range
2. Question 2 Write a program to accept a sentence as input. The words in the string are to be separated by a blank. Each word must be in upper case. The sentence is terminated by either '.','!' or '?'. Perform the following tasks:
1. Obtain the length of the sentence (measured in words)
2. Arrange the sentence in alphabetical order of the words.
Test your program with the sample data and some random data:
Example 1: INPUT: NECESSITY IS THE MOTHER OF INVE NTION. OUTPUT: Length: 6 Rearranged Sentence: INVENTION IS MOTHER NECESSITY OF THE
Example 2: INPUT: BE GOOD TO OTHERS. OUTPUT: Length: 4 Rearranged Sentence: BE GOOD OTHERS TO
3. Question 3 Write a program to declare a matrix A [][] of order (MXN) where 'M' is the number of rows and 'N' is the number of columns such that both M and N must be greater than 2 and less than 20. Allow the user to input integers into this matrix. Perform the following tasks on the matrix:
1. Display the input matrix 2. Find the maximum and minimum value in the matrix and display them along with their position. 3. Sort the elements of the matrix in ascending order using any standard sorting technique and rearrange them in the matrix.
Output the rearranged matrix.
Sample input Output INPUT: M=3 N=4 Entered values: 8,7,9,3,-2,0,4,5,1,3,6,-4 Original matrix:
8793 -2 0 4 5 1 3 6 -4
Largest Number: 9 Row: 0 Column: 2 Smallest Number: -4 Row=2 Column=3
Rearranged matrix:
-4 -2 0 1 3345 6789
ISC Computer Science Practical 2011 1. Question 1
Write a program to input a natural number less than 1000 and display it in words. Test your program on the sample data and some random data.
Sample input and output of the program.
Input: 29 Output: TWENTY NINE
Input: 17001 Output: OUT OF RANGE
Input: 119 Output: ONE HUNDRED AND NINETEEN
Input: 500 Output: FIVE HUNDRED
2. 3. Question 2 Encryption is a technique of coding messages to maintain their secrecy. A String array of size 'n' where 'n' is greater than 1 and less than 10, stores single sentences (each sentence ends with a full stop) in each row of the array.
Write a program to accept the size of the array.
Display an appropriate message if the size is not satisfying the given condition.
Define a string array of o f the inputted size and fill it with sentences row-wise.
Change the sentence of the odd rows with an encryption of two characters ahead of the original character. Also change the sentence of the even rows by storing the sentence in reverse order.
Display the encrypted sentences sentences as per the sample data given below.
Test your program on the sample data and some random data.
Input: n=4
IT IS CLOUDY. IT MAY RAIN. THE WEATHER IS FINE. IT IS COOL. Output: KV KU ENQWFA. RAIN MAY IT. VJG YGCVJGT KU HKPG. COOL IS IT.
Input: n=13 Output: INVALID ENTRY
4. Question 3 Design a program which accepts your date o f birth in dd mm yyyy format. Check whether the date entered is valid or not. If it is valid, display "VALID DATE", also compute and display the day number of the year for the date of birth. bi rth. If it is invalid, display "INVALID DATE" and then terminate the program.
Testing of the program
Input: Enter your date of birth in dd mm yyyy format 05 01 2010 Output: VALID DATE 5
Input: Enter your date of birth in dd mm yyyy format 03 04 2010 Output: VALID DATE 93
Input: Enter your date of birth in dd mm yyyy format 34 06 2010 Output: INVALID DATE
ISC Computer Science Practical 2010 1. Question 1
A bank intends i ntends to design a program to display the denomination of an input amount, upto 5 digits. The available denomination with the bank are of rupees 1000,500,100,50,20,10,5,2 and 1.
Design a program to accept the amount from the user and display the b reak-up in descending
order of denominations. (i,e preference should be given to the highest denomination denomination available) along with the total number of notes. [Note: only the denomination used should be displayed]. Also print the amount in words according to the digits.
Example 1:
INPUT: 14836
OUTPUT: ONE FOUR EIGHT THREE SIX DENOMINATION: 1000 X 14 =14000 500 X 1 =500 100 X 3 =300 50 X 1 =50 5 X 1 =5 1 X 1 =1
EXAMPLE 2:
INPUT: 235001 OUTPUT: INVALID AMOUNT
2. 3. Question 2 Given the two positive integers p and q, where p < q. Write a p rogram to determine how many kaprekar numbers are there in the range between 'p' and 'q'(both inclusive) and output them.About 'kaprekar' number:
A posotive whole number 'n' that has 'd ' number of digits is squared and split into 2 pieces, a right hand piece that has 'd' digits and a left hand piece that has remaining 'd' or 'd-1' digits. If sum of the pieces is equal eq ual to the number then it's a kaprekar number.
SAMPLE DATA:
INPUT: p=1 Q=1000
OUTPUT:
THE KAPREKAR NUMBERS ARE: 1,9,45,55,99,297,999
FREQUENCY OF KAPREKAR NUMBERS IS:8
4. 5. Question 3 Input a paragraph containing 'n' number of sentences where (1<=n<=4). The words are to be separated with single blank space and are in upper case. A sentence may be terminated either with a full stop (.) o r question mark (?). Perform the followings:
(i) Enter the number of sentences, if it exceeds the limit show a message. (ii) Find the number of words in the paragraph (iii) Display the words in ascending order with frequency. frequency.
Example 1:
INPUT: Enter number of sentences: sentences: 1 Enter sentences: TO BE OR NOT TO BE.
OUTPUT: Total number of words: 6
WORD
FREQUENCY
OR
1
NOT
1
TO
2
BE
2
Example 2:
INPUT: Enter number of o f sentences: 3 Enter sentences: THIS IS A STRING PROGRAM. IS THIS EASY? YES, IT IS.
OUTPUT: Total number of words: 11
WORD
FREQUENCY
A
1
STRING
1
PROGRAM
1
EASY
1
YES
1
IT
1
THIS
2
IS
3
ISC Computer Science Practical 2009 1. Question 1
Design a program to accept a day number (between 1 and 366), year (in 4 digits) from the user to generate and display the corresponding date. Also accept 'N' (1<=N<=100) from the user to compute and display the future date corresponding to 'N' days after the generated date. Display error message if the value of the day number, year and N are not within the limit or not according to the condition specified. Test your program for the following data and some random data.
Example:
INPUT : DAY NUMBER : 233 YEAR : 2008 DATE AFTER(N) : 17 OUTPUT: 20TH AUGUST 2008 DATE AFTER 17 DAYS : 6TH SEPTEMBER 2008 INPUT : DAY NUMBER : 360 YEAR : 2008 DATE AFTER(N) : 45 OUTPUT: 25TH DECEMBER 2008 DATE AFTER 45 DAYS : 8TH FEBRUARY 2009
2. 3. Question 2 Write a program to declare a matrix A[ ][ ] of order (m*n) where 'm' is the number of rows and n is the number of columns such that both m and n must be greater than 2 and less than 20. Allow the user to input i nput positive integers into this matrix. Perform the following tasks on the matrix:
(a) Sort the elements of the outer row and column elements in ascending order using any standard sorting technique. (b) Calculate the sum of the outer row and column elements. (c) Output the original matrix, rearranged matrix, and only the boundary elements of the rearranged array with their sum.
Test your program for the following data and some random data.
1. Example : INPUT : M=3, N=3 1
7
4
8
2
5
6
3
9
OUTPUT : ORIGINAL MATRIX : 1
7
4
8
2
5
6
3
9
REARRANGED MATRIX : 1
3
4
9
2
5
8
7
6
BOUNDARY ELEMENTS : 1
3
9 8
4 5
7
6
SUM OF OUTER ROW AND OUTER COLUMN = 43
4. 5. Question 3 Read a single sentence which terminates with a full stop(.). T he words are to be separated with a single blank space and are in lower case. Arrange the words contained in the sentence according to the length of the words in ascending order. If two words are of the same length then the word occurring first in the input sentence should come first. For both, input and output the sentence must begin in upper case.
Test your program for the following data and some random data. INPUT : The lines are printed in reverse order. OUTPUT : In the are lines order printed reverse.
INPUT : Print the sentence in ascending order. OUTPUT : In the print order sentence ascending.
ISC Computer Science Practical 2008 1. Question 1
A smith number is a composite number, the sum of whose digits is the sum of the digits of its prime factors obtained as a result of prime factorization factorization (excluding 1). The first few such numbers are 4, 22, 27, 58, 85, 94, 121.....
Example 1.
666 Prime factors are 2, 3, 3 and 37 Sum of the digits are (6+6+6) = 18 Sum of the digits of the factors (2+3+3+(3+7) = 18 Sample data: Input 94 Output SMITH Number Input 102 Output NOT SMITH Number
2. 3. Question 2 A sentence is terminated by either ".", "!" or "?" followed by a space. Input a piece of text consisting of sentences. Assume Assume that there will be a maximum of 10 sentences in a block. Write a program to: (i) Obtain the length of o f the sentence (measured in words) and the frequency of vowels in each sentence. (ii) Generate the output as shown below using the given data
Sample data: INPUT HELLO! HOW ARE YOU? HOPE EVERYTHING IS FINE. BEST OF LUCK. OUTPUT Sentence
No. of Vowels
No. of words
----------------------------------------------------------------------------------------------------------------1
2
1
2
5
3
3
8
4
4
3
3
Sentence
No. of words/vow words/vowels els
----------------------------------------------------------------------------------------------------------------1
VVVVVV WWW
2
VVVVVVVVVVVVVVV WWWWWWWWW
3
VVVVVVVVVVVVVVVVVVVVVVVV WWWWWWWWWWWW
-----------------------------------------------------------------------------------------------------------------
4. Question 3 Given a square matrix list [ ] [ ] of order 'n'. The maximum value possible possible for 'n' is 20. Input the value for 'n' and the positive integers in the matrix and perform the following task: 1. Display the original matrix 2. Print the row ro w and column position of the largest element of the matrix. 3. Print the row and column position of the second largest element of the matrix. 4. Sort the elements of the rows in the ascending order and display the new matrix. Sample data: INPUT: N=3 List [][] 5 1 3 7 4 6 9 8 2
OUTPUT 5 1 3
7 4 6 9 8 2
The largest element 9 is in row 3 and column 1 The second largest element 8 is in row 3 and column 2 Sorted list 1 3 5 4 6 7 2 8 9
