Scribd
Upload
33 views1 page

ASSIGNMENT NO 1 - Unit 1 - DELD - 18 - 07 - 2024

This document outlines Assignment No. 1 for SE III, focusing on Boolean algebra and logic circuit design. It includes tasks for minimizing expressions using Boolean rules and K-Maps, as well as designing a logic circuit based on majority input. The assignment is due on July 25, 2024, and consists of multiple parts with specific instructions for each task.

Uploaded by

marnesum2503
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
33 views1 page

ASSIGNMENT NO 1 - Unit 1 - DELD - 18 - 07 - 2024

This document outlines Assignment No. 1 for SE III, focusing on Boolean algebra and logic circuit design. It includes tasks for minimizing expressions using Boolean rules and K-Maps, as well as designing a logic circuit based on majority input. The assignment is due on July 25, 2024, and consists of multiple parts with specific instructions for each task.

Uploaded by

marnesum2503
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
You are on page 1/ 1

ASSIGNMENT NO.

1 DELD UNIT 1
Class: SE III SEM I 2024-2025

Assign date: 18_07_24 Completion date: 25_07_24

PART A

1. Minimization of Expression using Boolean Algebra rules


- (J + KL’) (JK’ +L)
- P’(P + QR) + (PC + Q’R)
- BC’D’ + ABC’D + AB’C’D + ABCD + AB’CD + ABCD’ + AB’CD’
- A′B+BC′+BC+AB′C′
PART B
1. Design a logic circuit having 3 inputs, A, B, C will have its output HIGH only when a majority of the
inputs are HIGH.
Steps to solve 1. Set up the truth table 2. Write the AND term for each case where the output is a 1.
3. Write the SOP form the output 4. Simplify the output expression
5. Implement the circuit

2. Minimize using K-Map, X = A’ BC + A B’ C + AB C’ + ABC


3. Minimize using K-Map, X = A'B'CD + A'BCD' + A'B'C' +A'B'D' +AC' + B'
4. Minimize using K-Map, X = (A+B=C) (A+B'+C) (A'+B'+C)
5. Minimize using K-Map, X = (A+B'+C') (A+B'+C) (A+B'+C') (A'+B'+C')
6. Minimize using K-map method and draw the diagram. Y = ∑ m (3,4,6,7)
7. Minimize using K-map method and draw the diagram. Y = ∑ m (0,1,3,4,5,6,7,8,11,15)
8. Minimize using K-map method and draw the diagram. Y = ∏ M (0,2,3,8,9,12,13,15)
9. Minimize using K-map method and draw the diagram. Y = ∏ M (0,1,6,7,8,9)
10. Minimize using K-map method and draw the diagram. Y = ∑ m (0,2,5,8,11,15) + d(1,7,14
11. Minimize using K-map method and draw the diagram. Y = ∑ m (1,3,7,11,15) + d(0,2,5)
12. Minimize using K-map and realize using logic gates : Y = ∑ m (1,5,7,13,15) + d (0,6,12,14)
13. Minimize using K-map method and draw the diagram. Y = ∏ M (1,2,3,7,10,11) + d(0,15)
14. Minimize using K-map method and draw the diagram. Y = ∏ M (1,3,5,6,7,10,11) + d(2,4)
10. Using K-MAP Simplification method, derive the expression in SOP and POS form and draw the
logical circuit diagram.

You might also like