ISC 2018 Computer Science Question Paper for Class 12

About this paper

This is ISC Class 12 Computer Science Paper 1 (Theory), code 868A, from the 2018 board examination. It carries 70 marks and three hours, plus fifteen minutes to read the paper. Part I is compulsory and worth 20 marks. Part II is worth 50 marks: two questions from Section A on Karnaugh maps and circuits, two Java programs from Section B, and two from Section C on inheritance and data structures. Section B includes a perfect number, a test for equal matrices, and counting words that start with a capital letter. Section C includes a factorial series, a register of names used as a stack, and a linked-list search. Programs must be written in Java. This copy has the questions only.

Exam

ISC Class 12

Subject

Computer Science

Year

2018

Paper code

868A

Maximum marks

70

Time allowed

3 hours + 15 min reading

Questions

12

Pages

8

Answers included

No, questions only

Paper pattern

• Part I

  20 marks

  Questions 1–3, all compulsory: Boolean laws, Java concepts and a palindrome method with blanks to fill

• Section A

  20 marks

  Questions 4–6, ten marks each; answer any two. Karnaugh maps, a scholarship truth table, an encoder and a full adder

• Section B

  20 marks

  Questions 7–9, ten marks each; answer any two. Java classes for a perfect number, equal matrices and capital letters in a sentence

• Section C

  10 marks

  Questions 10–12; answer any two. A factorial series by inheritance, a stack of names and a linked-list search

Topics covered

• Boolean algebra
• Karnaugh maps
• Encoders and full adders
• Propositional logic
• Exception handling
• Recursion and Big O notation
• Matrices
• Strings
• Inheritance
• Stacks
• Linked lists

Questions from this paper

1. State the Commutative law and prove it with the help of a truth table.
2. Convert the infix expression A + (B − C * (D / E) * F) to postfix form.
3. A perfect number equals the sum of its factors excluding itself. For example, 6 = 1 + 2 + 3. Design a class Perfect that finds this sum by recursion.
4. Two matrices are equal when they have the same dimensions and equal corresponding elements. Class EqMat should return 1 if two matrices are equal and 0 otherwise.
5. Class Capital stores a sentence and counts how many of its words begin with a capital letter.
6. Subclass Series finds S = 1! + 2! + 3! + … + n!, using the factorial method of superclass Number.