Semester : SEMESTER 3
Subject : Switching Theory and Logic Design
Year : 2020
Term : DECEMBER
Branch : COMPUTER SCIENCE AND ENGINEERING
Scheme : 2015 Full Time
Course Code : CS 203
Page:1
Reg No.:
Max. Marks: 100
2
3
4
5 a)
b)
6 a)
b)
Pages: 3
02000CS203092001
Name:
APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY
Third Semester B.Tech Degree (S,FE) Examination December 2020 (2015 Scheme)
Course Code: (5203
Course Name: SWITCHING THEORY AND LOGIC DESIGN
PARTA
Answer all questions, each carries 3 marks.
a) (162)8 (537)% =
0) (37A)16+ (489)16 =
Using truth table prove that (A+B)’= A’B’
Perform subtraction using 2’s complement method.
a) (100). — (110000),
७) (11010)2—(1101)2
Express the given function in sum of minterms and product maxterms form.
F(A,B,C) = C(A’+B) + B’C
PART B
Answer any two full questions, each carries 9 marks.
Perform the following conversions.
i) (231B)i6 = ( )2
ii) (574.32) = ( )2
11) (10110011.01)2 = ) و(
1४) )107(و = ()10
1) (2671) ) (16
Convert the decimal number 5.62 x 10° to IEEE 754 standard single precision
floating point binary number.
Simplify the Boolean function F using the don’t care conditions d, in SOP and
POS forms.
F(A,B,C,D)=A’B’D’ + കന + A’BC
d(A,B,C,D) = A’BC’D + ACD + AB’D’
The sum of all minterms of a Boolean function of 11 variables is 1.
Prove the above statement for n=3.
Page 1 of 3
Duration: 3 Hours
Marks
(3)
(3)
(3)
(3)
(5)
(4)
(5)
(4)