Scribd
Upload
10 views2 pages

Assignment 1 For DSD

This document is an assignment for Digital System Design at ABES Engineering College, consisting of various problems related to number conversions, Boolean algebra simplifications, truth tables, and logic diagrams. It includes tasks such as converting numbers between different bases, simplifying Boolean expressions using K-Maps, and implementing logic functions. The assignment covers a range of topics essential for understanding digital systems and logic design.

Uploaded by

pathak.rishabh0503
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
10 views2 pages

Assignment 1 For DSD

This document is an assignment for Digital System Design at ABES Engineering College, consisting of various problems related to number conversions, Boolean algebra simplifications, truth tables, and logic diagrams. It includes tasks such as converting numbers between different bases, simplifying Boolean expressions using K-Maps, and implementing logic functions. The assignment covers a range of topics essential for understanding digital systems and logic design.

Uploaded by

pathak.rishabh0503
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/ 2

ABES ENGINEERING COLLEGE, GHAZIABAD

Digital System Design (BEC-302)


Assignment 1
Unit 1

1. Convert the following


i. Hexadecimal equivalent of the decimal number 256
ii. Decimal equivalent of (101001)
iii. 378.9310 to octal
iv. Convert A3BH and 2F3H into binary
2. Convert (454.523)10 to a Hexadecimal number. (AKTU22-23)
3. Simplify: A(A + B’) + (B + AA)(A’ + B)

4. Simplify the expression F(A,B,C) = AB+BC+A’ by K-Map

5 .Convert binary code (00011011) to gray code.

6. Convert the following SOP Boolean expression into POS form ABC+ A’B’C

7. Express the following numbers in decimal: (a) (10110.0101) 2 (b) (16.5) 16

8. List the truth table of the function: (a) F = xy + xy’+ y’z

9. Simplify the following Boolean function using five variable K-Map.


F(A,B,C,D,E)=∑(1,3,5,10,11,12,13,14,15,18,19,20,29,30,31)

10. Minimize the given Boolean function using K map and implement the simplified function
using NAND gate only.
F(A,B,C,D)= ∑m(0,1,2,9,11,15) + d∑ m(8,10,14)

11. What is Demorgan’s law?

12. Draw a NAND logic diagram that implements the complement of the following function:
F(A, B, C, D) = (0, 1, 2, 3, 6, 10, 11, 14)

13. Express the following function as a sum of minterms and as a product of maxterms:
F(A, B, C, D) = B’D + A’D + BD

14. Draw the logic diagram corresponding to the following Boolean expressions without
simplifying them: (a) BC’+ AB + ACD (b) (A + B)(C + D)(A’ + B + D)

15. Convert decimal 8 to gray code and (AF64)16 to binary.


16. Minimize the following Boolean function using tabular method
(QM method)
F(A,B,C,D) = ∑m(1,3,4,5,10,11,12,13,14,15)

17. Simplify the following Boolean functions:


(a) F(A, B, C, D) =π (1, 3, 5, 7, 13, 15)

18. Obtain the 1’s and 2’s complements of the following binary numbers:
(a) 00010000 (b) 00000000 (c) 11011010 (d) 10101010

19. Perform subtraction on the given unsigned binary numbers using the 2’s complement of
the subtrahend. Where the result should be negative, find its 2’s complement and affix a
minus sign. (a) 10011 - 10010 (b) 100010 - 100110 (c) 1001 - 110101 (d) 101000 – 10101

20. Simplify the following Boolean functions, using three-variable maps:


(a) F(x, y, z) = ∑ (0, 2, 4, 5)
(b) F(x, y, z) = ∑ (0, 2, 4, 5, 6)
(c) F(x, y, z) = ∑ (0, 1, 2, 3, 5)
(d) F(x, y, z) = ∑ (1, 2, 3, 7)

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy