Paper Code: 1305
1505
B.sc. (Computer Science) (Part 1)
Examination, 2014
Paper No. 2.2
DIGITAL LOGIC AND COMPUTER DESIGN
Time: Three Hours] [Maximum Marks: 33
Note: Attempt any five questions. All questions carry equal marks.
1. (a) What do you mean by Boolean algebra? Enumerate its various postulates.
(b) What are various universal gates? Prove it with proper examples.
2. Simplify the Boolean function F together with the don’t care condition d in:
- Sum-of-product form
- Product-of-sum form
3. What do you mean by combinational circuit? Design and implement a full sub tractor with basic logic gates? Also minimize the obtained circuit with the help of k-map.
4. (a) Implement the following function with a multiplexer:
(b) Define decoder and draw the logic design to 3 to 8 line decoder.
5. (a) Convert an S-R flip-flop to a J-K flip-flop.
(b) Draw and explain master-slave flip-flop with a proper logic diagram.
6. What is Counter? Design a four bit ripple counter and explain.
7. Define the following:
- Registers
- Register transfer
- Register transfer language
- Micro operation
- Control function
8. (a) How many 128×8 memory chips are needed to provide a memory capacity of 4096×16?
(b) The following memory are specified by the number of words times the number of bits per word. How many address lines and input-output data lines are needed in each case?
- 2K×16
- 16M×32
9. Write short notes on any four of the following:
- Overflow
- Arithmetic shift
- Magnitude comparators
- RAM
- State reduction
……………End………….
Leave a Comment