ISC Computer Science 2010 Class-12 Previous Year Question Paper Solved for practice. Step by step Solutions with Questions of Part-1 and Part-2 (Section-A, B and C). By the practice of Computer Science 2010 Class-12 Solved Previous Year Question Paper you can get the idea of solving.

Try Also other year except ISC Computer Science 2010 Class-12 Solved Question Paper of Previous  Year for more practice. Because only ISC Computer Science 2010 Class-12 is not enough for complete preparation of next council exam. Visit official website CISCE for detail information about ISC Class-12 Computer Science.

## ISC Computer Science 2010 Class-12 Previous Year Question Paper Solved

Part-I

Section-A of Part-II

Section-B of Part-II

Section-C of Part-II

Maximum Marks: 70
Time allowed: 3 hours

• Candidates are allowed additional 15 minutes for only reading the paper. They must NOT start writing during this time.
• Answer all questions in Part-I (compulsory) and six questions from Part-II, choosing two questions from Section-A, two from Section-B and two from Section-C.
• All working, including rough work, should be done on the same sheet as the rest of the answer.
• The intended marks for questions or parts of questions are given in brackets [ ].

Part – I (20 Marks)

### ISC Computer Science 2010 Class-12 Previous Year Question Paper Solved

While answering questions in this Part, indicate briefly your working and reasoning, wherever required.

Question 1.
(a) If X = A’BC + AB’C + ABC + A’BC’ then find the value of X when A = 1; B = 0; C = 1  (b) Verify if, P. (~ P + Q’) = (P = > Q) using truth table.  (c) Draw the logic circuit of NOR and NAND gate only.  (d) Convert the following function into its Canonical sum of products form:  F(X, Y, Z) = Σ(0, 1, 5, 7).
(e) Show that dual of P’QR’ + PQ’R + P’Q’R is equal to the complement of:  PQ’R + Q. (P’R’+PR’)  Question 2.
(a) State the difference between an Interface and a Class.  (b) Convert the following infix notation to postfix notation: 
(A + B) / C * (D + E)
(c) A character array B  has a base address 1046 at 0, 0. Calculate the address at B  if the array is stored Column Major wise. Each character requires tw o bytes of storage.  (d) State the use of exceptional handling. Name the two types of exceptions.  (e) (i) What is the worst-case complexity of the follow ing code segment: 

```for (int i = 0; i < N; i++)
{
sequence of statements
}
for (int j=0 ; j < M; j++)
{ sequence of statements
}```

(ii) How would the complexity change if the second loop went to N instead of M?
(a)

(i) Class can be extends in another class.
(ii) Interface is implemented in another class.

(b) (A + B) / (C * (D + E))
= (AB +) / (C * (DE +))
= (AB +) / (CDE + *)
= AB + CDE + */

(c) B + W [(I – LBR) + M (J – LBC)] = 1046 + 2 [(2 – 0) + 7(3 – 0)] = 1046 + 2(2 + 21)
= 1046 + 2(23)
= 1046 + 46
= 1092

(d) Exception: It refers to some contradictory or unusal situation which can be encountered while executing a program.
(i) IO Exception
(ii) Array out of Bound Exception

(e)

(i) for (i = 0; i < N ; i + +) This loop gets executed N times thus take time C1 * N
for (i = 0; j < M ; j ++) This loop gets executed M times thus take time C2 * M
Total Time = C1 * N + C2 * M = 0 (N + M)
(ii) It becomes = O(2N)

Question 3.
(a) The following functions numbers (int) and numbers1 (int) are a part of some class. Answer the questions given below showing the dry run/working:

```public void numbers (int n)
{
if (n > 0)
{
System.out. print(n + " " );
numbers (n-2);
System.out.print(n + " ");
}
}
public String numbers1 (int n)
{
if (n < = 0)
return " ";
return numbersl(n-1) + n + " ";
}```

(i) What will be the output of the function numbers (int n) when n = 5?  (ii) What will the function numbersl (int n) return when n = 6?  (iii) State in one line what is the function numbersl (int) doing apart from recursion?  (b) The following function is a part of some class. It sorts the array a[ ] in ascending order using insertion sort technique. There are some places in the code marked by ?1?, ?2?, ?3?, ?4?, ?5? which must be replaced by expression / statement so that the function works correctly.

```void insertsort (int a [ ])
{
int m = ?1?;
int b, i, t;
for (i = ?2? ; i < m; i++)
{
t = a[i];
b = i - I;
while (?3? > = 0 && t < a [ b ])
{
a[b+1] = a[b];
?4?;
}
?5? = t;
}
}```

(i) What is the expression or statement at ?1?  (ii) What is the expression or statement at ?2?  (iii) What is the expression or statement at ?3?  (iv) What is the expression or statement at ?4?  (v) What is the expression or statement at ?5?  Answer 3:
(a)

(i) 5 3 1 1 3 5
(ii) “1 2 3 4 5 6”
(iii) It display all number from 1 to that number.
(b)

(i) a length
(ii) 1
(iii) b
(iv) b = b – 1;
(v) a[b+1]

Part- II (50 Marks)

Answer six questions in this part, choosing two questions from Section A, two from Section B and two from Section C.

Section – A

### Previous Year Question Paper Solved ISC Computer Science 2010 Class-12

Question 4.
(a) Given F(P,Q,R,S) = Σ (0, 2, 5, 7, 8, 10, 11, 13, 14, 15)
(i) Reduce the above expression by using 4 – Variable K-Map, showing the various groups (i.e., octal, quads and pairs).  (ii) Draw the Logic gate diagram of the reduced expression using NAND gate only.  (b) Given F(A, B, C, D) = (A + B + C + D). (A + B + C + D’). (A + B + C’ + D’). (A + B + C’ + D). (A + B’ + C + D’). (A + B’ + C’ + D’). (A’ + B + C + D). (A’ + B + C’ + D).
(i) Reduce the above expression by using 4 – Variable K-Map, showing the various groups (,i.e., octal, quads and pairs).  (ii) Draw the Logic gate diagram of the reduced expression using NOR gate only.  Answer 4:      Read Next 👇 Click on Page Number Given Below 👇