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 »# Class 12

## [Question 8] ISC 2013 (Theory) Paper Solved – Emirp Number

An Emirp number is a number which is prime backwards and forwards. Example: 13 and 31 are both prime numbers. Thus, 13 is an Emirp number. Design a class Emirp to check if a given number is Emirp number or not.

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 »## Java Program for finding Weekday name of the given date

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

Read More »## Java Program for finding Future Date

Write a program to accept a date in the string format dd/mm/yyyy. Check whether the date entered is valid or not. If it is valid, then input a certain number of days. Then calculate and print the future date after adding the given number of days if the future date is valid. If the date entered is invalid, then display a proper error message. Example: INPUT: Date : 07 / 04 / 2013 Enter Number of days after : 7 OUTPUT: Entered Date : 07 / 04 / 2013 Future Date : 14 / 04 / 2013

Read More »## Java Program for finding Difference between 2 Dates

Write a program to accept 2 dates in the string format dd/mm/yyyy and find the difference in days between the 2 dates. Example: INPUT: Date 1 : 20/12/2012 Date 2 : 11/02/2013 OUTPUT: Difference = 54 days The program should include the part for validating the inputs namely the date and the day on 1st January of that year.

Read More »## ISC Practice Paper [Computer Science (2013)]

This practice paper consists of 3 questions of 10 marks each. The timing for this paper is 45 minutes. You need to attempt all the given questions. The questions given in this paper basically covers the questions related to Output, completing a given program, Data structures, Recursion and Complexity.

Read More »## Collection of String Programs using Recursion [ISC Computer Science]

This PDF is a collection of various programs on Strings done using the Recursive concept. The unique feature of this collection is that along with the recursive codes, we have provided the Iterative codes of the same program as well. This will facilitate the students in understanding the concept of recursion well.

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 »## [Solved] Question 10 (Happy Number) – ISC 2012 Computer Science

Program to check if a given number is a happy number or not. A happy number is a number in which the eventual sum of the square of the digits of the number is equal to 1. Example: 28 [Question 10 (ISC 2012)]

Read More »