Digital Principles and Computer Organization: Chapter 2: Boolean Algebra, Logic Gates and Minimization Techniques: Anna University Part B Important Questions and Answers
Digital
Principles and Computer Organization:
Chapter 2: Boolean
Algebra, Logic Gates and Minimization Techniques
Important
Questions
1.
State and prove DeMorgon's theorem.
2.
State the DeMorgan's law and write any one application.
3.
What are Boolean variables?
4.
Define the following terms: Boolean variable, complement, literal.
5.
State the fundamental postulates of Boolean algebra.
6.
State various laws of Boolean algebra.
7.
State the associative law of Boolean algebra.
8.
State and prove DeMorgan's theorem.
9.
Explain the principle of duality with the help of example.
10.
Write the logic symbol, expression and truth table for the following logic
gates :
1.
i) EX–OR ii) NOR
2.
i) NAND ii) EX–NOR
3.
i) NAND ii) NOR iii) EX–OR
11.
What are universal gates? Give examples.
12.
Why NAND and NOR gates are called universal gates?
13.
Why digital circuits are more frequently constructed with NAND or NOR gates
than with AND and OR gates?
14.
Realize (i) AND gate (ii) NOR gate using only NAND gates.
15.
Show how to connect NAND gates to get an AND gate and OR gate ?
16.
Realize (i) OR gate (ii) AND gate using only NOR gates.
17.
Define switching function.
18.
Define literal, product term and sum term.
19.
Explain sum of product form.
20.
Define SOP and POS terms
21.
What do you mean by standard SOP and POS forms?
22.
Explain how to convert SOP or POS expressions in their standard forms.
23.
What do you mean by minterms and maxterms ?
24.
Differentiate between min term and max term.
25.
Give the steps for simplification of SOP expression.
26.
What do you mean by essential prime implicants?
37.
Write short notes on don't care conditions.
38.
Give the steps for simplification of POS expression.
39.
State the rules for K–map simplification.
40.
Explain the limitations of Karnaugh map.
41.
Show that if all the gates in a two–level AND–OR gate networks are replaced by
NAND gates the output function does not change.
42.
Define an Integrated Circuit (IC).
43.
List a List and briefly describe the three main types of integrated circuits
based on their function. Give one example of each.
44.
Classify integrated circuits based on the scale of integration (SSI, MSI, LSI,
VLSI, ULSI). Write the approximate range of components and give one example for
for each.
45.
State any four advantages of integrated circuits over discrete electronic
circuits.
Digital Principles and Computer Organization: Chapter 2: Boolean Algebra, Logic Gates and Minimization Techniques : Tag: : Digital Principles and Computer Organization - Boolean Algebra, Logic Gates and Minimization Techniques: Important Questions
Digital Principles and Computer Organization
CS25C06 2nd Semester AIDS, CSE, IT, CSE(CY) Dept | 2025 Regulation | 2nd Semester 2025 Regulation
English Essentials II
EN25C02 2nd Semester | 2025 Regulation | 2nd Semester 2025 Regulation
Tamils and Technology தமிழர்களும் தொழில்நுட்பமும்
UC25H02 2nd Semester | 2025 Regulation | 2nd Semester 2025 Regulation
Linear Algebra
MA25C02 2nd Semester | 2025 Regulation
Applied Physics (CSIE) II
PH25C03 2nd Semester AIDS, CSE, IT, CSE(CY) Dept | 2025 Regulation | 2nd Semester 2025 Regulation
Digital Principles and Computer Organization
CS25C06 2nd Semester AIDS, CSE, IT, CSE(CY) Dept | 2025 Regulation | 2nd Semester 2025 Regulation
Basic Electrical and Electronics Engineering
EE25C01 2nd Semester | 2025 Regulation | 2nd Semester 2025 Regulation
Python for Data Science
AD25201 2nd Semester AIDS Dept | 2025 Regulation | 2nd Semester 2025 Regulation
Re-Engineering for Innovation
ME25C05 2nd Semester | 2025 Regulation | 2nd Semester 2025 Regulation
Python for Data Science - Laboratory
AD25201 2nd Semester AIDS Dept | 2025 Regulation | 2nd Semester 2025 Regulation