Explain De-Morgan’s Law. Simplify the Boolean function F(P,Q,R,S)= Π(0,1,4,5,11,14,15) and d(P,Q,R,S)= Σ(2,3,7,8,9,13) using K-Map in both SOP and POS form.
Marks: 10Chapter: Unit 2: Boolean algebra and Logic Gates (5 Hrs.)
Chapter Study
Bsc CSIT Semester 1 – Digital Logic – Unit 2: Boolean algebra and Logic Gates (5 Hrs.)
Comprehensive questions and detailed answers for Unit 2: Boolean algebra and Logic Gates (5 Hrs.). Perfect for exam preparation and concept clarity.
4
Questions
25
Marks
Explain De-Morgan’s Law. Simplify the Boolean function F(P,Q,R,S)= Π(0,1,4,5,11,14,15) and d(P,Q,R,S)= Σ(2,3,7,8,9,13) using K-Map in both SOP and POS form.
HardTHEORY10 marks2081(TU Final)
Write short notes on (Any Two)
a. Negative Logic
b. CMOS
c. EBCDIC
MediumTHEORY5 marks2078(TU Final)
Where is CMOS suitable to use? Define Power dissipation. Show that the positive logic NAND gate is a negative logic NOR gate and vice versa.
MediumTHEORY5 marks2077(TU Final)
Write short notes on (any two):
a. State diagram
b. De-Morgan’s theorem
c. TTL
MediumTHEORY5 marks2074(TU Final)
Showing 4 questions
Sample Questions
Write short notes on (Any Two) a. Negative Logic b. CMOS c. EBCDIC
Marks: 5Chapter: Unit 2: Boolean algebra and Logic Gates (5 Hrs.)
Where is CMOS suitable to use? Define Power dissipation. Show that the positive logic NAND gate is a negative logic NOR gate and vice versa.
Marks: 5Chapter: Unit 2: Boolean algebra and Logic Gates (5 Hrs.)
Write short notes on (any two): $\quad$ a. State diagram $\quad$ b. De-Morgan’s theorem $\quad$ c. TTL
Marks: 5Chapter: Unit 2: Boolean algebra and Logic Gates (5 Hrs.)