## ISC Practical Questions Solved

### Important guidelines for Computer practical

The total time to be spent on the Planning session and the Examination session is Three hours. After completing the Planning Session, the candidate may begin with the Examination Session. A maximum of 90 minutes is permitted for the Planning Session. However, if candidates finish earlier, they are to be permitted to begin the Examination Session. (Maximum Marks : 80)

As it is a practical examination the candidate is expected to do the following :

Write an algorithm for the selected problem. (Algorithm should be expressed clearly using any standard scheme such as pseudo code or in steps which are simple enough to be obviously computable) | [10] |

Write a program in JAVA language. The program should follow the algorithm and should be logically and syntactically correct. | [20] |

Document the program using mnemonic names/comments, identifying and clearly describing the choice of data types and meaning of variables. | [10] |

Code / Type the program on the computer and get a printout (Hard Copy). Typically, this should be a program that compiles and runs correctly. | [10] |

Test run the program on the computer using the given sample data and get a printout of the output in the format specified in the problem. | [10] |

Viva-Voce on the Selected Problem. | [20] |

### ISC Computer Science Practical 2013

#### Question 1

An ISBN ( International Stanadar Book Number) is a ten digit 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 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

#### 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 1INPUT : M = 3 4 16 12 8 2 14 6 1 3 OUTPUT : ORIGINAL MATRIX 4 16 12 8 2 14 6 1 3 MIRROR IMAGE MATRIX 12 16 4 14 2 8 3 1 6

Example 2INPUT : M = 22 OUTPUT : SIZE OUT OF RANGE

#### 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 word 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 1INPUT : MOM AND DAD ARE COMING AT NOON OUTPUT : MOM DAD NOON NUMBER OF PALINDROMIC WORDS : 3

Example 2

INPUT : HOW ARE YOU? OUTPUT : NO PALINDROMIC WORDS

### ISC Computer Science Practical 2012

#### 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 program to determine how many prime-palindrome integers are there in the range between m and n (both inclusive) and output them.

The input contains two positive 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 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

#### 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 INVENTION.

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#### 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:

8 7 9 3

-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

3 3 4 5

6 7 8 9

### ISC Computer Science Practical 2011

#### 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

#### 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 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 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#### Question 3

Design a program which accepts your date of 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. 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

#### Question 1

A bank intends 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 break-up in descending order of denominations. (i,e preference should be given to the highest 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

#### Question 2

Given the two positive integers p and q, where p < q. Write a program 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 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

#### 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 (.) or 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.

Example 1:

INPUT:

Enter number of 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 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

#### 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

#### 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 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 4 9 5 8 7 6

SUM OF OUTER ROW AND OUTER COLUMN = 43#### Question 3

Read a single sentence which terminates with a full stop(.). The 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

#### 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 (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

#### Question 2

A sentence is terminated by either ".", "!" or "?" followed by a space.

Input a piece of text consisting of sentences. Assume that there will be a maximum of 10 sentences in a block.

Write a program to:

(i) Obtain the length of 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.

OUTPUTSentence No. of Vowels No. of words ---------------------------------------------------------- 1 2 1 2 5 3 3 8 4 4 3 3 Sentence No. of words/vowels ---------------------------------------------------------- 1 VVVVVV WWW 2 VVVVVVVVVVVVVVV WWWWWWWWW 3 VVVVVVVVVVVVVVVVVVVVVVVV WWWWWWWWWWWW ----------------------------------------------------------

Scale used 1:3#### Question 3

Given a square matrix list [ ] [ ] of order 'n'. The maximum value 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 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

### ISC Computer Science Practical 2007

#### Question 1

Write a program to accept a date in the string format dd/mm/yyyy and accept the name of the day on 1st of January of the corresponding year. Find the day for the given date.

Example:

INPUT Date: 5/7/2001 Day on 1st January : MONDAY

OUTPUT Day on 5/7/2001 : THURSDAY

Test run the program on the following inputs:INPUT DATE DAY ON 1ST JANUARY OUTPUT DAY FOR INPUT DATE 4/9/1998 THURSDAY FRIDAY 31/8/1999 FRIDAY TUESDAY 6/12/2000 SATURDAY WEDNESDAY

The program should include the part for validating the inputs namely the date and the day on 1st January of that year.

#### Question 2

The input in this problem will consist of a number of lines of English text consisting of the letters of the English alphabet, the punctuation marks (') apostrophe, (.) full stop, (,) comma, (;) semicolon, (:) colon and white space characters (blank, newline). Your task is to print the words of the text in reverse order without any punctuation marks other than blanks.

For example consider the following input text:

This is a sample piece of text to illustrate this problem.

If you are smart you will solve this right.

The corresponding output would read as:

right this solve will you smart are you If problem this illustrate to text of piece sample a is This

That is, the lines are printed in reverse order.

Note: Individual words are not reversed.

INPUT FORMAT:

The first line of input contains a single integer N (<=20), indicating the number of lines in the input. This is followed by N lines of input text. Each line should accept a maximum of 80 characters.

OUTPUT FORMAT:

Output the text containing the input lines in reverse order without punctuations except blanks as illustrated above.#### Question 3

A unique-digit integer is a positive integer (without leading zeros) with no duplicate digits.

For example 7, 135, 214 are all unique-digit integers whereas 33, 3121, 300 are not.

Given two positive integers m and n, where m< n, write a program to determine how many unique-digit integers are there in the range between m and n (both inclusive) and output them.

The input contains two positive integers m and n. Assume m< 30000 and n< 30000.

You are to output the number of unique-digit integers in the specified range along with their values in the format specified below:

SAMPLE DATA:

INPUT: m = 100 n = 120

OUTPUT: THE UNIQUE- DIGIT INTEGERS ARE : 102, 103, 104, 105, 106, 107, 108, 109, 120.

FREQUENCY OF UNIQUE-DIGIT INTEGERS IS: 9.

### ISC Computer Science Practical 2006

#### Question 1

A positive natural number, (for e.g.27) can be represented as follows:

2+3+4+5+6+7

8+9+10

13+14

where every row represents a combination of consecutive natural numbers, which add up to 27.

Write a program which inputs a positive natural number N and prints the possible consecutive number combinations, which when added give N. Test your program for the following data and some random data.

SAMPLE DATA

INPUT N=15

OUTPUT

1 2 3 4 5

4 5 6

7 8

#### Question 2

Write a program that inputs the names of people into two different arrays, A and B. Array A has N number of names while Array B has M number of names, with no duplicates in either of them. Merge array A and B into a single array C, such that the resulting array is sorted alphabetically.

Display all the three arrays, A, B and C, sorted alphabetically.

Test your program for the given data and some random data.

SAMPLE DATA

INPUT

Enter number of names in Array A, N=2

Enter number of names in Array B, M=3

First array:(A)

Suman

Anil

Second array:(B)

Usha

Sachin

John

OUTPUT

Sorted Merged array:(C)

Anil

John

Sachin

Suman

Usha

Sorted first array:(A)

Anil

Suman

Sorted Second array:(B)

John

Sachin

Usha

#### Question 3

A new advanced Operating System, incorporating the latest hi-tech features has been designed by Opera Computer Systems.

The task of generating copy protection codes to prevent software piracy has been entrusted to the Security Department.

The Security Department has decided to have codes containing a jumbled combination of alternate uppercase letters of the alphabet starting from A upto K (namely among A,C,E,G,I,K). The code may or not be in the consecutive series of alphabets.

Each code should not exceed 6 characters and there should be no repetition of characters. If it exceeds 6 characters, display an appropriate error message.

Write a program to input a code and its length. At the first instance of an error display "Invalid" stating the appropriate reason. In case of no error, display the message "Valid".

Test your program for the following data and some random data.

SAMPLE DATA

INPUT N=4 ABCE

OUTPUT Invalid Only alternate letters permitted!

INPUT N=4 AcIK

OUTPUT Invalid! Only upper case letters permitted!

INPUT N=4 AAKE

OUTPUT Invalid! Repetition of characters not permitted!

INPUT N=7

OUTPUT eRROR! Length of string should not exceed 6 characters!

INPUT N=4 AEGIK

OUTPUT Invalid! String length not the same as specified!

INPUT N=3 ACE

OUTPUT Valid!

INPUT N=5 GEAIK

OUTPUT Valid!