Scribd
Upload
238 views1 page

EE2001 Digital Systems Quiz 1: (A+B+C) (A'+B'+D') (A'+B'+C') (A+B+D

This document provides details for a digital systems quiz with 4 questions covering logic expressions, minimization techniques, and circuit implementation. Question 1 involves finding the dual, complement, and expanded form of logic expressions and simplifying using Boolean theorems. Question 2 uses Karnaugh maps to minimize a logic function for implementation with NOR gates. Question 3 applies Quine-McCluskey method to simplify an expression. Question 4 provides truth tables for a 1-bit full adder and asks to implement it using a decoder and OR gates.

Uploaded by

Sanchit Gupta
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
238 views1 page

EE2001 Digital Systems Quiz 1: (A+B+C) (A'+B'+D') (A'+B'+C') (A+B+D

This document provides details for a digital systems quiz with 4 questions covering logic expressions, minimization techniques, and circuit implementation. Question 1 involves finding the dual, complement, and expanded form of logic expressions and simplifying using Boolean theorems. Question 2 uses Karnaugh maps to minimize a logic function for implementation with NOR gates. Question 3 applies Quine-McCluskey method to simplify an expression. Question 4 provides truth tables for a 1-bit full adder and asks to implement it using a decoder and OR gates.

Uploaded by

Sanchit Gupta
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

EE2001 Digital Systems

Quiz 1
(open book)
Marks: 20
Time: 50 mins
1) (a) Find the dual and complement of the following logic expression (do not simplify):
AB(C + DE) + 0
(2 marks)
(b) Multiply out to get SOP expression of:
(A+B+C)(A+B+D)(A+B+C)(A+B+D)
(1 marks)
(c) Simplify the following logic expression using Boolean theorems:
AB + ABC + BC
(2 marks)

2) Using K-map method, minimize F so as to realize it using only NOR gates. Draw the final
simplified circuit. (Assume A as MSB in the order shown).
F(A, B, C, D) = m (1, 3, 4, 6, 9, 11, 12, 14) + d (5, 10, 15) .
(5 marks)

3) Using QM method simplify the following expression. (Assume a as MSB in the order)
f( a, b, c, d) = m (0, 5, 7, 11, 13, 15 ) .

(5 marks)

4) In an 1-bit full adder with inputs a and b with carry cin, the outputs sum and cout are
given by sum = a b cin and cout = ab + a cin + b cin . Write the truth table for this.
Now implement this full adder using one 3-8 decoder (active high type without any
enable) and additional OR gates.
(5 marks)

You might also like