ICSE 2008, Computer Science, Sample Question Paper 1, Class XII

ICSE Sample Paper – 2008Class – XIISubject – Computer Science TIME: 03:00 HRS. M.M.:100 Answer all questions in Part I and seven questions from Part II, choosing three from Section ‘A’ and four from Section B. PART – I (Attempt all questions ) Q1. (a) Use a truth table to show that A ( A + B ) = A.B [2] (b) Show algebraically that the dual of the exclusive OR is equal to its complement. [2] (c) Simplify the following using laws of Boolean algebra: A.B.D + A.B.C.D + A.B.D + A.B.C.D [2] (d) Find complement using De Morgan’s rule F=A.C.E + A.C.D.E + A.C.D.E [2] (e) What do you understand by switching circuiting? Find the switching circuiting for the following logic expression A. ( B + C ) [2] Q2. (a) What do you understand by the term: [2] i) Postfix Notation ii) Infix Notation (b) An array A[3][4] is stored in the memory with each element requiring 4 bytes of storage. If the base address of A[0][0] is 5000, determine the location of A[1][2] when the array is stored column major wise. [2] (c) How does inheritance influence the working of constructor and destructor? Give Example. [2] (d) State commutative law. Verify it using truth table. [2] (e) Transform following expression to prefix (A + B + C – D) / E * F [2] Q3. Find the output: [5] # include int func(int & x, int y= 10) { if (x%y= = 0) return ++x ; else return y- -; } void main ( ) { int p = 20 , q= 23; p=func(q); cout< # include >str; cout<<”Enter alphabet to check : ” ; vin>> x; while(s[i] !=”\0”) { if(s[i]=x) a=a+1; i++; } cout<<” Frequency is :”<