COMPUTER SCIENCE PAPER 1(THEORY)

PART I

Answer all questions

Question
(a) If X = A' BC + AB' C+ABC + A' BC! [2)
then find the value of X when A= 1;B=0:C= 1
(b) Verily if. P.(-P+ Q)=(P>Q) using truth table. (2]
(C) Draw the logic circuit of NOR sing NAND gate only.
(d) Convert the following function into its Canonical sum-of-products form: (21
F(X,Y.Z) =2(0,1.5,7).
(e) Show that dual of P' QR' + PQ'R + P'QRis equal to the complement of: (2]
PQ'R+ Q. (P'R'+PR')
 MARKING SCHEME
Question 1.
(a) X =A'BC + AB'C + ABC + A'BC"
= l'.0.1+ 1.0".1 + 1.0.1+ 1'.0.J"
0 + 1 + 0 + 0

(b) P Q Q' -P+Q" P.(-P+Q") P =>Q

0 1 0 1

0 1 0

1 0 0
0 0 0

[Not verified |
(c) NOR ( A+ B)' =A'.B*

A
(A+B'

(d) 0= X*.Y2
B ; 1=X.Y.Z : 5=X.Y2 7= X.Y.2
= X*YZ' +X*YZ+ XY'Z +XYZ
(e) Dual of P'QR' + PQ'R + P'Q'R
= (P'+Q+R'). (P+Q+R). (P'+Q'+R)

Complement of PQ"R +Q. (P'R' + PR')

- (PQ'R + P'QR' + PQR']'
-(PQ'R)'.(P'QR')' .(PQR')'
- (P'+Q+R'). (P+Q'+R). (P'+Q+R).
 COMPUTER SCIENCE PAPER 1 (THEORY)

Question 1
(a) State the two Absorption laws. Verify any one of them using truth table. (2)
(b Reduce the following expression:
F(A.B,C) (0,1,2,3,4,5,6,7)
Also find the complement of the reduced expression.
(c) Name the logic gate for the following circuit diagram and write its truth table. (2)
A B

(d) Using truth table, verify whether the following is true or false:
(p»)- (»p)
(e) If A=1, B=0, C=l and D=1 find its :
(i) Maxterm
(iü) Minterm
MARKING SCHEME
Questlon 1,
(a) Absorption law states that :
A+ A.B A
A. (A+B) =A

ABA+B A.(A+B)
00
|01 1 0

(b)
B'C' B'C BC BC:
0 1 3 2
A 1 1 1
6
A 1 1 1

Output= 1; complement =0
(C) Logic gate is OR gate (A + B)
A A+B
0

(d
1
01 1 0 1
0
0 0
 COMPUTER SCIENCE PAPER 1(THEORY)
PART I
Answer all questions.
While anSwering questions in this Part, indicate briefly your working and reasoning,
wherever required.
Questionl
(a) State the Principle of Duality. Write the dual of: |2|
(P+Q).R.l = P.R + Q.R
(b) Minimize the expression using Boolean laws: [21
F=(A + B').(B + CD)
(C) Convert the following cardinal fon of expression into its canonical form:
F(P.Q.R) = n (13)
(d) Using a truth table verify: [2]
(~p=> q) ap=(p A ~) v (p a q)
(e) If A= 1 and B =0, then find: (2
(A'+ 1),B
(ii) (A + B')'
MARKING SCHEME
Question 1.
(a) To every Boolean equation there exists another equation which is dual to the prvious equation.
This is done by changing AND's to OR's and vice-versa, 0's to 1's and vice-versa.
complemnents remain unchanged.
Dual: (P.Q') +R+0 =(P+R).(Q'+R)
(b) F =(A+ B').(B +CD)'
F =(A +B' ). (B'.(CD)' )
F =AB' +B'B'. (C'+ D')
F -B'.(C'+D')
(c) F(P.Q.R) = (1, 3)
=001,011
- (P+Q+R'). (P +Q'+R')
(d) (p=>q)Ap = (pA-q)Vp Aq)
p=>q|LH.S pAq pAq R.H.S
) 1 (C
0 0

0 0

(e) (i) (A'+1).B

= (0+1 ).0 =)

(ii) (A +B')
-(1+1 )' =(1)' =0
 COMPUTER SCIENCE PAPER 1 (THEORY)
PART I

Answer all questions.

While answering questions in this Part, indicate briefly your working and reasoning,
wherever required.
Question1
(a) Fom the logic circuit diagram given be low, find the output 'F' and simplify it. [2]
Also, state the law represented by the logic diagram.

(b Write the truth table for a 2-input conjunction and disjunction in a poposition. (2]
(c) Find the complement of XY'Z+XY + YZ' [2]
(d Convert the following expression into its canonical POS form: [2]
F(A,B) =(A+ B). A'
(e) Minimise the following Boolcan expression using the Karnaugh map: [2]
F(A.B.C) = ABC+ ABC+ABC+ ABC
MARKING SCHEME

Question 1.
(a) (P+Q) (P+R) = P+Q.R Distributi ve Law
(b) |A B Conjunction A B Disjunction
0 0 0 0
0 0
0 1
1

(c) (XYZ+ XY + YZ')

(X'+Y+Z').(X+Y').(Y+Z)
OR (X+Y+Z').(Y'+XZ)
(d) (A+B)A"
= (A+B) (A'+ B.B')

= (A+B)(A'+B)\A'+B')
e)
B'C B'C BC BC'

3 2
A' 0 1 1
4 5 6
A 1

Quad ( m2 + m3 + mó + m7 )= B
 COMPUTER SCIENCE
PART I

Answer all questions.

While answering questions in this Part, indicate briefly your working and reasoning,
wherever required.
Question1
(a) Simplify: (A +C)(A+ A-D) + A-C +C [2]
(b) Draw a logic circuit for (A + B)·(C + D)C [2)
(c) Verify the following proposition with the help of a truth table: [2]
Pv(-PA Q) =PvQ
(d) State De Morgan's law and verify it, using a truth table. [2]
(e) Answer the questions related to the circuit given below: [2]

(i) Give the output if. X=land Y=0

(ii) Name the basic gate represented by the above diagranm.
MARKING SCHEME
Question 1.
(a) Simplify: (A + C) (A + AD) + AC +C
(A +C) A+ AC +C
A + AC +AC +C
A+C
(b) Logic circuit for ( A+B).(C+D).C

(c) Proving of Pv-PAQ=PvQ

LHS RHS

P -P -PAO PV-PAQPV Q
0
1 1

1 1

(d) De Morgan's lawstates that the complement of sum of the variables is same as product
of the individual complements of the variables and vice-versa.
(A.B)' = A' + B' (A+B)' =A'.B'

A B A.B (A.B)'A+B'
0 1

0
(e) (i) 1
(ii) OR gate
 COMPUTER SCIENCE

PART I (20 Marks)

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

(a) State Involution law and prove it with the help ofa truth tab le. EEE E
(b) Show that X V ~(Y A X) is a tautology.
(c) Find the dual of.:
Y-X+ X+1=1
(d) Write the maxterm and mintem, when the inputs are A=0, B=1, C=l and D-0.
(e) Draw the logic circuit of a NAND gate using NOR gates only.
MARKING SCHEME
Question 1.
(a) Involution Law states that the double complement of a variable returns to the same variable.
i.e. (A')'= A
Truth Table:
A A' (A''
0
1

(b) X V ~(YAX)

X Y YAX ~(Y AX)X V ~(YA X)

0 0 1
0
0 0 1
0 1

Hence, it is a Tautology

(c)| Dual of: Y.X + X' +1= |

-(YtX) . X 0 = 0

(d)A B D MAXTERMS MINTERMS

0 A+B'+C+D A'.B.C.D'

(e) Logic Circuit of aNAND gate using NOR gates:

NAND Expression = A+B' OR (A.B)'

(A B)
 Part I (20 marks)
Answer all questions.
While answering questions in this Part, indicate briefly your working and reasoning,
wherever required.
Question1
(a) State the law represented by the following proposition and prove it with the help of a [1
truth table:
PVP=P
(b State the Pindple of Duality.
(c) Find the complement of thefolloing Bod can exp ress onusing De Morgan'sl aw:
F(a,b,c) = (b' +c)+ a
(d) Draw the logic diagram and truth table for a 2 input XNOR gate.
If (~P -> Q) then wite its:
(i) Inverse
(ü) Converse
 MARKING SCHEME
Question 1
(a) Law : Idempotent Law. It states that PVP=Pand P A P=P.
Truth Table:
P P PVP

(b) Principle of Duality states that, to every Boolcan Equation there exists another equation which is
dual to the original equation. To achieve this, the AND's () are converted to OR's
(+) and vice-versa, 0's to 1's and vice versa, however, the complements remain unchanged.

(c) Complement of: E(a,b,¢j = (&'tc)ta

= (b' + c)' .a'
= b''.c' .a' = b.c'.a'

(d) XNOR gate:

A X
X

1 1 1

(e) If (~P>Q ) then;

(i) Inverse: (P=>~Q) OR P'+Q"

(ii) Converse :(Q=>~P) OR Q'+ P"
 Part I(20 Marks)
Answer all questions.
While answering questions in this Part, indicate briefly your working and
reasoning, wherever required.
Question 1
(a) State the Commutative law and prove it with the help of a truth table. [1]
(b) Convert the following expres sion into its canonical POS form: [1)
F (X, Y, Z) - (X+Y"). (Y'+Z)
(c) Find the dual of: []
(A'+ B). ( +B') =A'+ B
(d) Verify the following proposition with the help of a truth table [1
(PA)v (PA~ ) =P
(e) If F(A, B, C) = A' (BC'+ B'C), then find F [1
 MARKING SCHEME
Question 1
(a) Law: Commutative Law (i) A+B =B+A (ii) A.B-B. A
Truth Table:
A |B A+B B+A
0

(b) F(X, Y, Z) -(X+Y).(Y+Z)

- (X+Y+0). (Y'+Z+0)
= (X+Y't (Z.Z'). (Y+Z+ (X.X))
= (X+Y'+Z). (X+Y+Z"). (X+Y+Z). (X+Y'+Z)
- (X+Y'+Z). (X+Y'+Z'). (X'+y'+Z)

(c) Equation: (A'+ B). (1+B') = A'+B

Dual = A'. B+0.B' =A'.B

(d) Verify: (PaQ)v(PA-Q) =P

P PAQ PA-Q (PAQM(PA-Q)
0 |0 0
0
1
-

1 1

(e) F (A, B,C) =A'(BC+B'C)

F'=A"+ (BC" +B'C)"
- A+ (BC')'. (B'C)'
=A+ (B +C). (B +C')
 COMPUTER SCIENCE
PAPER1
(THEORY)
(Maximum Marks: 70)
(Time allowed: Three hours)
(Candidates are allowed additional 15 minutes for onty reading the paper.
They must NOT start writing during this time.)
Answer all questions in Part I (compulsory) and sir questions fron Part-lI, 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)

Answer all questions.
While answering questions in this Part, indicate briefly your working and reasoning,
wherever required.
Question 1
(a) Name and draw the logic gate represented by the following truth table, where A [1]
and B are inputs and X is the output.
A X
0
0
0

(b) Write the canonical POS expression of: F(P, Q) = (0,2 ) [1]
(c) Find the dual of: X.Y +X.Y'= X+0 [1]
(d) If F(A, B, C)= A'.B'.C + A'.B.C then find F using De Morgan's Law.
(e) If A= "t is cloudy" and B= "It is raining", then write the proposition for: [1]
Contrapositive
(i1) Converse
 ISCPAPER -2020
COMPUTER SCIENCE
PAPERI
(THEORY)
Time allowed: Three honrs Maxium Marks: 70
(Candidates ane allowed adduional 15 minutes for onty reading the paper.
They nust NOT start writing during this tine)
Auswar all questions in Pan I (conepulsoy) and six questions fiomPart-l, choosing thvo questions from Sacnion-4,
wo fromSection-B aud DrofromSection-C.
Al working, fncluding rotvgh work, should be done on dhe sane sheet as the
rest of uhe ainswer.
The intended narks for questions or parts of questions are given in brackets [J.
PART- I (20 MARKS)
Answer al! questions.
While answering questions in this Part, îndicate bricfly yor workiug and reasoning
wherever required.
Question 1. (c) Dual is found by making he following two replacemenls:
0 and + .
(a) State the properties of zcro in Boolean algebra. (0]
Hence we bave,
(6) Find tbe complement of the following Boolean
cxpression using De Morgan's law: [1) (A'. I)+ (B'.0)=A'
F(P.Q,R)=P+(QR) ) Let us creale its truth table
(c) Find the dual of (A+0).(B' + I) =A' PQP>QPQ->-PP-(P>QV
() State whelber the following proposition is a tautology, (Q=>)
contradiction or a contingency: () 00 1

F-(P> Q)V(Q) 1
(e) Study the diagram given below and answer the 1
questions that follow: 1 0 1
It is clear from tbe table it is a tautology.
(e) (0 OR gate

B () I
Question 2.
0 Name the basic gate which is represegted by the ) State the diierence betwecen a Binary Iree structre
diagram. and a single Linked List. [2]
is stored in be nemory with each
() What will be the value of Xwhen A=Í and R02 0) h maux B|10]|20]
element requiring 2bytes ofstorage. Ifthe base address
Answer: ar B{2)] is 2140, find the address of B[S)]14) when the
(a) Here are the properties of zero : matrix is stored in Column Major Wise. [2]
X+0= X
(c) Covert be following infiu notation to prefix forn:
X.0=0 12
(6) FP+ (Q.R)
f'= (P+(Q.R))' () State the best case and the worst case complexity for
-P.(Q.RY bubble sort algorithm." [2)
-P'.(Q" + R') (e) What is the signiticance of the keyword new' in Java?
Menlion he arcas where it is used. [2)