Semester : SEMESTER 3
Subject : Data Structures using C
Year : 2017
Term : NOVEMBER
Branch : COMPUTER SCIENCE
Scheme : 2020 Full Time
Course Code : BCS 3B 04
Page:1
C 31131 (Pages : 2) ணை رس ட்டை
Time
(१ 4 +
و م صاصم
11,
12,
38.
14,
15.
व بم
THIRD SEMESTER B.Sc. DEGREE EXAMINATION, NOVEMBER 2017
(CUCBCSS—UG)
Computer Science
BCS 3B 04—FUNDAMENTALS OF DIGITAL ELECTRONICS
: Three Hours - ١ Maximum : 80 Marks
Part A
Answer all questions.
Each question carries 1 mark.
A hexadecimal number ‘AO’ has the decimal value
Half adders consist of —————— and —-————_ Gates.
8421 codes is also called as
map technique generally used up to —————— Variables.
The Boolean function Y = AB + CD is to be realised using only 2-input NAND gates. The minimum
number of gates required is
Define Associative Laws of Boolean algebra.
How many flip flops are in need to build 8-bit register ?
Synchronous Counters are —-———— than ripple counter.
The need for the master slave configuration of JK flip flop is
A Sequential Circuit which does not have input clock pulse then it is called
(10 x 1 = 10 marks)
Part B
Answer all questions.
Each question carries 2 marks.
What is an XOR gate ? Give the truth table and logic symbol.
Define minterm and maxterm.
Mention the two application of D Flip Flop.
Explain with a neat logic diagram 4 : 1 MUX.
What are excess 3 codes ?
| (5 x 2 = 10 marks)
Turn over