ISC Computer Science 2020 Specimen Paper with Answers
All 26 questions of the ISC Computer Science 2020 Specimen Paper, in printed order. Open a question to read it in full and see its answer.
- Q1(a) State Associative law and prove it with the help of a truth table. 1 mark · Short answer
- Q1(b) Draw the truth table to prove the proportional logic expression: $(X \Rightarrow Y) \land (Y \Rightarrow X) = X \Leftrightarrow Y$ 1 mark · Short answer
- Q1(c) Find the dual for the Boolean equation: $AB' + BC' + 1 = 1$. 1 mark · Short answer
- Q1(d) Convert the Boolean expression $F(X,Y,Z) = X'Y'Z + X'YZ' + XYZ$ into its cardinal form. 1 mark · Short answer
- Q1(e) Minimize: $F = XY + (XZ)' + XY'Z$ using Boolean laws. 1 mark · Short answer
- Q2(a) Differentiate between Stack data structure and Queue data structure. 2 marks · Short answer
- Q2(b) Convert the following infix notation to postfix notation: $A * ( B / C ) / E + F$ 2 marks · Short answer
- Q2(c) Define Interface. How is it different from a Class? 2 marks · Short answer
- Q2(d) Each element of an array $arr[15][20]$ requires '$W$' bytes of storage. If the address of $arr[6][8]$ is 4440 and the Base… 2 marks · Numerical
- Q2(e) Define Big ‘O’ notation. State the two factors which determine the complexity of an algorithm. 2 marks · Short answer
- Q3 The following is a function of some class. What will be the output of the function test ( ) when the value of count is equal to 4… 5 marks · Short answer
- Q4(a) Given the Boolean function $F(A, B, C, D) = \Sigma (0, 2, 3, 6, 8, 10, 11, 14, 15)$: Reduce the above expression by using… 5 marks · Drawing
- Q4(b) Given the Boolean function $F(P, Q, R, S) = \pi (5, 7, 8, 10, 12, 14, 15)$: Reduce the above expression by using 4-variable… 5 marks · Drawing
- Q5(a) Draw the logic diagram and truth table to encode the decimal numbers (2, 3, 5, 7, 8) and briefly explain its working. 5 marks · Drawing
- Q5(b) Simplify the following Boolean expression and draw the gate for the reduced expression: $F = A'B + AB'C + A$ 3 marks · Drawing
- Q5(c) Define Universal gates. Give one example and show how it works as an OR gate. 2 marks · Short answer
- Q6(a) Draw a truth table with a 3 input combination which outputs 1 if there are odd number of 0’s. Also derive an SOP expression for… 5 marks · Drawing
- Q6(b) Define Proposition. How does tautology differ from contradiction? 3 marks · Short answer
- Q6(c) Draw the logic diagram of 4:1 Multiplexer. 2 marks · Drawing
- Q7 A class Composite contains a two dimensional array of order [m x n]. The maximum value possible for both ‘m’ and ‘n’ is 20… 10 marks · Program
- Q8 Design a class Sort which enables a word to be arranged in alphabetical order. The details of the members of the class are given… 10 marks · Program
- Q9 A Special number is a number in which the sum of the factorial of its digits is equal to the number. Example: 145 (… 10 marks · Program
- Q10 An interface Shape is defined with a method area() which returns the area of the implementing shape. Create the classes Circle… 5 marks · Program
- Q11 Circular Queue is a linear data structure in which the operations are performed based on FIFO (First In First Out) principle and… 5 marks · Program
- Q12(a) A linked list is formed from the objects of the class Node. The class structure of the Node is given below: … Write an Algorithm… 2 marks · Short answer
- Q12(b) Answer the following questions from the diagram of a Binary Tree given below: Name the Root and the leaves of the tree. Write the… 3 marks · Short answer