Tuesday , 17 October 2017
Home » Previous Year Solved Questions (ISC) (page 4)

Previous Year Solved Questions (ISC)

[Question 9] ISC 2013 (Theory) Paper Solved

Design a class Exchange to accept a sentence and interchange the first alphabet with the last alphabet for each word in the sentence, with single letter word remaining unchanged. The words in the input sentence are separated by a single blank space and terminated by a full stop. Example: Input: It is a warm day. Output: tI si a marw yad

Read More »

ISC 2013 [Question 2] Practical Paper Solved (Mirror Image Matrix)

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 matrix. (c) Display the mirror image matrix.

Read More »

ISC 2013 [Question 1] Practical Paper Solved (ISBN Number)

An ISBN (International Standard 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 whether 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. Design a program to accept a ten digit code from the user. For an invalid input, display an appropriate message.

Read More »

ISC 2013 [Question 3] Practical Paper Solved

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 tasks: (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: INPUT : MOM AND DAD ARE COMING AT NOON. OUTPUT : MOM DAD NOON NUMBER OF PALINDROMIC WORDS : 3

Read More »

Program for Generating Lucky Numbers (ISC 2001) – [Method 1]

This is the Java program for generating the Lucky Numbers within a given range. This is the 1st method, and it uses only one single dimensional array to generate the Lucky Numbers. Consider the sequence of natural numbers. 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 Removing every second number produces the sequences 1, 3, 5, 7, 9 Removing every third number produces the sequences 1, 3, 7,9 Removing every fourth number produces the sequences 1, 3, 7 Hence, The Lucky numbers less than 10 are: 1, 3, 7

Read More »