ISC 2016 Computer Science Practical Question Paper for Class 12

About this paper

This is ISC Class 12 Computer Science Paper 2 (Practical), code 868B, from the 2016 examination. It carries 30 marks and allows three hours plus fifteen minutes of reading time, split into 90 minutes of planning and 90 minutes of examination. The examination starts only after planning is over. Candidates attempt any one of three Java problems: testing a circular prime, sorting the non-boundary elements of a square matrix and adding both diagonals, or moving words that begin and end with a vowel to the front of a sentence. Twenty marks cover the algorithm, program, documentation, printout, test run and viva-voce. The practical file carries 5 marks from the teacher and 5 from the Visiting Examiner. This copy has the questions only.

Exam

ISC Class 12

Subject

Computer Practical

Year

2016

Paper code

868B

Maximum marks

30

Time allowed

3 hours + 15 min reading

Questions

3

Pages

5

Answers included

No, questions only

Paper pattern

• Selected problem

  20 marks

  Attempt any one of three Java problems: algorithm (3), program (5), documentation (2), printout (2), test run (5) and viva-voce (3)

• Practical file

  10 marks

  Programming assignments done during the year, assessed by the teacher (5) and by the Visiting Examiner (5)

Topics covered

• Circular primes
• Two-dimensional arrays
• Sorting
• Diagonals of a matrix
• String processing
• Vowels and consonants
• Java programming and the practical file

Questions from this paper

1. A circular prime remains prime when its leftmost digit is moved to the end, and the same is true of every further rotation. Accept a positive integer N, display each number formed by these shifts, and state whether N is a circular prime. The number 131 is a circular prime because 311 and 113 are also prime.
2. Declare a square matrix of order M × M, where M is greater than 3 and less than 10. Sort the non-boundary elements in ascending order, find the sum of both diagonals, and display the original matrix, the rearranged matrix and the diagonal elements with their sum.
3. Accept a sentence in upper case that ends with a full stop, a question mark or an exclamation mark. Count the words that begin and end with a vowel, and reprint the sentence with those words placed first.
4. Write the algorithm in pseudocode or in obviously computable steps, then a Java program that follows it, documented with mnemonic names and comments.
5. Test the program with the sample data given in the question and submit a printout of the output in the format specified.