Scribd
Upload
8 views1 page

Boolean Logic and Gate Implementation

The assignment for the Department of Information Science and Engineering at Poojya Doddappa Appa College of Engineering covers various topics including basic gates with circuit diagrams and truth tables, positive and negative logic, and the use of K-Maps for minimizing Boolean functions. It also includes tasks related to designing a majority logic circuit and simplifying Boolean equations using the Quine McClusky method. Students are required to implement their findings using basic gates and provide truth tables and Boolean expressions in specified forms.

Uploaded by

corporatekumartaken
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
8 views1 page

Boolean Logic and Gate Implementation

The assignment for the Department of Information Science and Engineering at Poojya Doddappa Appa College of Engineering covers various topics including basic gates with circuit diagrams and truth tables, positive and negative logic, and the use of K-Maps for minimizing Boolean functions. It also includes tasks related to designing a majority logic circuit and simplifying Boolean equations using the Quine McClusky method. Students are required to implement their findings using basic gates and provide truth tables and Boolean expressions in specified forms.

Uploaded by

corporatekumartaken
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

Poojya Doddappa Appa College of Engineering, Kalaburagi

Department of Information Science and Engineering

Module 1 - Assignment

1. List basic gates giving its circuit diagram and truth table. Realize basic gates
using NAND and NOR gate.
2. Explain positive and negative logic and list its equivalence between positive and
negative logic.
3. Find the minimal POS and SOP for the following Boolean function using K-Map.
a. F (A, B, C, D) = Σ m (6,8,9,10,11,12,13,14,15).
b. F (W, X, Y, Z) = Σ m (1,3,6,7,8,9,10) + d (12,13,14).
c. F (A, B, C, D) = M (1,2,3,4,9,10) + d (0,15).

4. The system has four inputs; the output will be high only when the majority of the
inputs are high. Find the following
a. Give the truth table and simplify by using k-map.
b. Boolean expression in Σm and M form.

c. Implement the simplified equation using basic gates.


5. Simplify the following Boolean equation using Quine McClusky method.
a. F (A, B, C, D) = Σ m (0,1,2,10,11,12,13,14,15)
b. F (W, X, Y, Z) = Σ m (1,3,6,7,8,9,10) + d (12,13,14).

You might also like