DISTANCE EDUCATION
B.Sc. (Information Technology) DEGREE EXAMINATION,
DECEMBER 2017.
DIGITAL COMPUTER FUNDAMENTALS
(2007 onwards)
Time Three hours Maximum 100 marks
Answer any FIVE questions.
All questions carry equal marks.
x 20
1. Explain how subtraction can be performed in r and
r-1 compliment.
2. Perform the subtraction with the following numbers
using and compliment
11010— 10011
11010-10000.
What is Boolean Algebra? Explain in detail about
the various basic Theorems of Boolean Algebra.
3. Discuss about the importance and usage of Venn
Dagrams in Boolean Algebra.
Demonstrate by means of truth table, the validity of
the De Moigan's Theorem and Associative Law of
Boolean Algebra.
Sub. Code
13
DE-2522
2
wk10
4. What are Karnaugh Maps? Explain how the
simplification of five variable and six variable
Karnaugh Maps can be Implemented.
Give a detailed note on BCD Adders with suitable
truth table and Block Diagram.
5. Summarize how the addition and subtraction can be
performed in parallel arithmetic circuits.
Design a BCD to Excess3 code converter with a
BCD- to Decimal Decoder and four OR Gates.
6. How the triggering of Flip flops can he implemented
in Digital Computers?
Explain the usage and working of Shift and
Bidirectional Shift registers with a suitable
diagram.
7. Write a detailed note on Binary and BCD Ripple
Counters with corresponding diagrams for each of
them.
What is Computer? Explain how the data can be
represented in various forms in Computers.
8. Summarize in detail about the various generations
of computers.
Describe in detail about ROM and its various types.
————————