ISC 2018 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 2018 examination. It carries 30 marks and allows three hours plus fifteen minutes of reading time, with 90 minutes to plan and 90 minutes for the examination. Candidates attempt any one of three Java problems: odd prime pairs that add up to an even integer N (9 < N < 50), sorting each row of a matrix, or printing team names vertically. The chosen problem is marked out of 20 for the algorithm, program, documentation, printout, test run and viva-voce. The practical file is marked out of 10, split equally between the teacher and the Visiting Examiner. This copy has the questions only.

Exam

ISC Class 12

Subject

Computer Practical

Year

2018

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

• Goldbach numbers
• Odd primes
• Two-dimensional arrays
• Sorting
• String output and formatting
• Input validation
• Java programming and the practical file

Questions from this paper

1. A Goldbach number is a positive even integer that can be written as the sum of two odd primes. For example, 6 = 3 + 3 and 10 = 3 + 7 = 5 + 5. Accept an even integer N, where N is greater than 9 and less than 50, and print every odd prime pair that sums to N.
2. If the accepted value of N is odd, print "INVALID INPUT. NUMBER IS ODD." If it is outside the given range, print "INVALID INPUT. NUMBER OUT OF RANGE."
3. Declare a matrix of order M × N, with both M and N greater than 2 and less than 10. Display the matrix, sort each row into ascending order, and display the matrix again.
4. Accept the names of N teams, where N is greater than 2 and less than 9, and display the names vertically, side by side, separated by a tab of eight spaces.
5. Write the algorithm in pseudocode or in obviously computable steps, then a documented Java program, and submit a printout of the program and of the test run.