Table Of Contents
In This Blog, We are discussing for Top 5 important questions with solution in Digital System design AKTU B.Tech. Unit-01 Logic Simplification and Combinational Logic Design.
Dudes 🤔.. You want more useful details regarding this subject. Please keep in mind this as well. Important Questions For Digital System Design: *Unit-01 *Unit-02 *Unit-03 *Unit-04 *Unit-05 *Short-Q/Ans *Question-Paper with solution 21-22
Q1. Design a combinational circuit that converts a BCD code to excess-3 code.


1.The maps in Fig. 14.1, are plotted to obtain simplified boolean function for the outputs.
2. The boolean expressions created from the maps can be used to directly generate a two-level logic diagram of each output.


Maps for BCD to excess-3 code converter.


Que 2. Simplify the following boolean expression to a minimum number of literals.




Que 3. Simplify the Boolean function.
F (w, x, y, z) = Σm(1,3,7, 11, 15)
which has the don’t care conditions
d (w, x, y, z) = Σd(0, 2, 5)
Answer
1. F(w, x, y, z) = Σm(1, 3, 7, 11, 15)
and don’t care conditions
d(w, x, y, z) = Σd(0, 2, 5)


Q4. Simplify the boolean function Y together with don’t care condition d using K-map and implement it with two level NAND gate circuit.
Y= BD+ BCD+ ABCD
Answer:




Q5. Simplify the following Boolean function using K-map Y= Σm (0, 1,3, 5,6, 7,9, 11, 16, 18, 19, 20, 21, 22, 24, 26)


Que 6.Use Quine-McCluskey (QM) method to solve the following function: F(A, B, C, D) = Σm(5, 7,8, 9, 10, 11, 14, 15)
Answer:






Important Question with solutions | AKTU Quantums | Syllabus | Short Questions
Digital System Design Quantum, Syllabus, Important Questions
Label | Link |
---|---|
Subject Syllabus | Syllabus |
Short Questions | Short-question |
Important Unit-1 | Unit-1 |
Important Unit-2 | Unit-2 |
Important Unit-3 | Unit-3 |
Important Unit-4 | Unit-4 |
Important Unit-5 | Unit-5 |
Question paper – 2021-22 | 2021-22 |
Digital System Design Quantum PDF: | AKTU Quantum PDF:
Quantum Series | Links |
Quantum -2022-23 | 2022-23 |
AKTU Important Links | Btech Syllabus
Link Name | Links |
---|---|
Btech AKTU Circulars | Links |
Btech AKTU Syllabus | Links |
Btech AKTU Student Dashboard | Student Dashboard |
AKTU RESULT (One VIew) | Student Result |
5 thoughts on “Unit 01-Logic Simplification and Combinational Logic Design | Digital System Design AKTU B.tech”