St

1 YEAR CLASS TEST EXAMINATION, 2014

COMPUTER SCIENCE
HONOURS
FIRST PAPER (DIGITAL)
Full Marks 25

Time 45
Hours

The figure in the margin indicate full marks

Candidates are required to give their answers in their own words as far as
practicable
[Answer Question No. 1 and any TWO from the rest]

1. Answer any five questions:

5x2=10
a. What do you mean by Duality in Boolean algebra?
b. What is Gray Code?
c. Convert AA6.FF base 16 into Octal. What do you mean by Parity Bit?
d. Convert 561 base 8 into hexadecimal.
e. What is Propagation Delay?
f. What do you mean by canonical form?
g. Define De Morgans Theorem.
h. What do you mean by Self Complementing Codes?
i. Perform 1100110 1110110 using 2s Complement.
Group C
(Digital System Design)
1. a) Simplify following Boolean function using K-map: f(A, B, C, D)= m(1,3,4,9,10)
+ (2,7,12).
Draw the circuit using NAND Gates only.
3
b) Draw the circuit diagram of BCD Adder.
3
c) Prove that NAND and NOR Gate are Universal Gates.
4
d) Implement Full Adder Function by PLA.
5
2. a) Design a 4x16 Decoder using 3x8 Decoder and other gates.
3
b) Compare PLA and ROM. What do you mean by Encoder?
4
c) Construct Full Substractor using Multiplexer.
4
d) Design a BCD to Ex-3 Converter circuit using Logic Gates.
4
4. Write Short notes the following: (any three)
3x5
a) 65 37 and -32 + 45 using 8 bit format and 1s compliment
b) 2 bit Magnitude Comparator.
c) 4 bit Parallel Adder/Subtractor.

d) ASCII and EBCDIC Code