Sample Paper Computer Science Class 12

Computer Science Unsolved Sample Paper Solutions ISC Class 12

Section-A

Answer 1.

  • (i) (a) George Boole
  • (ii) (a) 2

(iii) (c) dr.substring(0,4)+”.”+dr.substring(11)

 Explanation :

substring(0,4) returns characters from index 0 to 3 that is “Dr.” and substring(11) returns characters from index 11 to the end that is “Chatterjee”.

(iv) (b) Inner loop

 Explanation :

In bubble sort the largest element is pushed towards the end in each pass, hence the inner loops becomes smaller after every pass.

  • (v) (c) Boolean
  • (vi) When a labeled break is executed, execution resumes at the end of the labeled block.
  • (vii) A statement block is used to organize a sequence of statements as a single statement group.
  • (viii) False. Java does not allow array overruns at run time.
  • (ix) 1. Reusability
  • 2. Transitive nature
  • (x) “Overflow” means attempt to INSERT when the list is full and no free space is available.

Answer 2.

146
  • (ii) BA = 1012, ES = 2, R = 10, I = 7, J = 3, LR = X, LC = 1
  • Address of B [I, J] = BA + ES [(I – LR) + R (J – LC)]
  • B [7, 3] = 1012 + 2 [(7 – X) + 10 (3 – 1)]
  • 1060 = 1012 + 2 [(7 – X) + 10 (2)]
  • 1060 = 1012 + 2 [(7 – X) + 20)]
  • 1060 – 1012 = 2 [(7 – X) + 20)]
  • 48 = 2 [(7 – X) + 20)]
  • (7 – X) = 48/2 – 20
  • 7 – X = 4
  • X = 7 – 4 = 3.
  • (iii) (a) S C R O L L
  • L C R O L S
  • L L R O C S
  • L L O R C S
  • (b) It reverses the part of a string from the specified location.
  • (iv) (a) When n if-condition k n i
  • 6 true 1 6 3
  • In loop
147
  • (b) It is computing, factorial of n.

PART-II

Section-A

Answer 3.

  • (i) (a) F (A, B, C, D) = Σ (4, 6, 7, 10, 11, 12, 14, 15)
  • Quad 1 = m6 + m7 + m14 + m15 = BC
  • Quad 2 = m10 + m11 + m14 + m15 = AC
  • Quad 3 = m4 + m6 + m12 + m14 = BD
  • (b) So the expession is:
149
  • (ii) (a) F (P, Q, R, S) = π (0, 5, 7, 8, 10, 12, 13, 14, 15)
  • (b) Logic gate diagram for the reduced expression using AND and OR gates :
151

Answer 4.

(i) Truth table for the inputs and outputs :

152
  • (ii) Half Adder is a combinational logic circuit that adds two 1-bit digits. The half adder produces a sum of the two inputs. A half adder circuit cannot be used in the same way as a full adder circuit. A full Adder is a combinational logic circuit that performs an addition operation on three 1-bit binary number. The full adder produces a sum of the three inputs and carry value. A full adder circuit can be used in place of a half adder circuit.
153

Answer 5.

  • (i) Decimal to binary encoder is used to convert decimal numbers into its equivalent binary form.
(iii)
Proposition wff
A proposition is an elementary atomic sentence that returns either true or false. wff’s are well formed formula which is a proposition that is satisfiable or valid.

Section-B

Answer 6.

156
157

Answer 7.

158
159
160

Answer 8.

161
162

Section-C

Answer 9.

164
165
166

Answer 10.

168
169
170

Answer 11.

171

ISC 36 Sample Question Papers

All Subjects Combined for Class 12 Exam 2023

ISC 36 Sample Question Papers

All Subjects Combined for Class 12 Exam 2023

The dot mark field are mandatory, So please fill them in carefully
To download the complete Syllabus (PDF File), Please fill & submit the form below.

    Free Shipping on all
    orderes over ₹ 1,000

    Free 10-Day
    Return Policy

    15-Days Money-back
    Guarantee

    23,125 Products
    Shipped this Month

    Need Help?
    +91-745 507 7222

    Shopping cart

    Sign in

    No account yet?

    Start typing to see products you are looking for.
    Shop
    0 items Cart
    My account