THE TOP 100 FULL FORMS RELATED TO COMPUTERS: PC - Personal Computer CPU - Central Processing Unit RAM - Random Access Memory ROM - Read-Only Memory GPU - Graphics Processing Unit HDD - Hard Disk Drive SSD - Solid State Drive USB - Universal Serial Bus BIOS - Basic Input/Output System LAN - Local Area Network WAN - Wide Area Network WLAN - Wireless Local Area Network TCP/IP - Transmission Control Protocol/Internet Protocol URL - Uniform Resource Locator HTML - HyperText Markup Language CSS - Cascading Style Sheets HTTP - Hypertext Transfer Protocol HTTPS - Hypertext Transfer Protocol Secure DNS - Domain Name System ISP - Internet Service Provider VPN - Virtual Private Network JPEG - Joint Photographic Experts Group GIF - Graphics Interchange Format PNG - Portable Network Graphics PDF - Portable Document Format OCR - Optical Character Recognition GPS - Global Positioning System ASCII - American Standard Code for Information Interchange IDE - Integrated Development Environment API - Appli...
CHAPTER
– 2
BOOLEAN
ALGEBRA
1m×1=1 mcq 2m×2 = 4 5m×1 =5 Total = 10m
I. Two Marks Questions.
1. Prove
that X+XY =X. (M-15)
2. Define
Min term and Max term. (M-15)***
3. State
and prove involution law. (J-15)
4. What
is principle of duality? (J-15)
5. Prove
( X+Y) (X+Z) = X+YZ using algebraic method.
(M-16)
6. What
are Minterms and Max terms? (M-16)
7. Prove
algebraically that ( X+Y) ( X+Y̅) = X.
(J-16)
8. State
and prove Commutative law using truth table.
(J-16)
9. Prove
algebraically X+XY =X. (M-17)
10. State
the principle of duality. Write the dual of 1+X = 1. (M-17)
11. State
and prove Complementary law. (J-17)
(J-18)
12. Find
the Complement of the expression F = XY̅+XZ̅+X̅Y. (J-17)
13. What
is Minterm and Maxterm? (M-18)
14. Prove
X(X+Y) = X. (M-18)
15. State
and prove any one DeMorgan’s Theorem
using truth table. (J-18)
16. Prove
that X. X̅ = 0 by perfect induction method.
(M-19)
17. Prove
X.(X+Y) = X algebraically. (M-19)
18. Prove
X+XY=X algebraically. March 2023
19. Define
minterm and maxterm. March 2023
II. Five Marks Questions.
1. Given
the boolean function F(A,B,C,D) = ∑ ( 0,4,8,9,10,11,12,13,15 ) reduce it by
using karnaugh map. (M-15)
2. Reduce
F( A,B,C,D) = ∑ (1,2,3,4,5,7,9,11,12,13,16) using karnaugh map. (J-15)
3. Using
K-map simplify the following expression in four variables F(A,B,C, D) = m1+m2+m4+m5+m9+m11+m12+m13. (M-16)
4. Reduce
F(A,B,C,D) = ∑ (1,5, 9,10,11,12,13,14) using K-map. (J-16)
5. Reduce
F(A,B,C,D) = ∑(0,4,6,7,8,12,14,15) using K-map.
(M-17)
6. Simplify
the following boolean function using K-map
F(A,B,C,D) = ∑(0,2,5,7,8,10,3,15). (J-17)
7. Simplify
the following boolean function using K-map
F(A,B,C,D) = ∑(1,2,3,5,7,8,9,11,13,15). (M-18)
8. Simplify
the following boolean function using K-map
F(A,B,C,D) = ∑(0,2,4,5,6,7,8,10,12,13,14,15). (J-18)
9. Simplify
the following boolean function using K-map
F(A,B,C,D) = ∑(0,1,2,3,4,6,8,10,12,14). (M-19)
10. Given
the Boolean function F( A,B,C,D) = ∑( 0, 1, 2, 3, 4, 8, 12, 13) Reduce it by using
K-map. March 2023
Comments
Post a Comment