Tuesday , 10 December 2019
Home » Class 12 » Top 5 Advice regarding ISC Computer Practical

Top 5 Advice regarding ISC Computer Practical

This article consists of few of the basic things which you need to take into consideration while preparing for your ISC Computer Science Practicals.

To begin with I would like to inform you all that you don’t need to practice Inheritance or Recursion programs as you won’t get programs in your practical examination related to these concepts.

You may use the concept of recursion in solving practical programs, but it will be upto you to do so. There won’t be specifically mentioned that you have to do so.

The paper will consist of 3 questions out of which you have to do any one. You will be allotted 3 hours in all which will be divided into:

  • Planning session (where you write the programs in the answer sheet) – Maximum 90 minutes
  • Writing session (where you write and run the program on the computer) – Maximum 90 minutes

1) How to prepare:

Just after you finish reading this advice, switch on your computer and start typing in the programs you know. Try and run every program you know and see what are the common errors which you encounter. Try and be perfect with regards to those errors.

The more you practice programs on the computer, the better you will do in your practical examination. So don’t be lazy. There is no other alternative.

2) Types of programs to practice:

(Given in order of the importance to be given while practicing, Examples are just to make you understand the type of question)

  • 2-D array programs


  1. Magic Matrix
  2. Spiral (Circular) Matrix
  3. Matrix Multiplication
  4. Mirror Image
  5. Finding maximum and minimum element
  6. Sorting
  7. Searching
  8. Filling a 2-D array with any give type of numbers. (Example: Fill a n*n matrix with n*n Fibonacci numbers)
  9. Operations on Diagonals of a 2-D array
  10. Operations on Border elements of a 2-D array
  11. Operations on every row or column (Example: Swapping rows or columns or finding maximum and minimum of every row)

  • String programs which involve the use of String Tokenizer or split() concepts

Examples: Input a sentence and

  1. convert each of its word into piglatin
  2. find the reverse of every word
  3. replace any given word with another
  4. frequency of every word
  5. find words which are palindrome
  6. find words which begin and end with vowels
  7. encode or decode words in circular fashion
  8. sorting the words alphabetically

How to solve?

Create a function which does the required operation with one word, then in the main() method, break the sentence into words, and send them to this function one by one to get your final result.

See: http://www.guideforschool.com/358-isc-2013-question-3-practical-paper-solved/
and http://www.guideforschool.com/1266790-program-to-replace-words-of-a-sentence-in-special-fashion/

  • Range questions

(Example: Print all the Disarium numbers within ‘p’ and ‘q’ along with their frequency)

 Similarly, any named number could be given and you will be told to print those numbers and their frequency within a given range.

Note: Don’t forget to check for valid range which are always given in the question like p

How to solve?

Create a function which checks whether a number is the desired number or not by returning a true or a false. Then in the main() method, write a loop which starts from the lower range and goes on till the upper range. Then one by one send the numbers to the function you created. If you get a true from there, then increase the frequency and print the number.

See: http://www.guideforschool.com/203266-java-program-to-check-for-unique-number/
and http://www.guideforschool.com/212-isc-2012-computer-science-practical-program-1-solved/

  • General programs:


  1. Denominations
  2. ISBN number
  3. Keith number
  4. Smith number
  5. Some operations related to time, like printing them in words.

    See: http://www.guideforschool.com/553891-program-to-print-a-given-time-in-words-isc-practical-2003/

  6. print the possible consecutive number combinations
  7. Number system conversion

  • Date related programs


  1. Validate a given date
  2. print the date in dd/mm/yyyy format
  3. difference of dates

Note: In every date related programs, do check whether the inputted date are valid or not.

See: http://www.guideforschool.com/category/date-related-programs/

3) What to write apart from programs?

You have to write the program in your answer sheet in the planning session (maximum 90 minutes) along with:

  • Algorithm of the program you wrote
  • Data Description table
  • Comments on the program

Don’t forget to number the question you are attempting.

4) Can I change what I wrote on my answer sheet?

No, you cannot change what you wrote after you have finished your planning session i.e. written your program and you are ready to write and run it on the computer.

While running the program if you find some mistakes in what you wrote or the program you wrote is not running as desired, then don’t panic.

Just correct the code on the computer and try and work on it to make it give the desired output. What matters the most is whether your program is giving the correct output on the computer or not as that output will be checked by the external teacher.

5) What about viva questions?

This is what terrifies most of the student. But the fact is that it is not as terrifying as it seems to be.

The external teacher will ask you questions related to the program you write and the concepts you used in it. Like if you used a while loop, they may ask you difference between for and while loop etc. Few of the most common questions are:

  • What is import java.io.*?
    (Answer: The line is importing all the classes of java.io package into the current class)
  • What is BufferedReader?
    (Answer: BufferedReader is a class and the line which we write having BufferedReader activates the temporary Buffer memory)
  • What is StringTokenizer or Scanner and examples of similar classes (if you used it)
    (Answer: StringTokenizer or Scanner is a class which splits up any given string into tokens separated by delimiters)

I will try and compile few of the viva questions along with their answers if time permits.

Update: Here are some of the commonly asked viva questions: ISC Computer Science Practical Viva Questions.

So, this is it for now student. Hope this helps. Relax and prepare.

Check Also

Infix Postfix Prefix Conversion – Correct Method (ISC Computer Science)

In this video we discuss about the correct way of converting an Infix Expression to Postfix and Prefix.


  1. Hello sir, I must say that this is really the most helpful and wonderful website for computer programs of class 10 and 12 students. It not only has programs but also alot of advice and information regarding concepts of java, practical and theory questions, solving algorithms and other related topics. I am really very thankful to you and the best thing is you personally reply to each comments of students and help them solve their problems.Hats off to you.I would recommend this website to as many people as I can.

  2. thank you. it was really of great help.

  3. Can i please get the simplest method to convert a decimal number to an integer without “possible loss of precesion” as error message

  4. Hello Sir,i am extremely obliged for this website.Here is my doubt– the user would be entering a 2-d matrix of [3][3] we have to print such type of matrix……….. 8 1 6
    3 5 7
    4 9 2 Thank you Sir and also may i have some notes for ISC class 12 so if possible please late me know the website!!!!

  5. First of all, thank you very much for this useful information. The list of type of programs as well as the viva questions were really helpful. 🙂
    I just wanted to ask- if by chance the examiner asks me questions from outside the program I have attempted, then what do I do? As in, if he asks me questions from theory chapters like file handling? How do I answer them? And then, if he asks to ‘suggest an alternate logic’ to solve the same program I have attempted, then?

    (Please reply fast, as soon as possible, because the exam is tomorrow, 20th Feb.)

    • We are glad that the resources helped you. The instructions in the question paper clearly states “Viva-Voce on the Selected Probem“.

      But, if you are asked a question from your theory chapters (which is highly unlikely), just give a smile, take your time and then answer what you can if you know. If you don’t know, then the examiner will not bother you with that question, he will understand.

      Regarding alternate logic, repeat the above steps. 🙂


  6. please tell how to write documentation in isc practicals ???

    ACTUALLY what is documentation???

    • The 3rd Instruction in the practical question paper is referred to as the documentation:
      “3. Document the program using mnemonic names / comments, identifying and clearly describing the choice of data types and meaning of variables.”

      In this you need to write comments in your program and after you have finished writing your program, write the Data Description Table for it which consists of mostly 3 columns – Identifier/Variable Name, Data Type and Purpose.

      For example: The data description table for the below given code would be:


      void isPrime(int n)
         int c = 0;
         for(int i = 1; i<=n; i++)
           if(n%i == 0)
         if(c == 2)
           System.out.println("The number is Prime");
           System.out.println("The number is Not Prime");

      Data Description:

      Identifier Name Data Type Purpose
      n int variable to store the number
      c int variable to count the number of factors of n
      i int loop control variable

      Hope this helps.

  7. Sir , can you please help me out with three string functions





    Can I use string tokenizer in Scanner class instead of buffered reader .

    • Hello Soumodeep,

      1. split() function splits a string into tokens (words) and returns the result in the form of a String array.
      Example: If String s = “Java For School”, then String w[]=s.split(” “); will save the words Java, For and School in the array w[]

      2. compareTo() function compares 2 strings alphabetically.
      Example: “s1.compareTo(s2)” – This will result into any of the three mentioned cases:
      If result is 0, then s1 and s2 are equal
      If result is >0, then s1 should come after s2 in aplphabetical order
      If result is <0, then the s1 and s2 are already arranged alphabetically.

      3. equals() function checks whether 2 strings are equal in every aspect or not including their case.
      Example: “Apple”.equals(“APPLE”) will return false whereas,
      “APPLE”.equals(“APPLE”) will return true.

      Yes you can use StringTokenizer in Scanner class as well. No need to use BufferedReader class. In this case you have to save the sentences using the function “nextLine()” and not “next()”


  8. Sir,

    can you plz tell me the program for finding the frequency of a word in a given sentence??

    like the program to find the word with maximum frequency in a given sentence

    • import java.io.*;
      import java.util.*;
      class Word_Freq
          public static void main(String args[])throws IOException
              BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
              System.out.print("Enter any sentence: ");
              String s = br.readLine();
              StringTokenizer str=new StringTokenizer(s);
              int x=str.countTokens();
              String word[]=new String[x][x];
              for(int i=0; imax)
                              max = freq[i];
                              maxword = word[i];
                System.out.println("Word with maximum frequency = "+maxword);
  9. Hello sir thank you for this wonderful website
    I have a doubt.
    Will we be asked questions specifically to use selection sort or binary search etc
    And are you sure that recursion will not be specifically asked?
    Last ,any idea what might come this year?
    Really anxious about the exam.

    • Hello Kiran,
      In your practical examination, you will not be specifically asked to use selection sort/bubble sort or linear search/binary search.
      Yes, recursions will not be specifically asked.
      I listed down the types of programs you should practice. I cannot specify which are the exact programs coming.
      All the best for your examination.

  10. maam can you please give a short program on how to find frequency of each word in the entered sentence..and on sorting the boundary elements of the matrix..please i really need it dat too very early my exam is on 20th…i’ll be really thankful to you fr this 🙂

    • Here you go:

      Java program to find frequency of each word in the entered sentence

      import java.io.*;
      import java.util.*;
      class Word_Freq
          public static void main(String args[])throws IOException
              BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
              System.out.print("Enter any sentence: ");
              String s = br.readLine();
              StringTokenizer str=new StringTokenizer(s);
              int x=str.countTokens();
              String word[]=new String[x][x];
              for(int i=0; i



  12. can you give some more Viva questions please ???

  13. Thanks a lot! Please upload some more viva questions if possible!

  14. thank you!!! this was really helpful !

Leave a Reply to Java For School Cancel reply

Your email address will not be published. Required fields are marked *