CLASS 11 Computer Science Term - 4 2021-22
CLASS 11 Computer Science Term - 4 2021-22
CLASS 11
COMPUTER SCIENCE
Reading Time: 10 minutes
Writing Time: 1 hour 30 minutes MM: 50
Instructions:
1: Attempt all questions from skills: Computation(10) and Comprehension & Analysis (20).
2: Attempt any two questions from skill: Application (20) (2 questions from Sections B & C (each))
Skill: Computation (2x5 = 10 Marks)
SECTION A
Part- 1 [10 Marks]
(Attempt all the questions)
Q1. Answer the following:
a) (984)16 + (2D7)16 [1]
b) 10110 – 11010 using 2’s compliment [1]
c) 110101 – 100101 using 1’s compliment [1]
d) (263)8 => ( ? )2 [1]
e) (110.11)2 => ( ? )10 [1]
Q2.
a) A matrix B[10][8] is stored in the memory with each requiring 2 bytes of storage. If the base
address at B[x][1] is 1012 and the address at B[7][3] is 1060, determine the value of ‘x’ where
the matrix is stored in column major wise. [2]
b) State whether the following proposition is a tautology, contradiction or a contingency: [1]
F = (P => Q ) V (Q => ~P)
c) Study the diagram given below and answer the questions that follow
Q4. a) If A =”It is cloudy” and B = “It is raining”, then write the proposition for: [2]
i) Contrapositive
ii) Converse
b) Find the dual of : [2]
X .Y + X. Y’ = X + 0
c) If F(A,B,C) = A’B’C’ + A’BC’ then find F’ using De Morgan’s law. [2]
Q5. a) What are Universal Gates? Construct a logic circuit using NAND gate only for the expression:
A.(B+C) [2]
b) What is a full adder. Draw it’s truth table and logic circuit. [3]
c) Simplify the following expression. Which basic gate does the reduced expression represent?
F= (A+AB). (B+BC). (C+AB)
[3]
Q8. A class Fibo has been defined to generate the Fibonacci series 0, 1, 1, 2, 3, 5, 8, 13,……. (Fibonacci
series are those in which the sum of the previous two terms is equal to the next term).
Some of the members of the class are given below:
Class name : Fibo
Data member/instance variable:
start : integer to store the start value
end : integer to store the end value
Member functions/methods:
Fibo( ) : default constructor
void read( ) : to accept the numbers
int fibo(int n) : return the nth term of a Fibonacci series using recursive technique
void display( ) : displays the Fibonacci series from start to end by invoking the function fibo()
Specify the class Fibo, giving details of the Constructor, void read( ), int fibo(int), and void display( ).
Define the main() function to create an object and call the functions accordingly to enable the task.
Q9. A class ArrayMax contains a R x C matrix which finds the largest element in each row.
Some of the members of the class are given below:
Class name : ArrayMax
Data member/instance variable:
arr[ ][ ] : array to store integer elements
R,C : to store the order of the matrix
Member functions/methods:
ArrayMax( int mm,int nn) : parameterized constructor to initialize the data members and to
declare the array
void readarray() : to accept the array elements
void large( ) : finds and displays the largest element in each row with an appropriate message
void display() : displays the array elements in matrix format only.