ISC 2015 Computer Science Practical Question Paper for Class 12

About this paper

This is ISC Class 12 Computer Science Paper 2 (Practical), code 868 B, from the 2015 examination. It carries 80 marks. Candidates have fifteen minutes to read, then three hours for planning and the examination. The examination must begin within 90 minutes, sooner if planning finishes earlier. Any one of three Java problems is to be solved. The candidate writes an algorithm, a documented program, a hard-copy listing and a test run, and then faces a viva-voce. The problems are a search for the smallest integer above M whose digits add up to N, a 90° clockwise rotation of a square matrix, and a sentence whose words are capitalised and counted for vowels and consonants. This copy has the questions only.

Exam

ISC Class 12

Subject

Computer Practical

Year

2015

Paper code

868 B

Maximum marks

80

Time allowed

3 hours + 15 min reading

Questions

3

Pages

5

Answers included

No, questions only

Paper pattern

• Selected problem

  80 marks

  Attempt any one of Questions 1, 2 and 3 in Java: algorithm (10), program (20), documentation (10), hard-copy printout (10), test run (10) and viva-voce (20)

Topics covered

• Digit sums
• Input validation
• Two-dimensional arrays
• Rotation of a matrix
• String handling
• Vowels and consonants
• Java programming and documentation

Questions from this paper

1. M is a positive integer between 100 and 10000, and N is a positive integer less than 100. Write a program to find the smallest integer greater than M whose digits add up to N, and to print how many digits that integer has. For M = 100 and N = 11 the required number is 119. Reject an invalid input.
2. Declare a square matrix of order M × M, where M is greater than 2 and less than 10. Display the matrix, rotate it 90° clockwise, and find the sum of its four corner elements.
3. Accept a sentence that ends with a full stop or a question mark, with a single space between words. Convert the first letter of each word to uppercase, and print the number of vowels and consonants in each word.
4. Write an algorithm for the selected problem, in pseudocode or in steps that are obviously computable, and then write a Java program that follows it.
5. Document the program with mnemonic names and comments, stating the data type and meaning of each variable, and produce a hard copy of a program that compiles and runs.