Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Recent questions tagged boolean-algebra
0
votes
0
answers
151
Morris Mano Edition 3 Exercise 3 Question 18 (Page No. 112)
Give three possible ways to express the function F with eight or fewer literals. F(A,B,C,D) = $\sum(0,2,5,7,10,13)$
ajaysoni1924
asked
in
Digital Logic
Apr 2, 2019
by
ajaysoni1924
407
views
digital-logic
morris-mano
boolean-algebra
digital-circuits
0
votes
0
answers
152
Morris Mano Edition 3 Exercise 3 Question 15,16 (Page No. 112)
Simplify the following functions and implement them with (15) two- level NOR gate circuits (16) three-level NOR gate circuits. F = wx’ + y’z’ + w’yz’ F(w,x,y,z) = $\sum(5,6,9,10)$
ajaysoni1924
asked
in
Digital Logic
Apr 1, 2019
by
ajaysoni1924
1.7k
views
digital-logic
morris-mano
boolean-algebra
simplification
digital-circuits
0
votes
1
answer
153
Morris Mano Edition 3 Exercise 3 Question 14 (Page No. 112)
Draw a logic diagram using only two input NAND gate to implement the following expression: (AB + A’B’)(CD’ + C’D)
ajaysoni1924
asked
in
Digital Logic
Apr 1, 2019
by
ajaysoni1924
2.5k
views
digital-logic
morris-mano
boolean-algebra
digital-circuits
logic-diagram
0
votes
0
answers
154
Morris Mano Edition 3 Exercise 3 Question 13 (Page No. 112)
Draw the NAND gate logic diagram that implements the complement of the following funcions: F(A,B,C,D) = $\sum ( 0,1,2,3,4,8,9,12)$
ajaysoni1924
asked
in
Digital Logic
Apr 1, 2019
by
ajaysoni1924
631
views
digital-logic
morris-mano
boolean-algebra
simplification
digital-circuits
1
vote
0
answers
155
Morris Mano Edition 3 Exercise 3 Question 12,17 (Page No. 112)
Simplify the following expressions and implement them with (12)two-level NAND gate circuits (17) three-level NAND gate circuits (a) AB’ + ABD + ABD’ + A’C’D + A’BC’ (b) BD + BCD’ + AB’C’D’
ajaysoni1924
asked
in
Digital Logic
Apr 1, 2019
by
ajaysoni1924
764
views
digital-logic
morris-mano
boolean-algebra
simplification
digital-circuits
2
votes
1
answer
156
Morris Mano Edition 3 Exercise 3 Question 11 (Page No. 112)
Draw the AND-OR gate implementation of the following function after simplifying it in (a) sum of products and (b) product of sums. F= (A,B,C,D) = $\sum (0,2,5,6,7,8,10)$
ajaysoni1924
asked
in
Digital Logic
Apr 1, 2019
by
ajaysoni1924
1.8k
views
digital-logic
morris-mano
boolean-algebra
k-map
0
votes
0
answers
157
Morris Mano Edition 3 Exercise 3 Question 10 (Page No. 112)
Simplify the following boolean expressions into (1) Product of sums (2) sum of products. x’z’ + y’z’ + yz’ + xy AC’ + B’D + A’CD + ABCD (A’ + B’ + D’)(A + B’ + C’)(A’ + B + D’)(B + C’ + D’)
ajaysoni1924
asked
in
Digital Logic
Apr 1, 2019
by
ajaysoni1924
555
views
digital-logic
morris-mano
boolean-algebra
simplification
k-map
0
votes
0
answers
158
Morris Mano Edition 3 Exercise 3 Question 9 (Page No. 111)
Simplify the following boolean functions in product of sums: F(w,x,y,z) = $\sum(0,2,5,6,7,8,10)$ F(A,B,C,D) = $\prod(1,3,5,7,13,15)$ F(x,y,z) = $\sum(2,3,6,7)$ F(A,B,C,D) = $\prod(0,1,2,3,4,10,11)$
ajaysoni1924
asked
in
Digital Logic
Apr 1, 2019
by
ajaysoni1924
502
views
digital-logic
morris-mano
boolean-algebra
simplification
k-map
0
votes
0
answers
159
Morris Mano Edition 3 Exercise 3 Question 8 (Page No. 111)
Simplify the following boolean function using five variable maps. F(A,B,C,D,E) = $\sum (0,1,4,5,16,17,25,21,29)$ F(A,B,C,D,E) = $\sum (0,2,3,4,5,6,7,11,15,16,18,19,23,27,31)$ F= A’B’CE’ + A’B’C’D + B’D’E’ + B’CD’ + CDE’ + BDE’
ajaysoni1924
asked
in
Digital Logic
Apr 1, 2019
by
ajaysoni1924
1.5k
views
digital-logic
morris-mano
boolean-algebra
k-map
simplification
1
vote
0
answers
160
Morris Mano Edition 3 Exercise 3 Question 7 (Page No. 111)
Simplify the following boolean functions by first finding the essential prime implicants. F(w,x,y,z) = $\sum (0,2,4,5,6,7,8,10.13,15)$ F(A,B,C,D) = $\sum (0,2,3,5,7,8,10,11,14,15)$ F(A,B,C,D) = $\sum (1,3,4,5,10,11,12,13,14,15)$
ajaysoni1924
asked
in
Digital Logic
Apr 1, 2019
by
ajaysoni1924
428
views
digital-logic
morris-mano
boolean-algebra
k-map
simplification
1
vote
0
answers
161
Morris Mano Edition 3 Exercise 3 Question 6 (Page No. 111)
Find the Minterms of the each of the following expression by first plotting each function in the map. xy + yz + xy’z C’D + ABC’ +ABD’ + A’B’D wxy + x’z’ + w’xz
ajaysoni1924
asked
in
Digital Logic
Apr 1, 2019
by
ajaysoni1924
660
views
digital-logic
morris-mano
boolean-algebra
simplification
k-map
4
votes
0
answers
162
Morris Mano Edition 3 Exercise 3 Question 5 (Page No. 111)
Simplify the following boolean expressions using Four variable K-maps. w’z + xz + x’y + wx’z B’D + A’BC’ + AB’C + ABC’ AB’C + B’C’D’ + BCD + ACD’ + A’B’C + A’BC’D wxy + yz + xy’z + x’y
ajaysoni1924
asked
in
Digital Logic
Apr 1, 2019
by
ajaysoni1924
1.0k
views
digital-logic
morris-mano
boolean-algebra
simplification
k-map
0
votes
0
answers
163
Morris Mano Edition 3 Exercise 3 Question 4 (Page No. 111)
Simplify the following boolean functions using four variable K- maps F(A,B,C,D) = $\sum (0,1,2,4,5,7,11,15)$ F(w,x,y,z) = $\sum (1,4,5,6,12,14,15)$ F(A,B,C,D) = $\sum (0,2,4,5,6,7,8,10,13,15)$ F(w,x,y,z) = $\sum (2,3,10,11,12,13,14,15)$
ajaysoni1924
asked
in
Digital Logic
Apr 1, 2019
by
ajaysoni1924
380
views
digital-logic
morris-mano
boolean-algebra
k-map
simplification
0
votes
0
answers
164
Morris Mano Edition 3 Exercise 3 Question 3 (Page No. 111)
Simplify the following boolean functions using four variable K- maps F(A,B,C,D) = $\sum (4,6,7,15)$ F(w,x,y,z) = $\sum (2,3,12,13,14,15)$ F(A,B,C,D) = $\sum (3,7,11,13,14,15)$
ajaysoni1924
asked
in
Digital Logic
Apr 1, 2019
by
ajaysoni1924
644
views
digital-logic
morris-mano
simplification
k-map
boolean-algebra
0
votes
0
answers
165
Morris Mano Edition 3 Exercise 3 Question 2 (Page No. 111)
Simplify the Following Boolean Expressions using three-variable k-map. xy + x’y’z’ + x’yz’ x’y’ + yz + x’yz ’ A’B + BC’ + B’C’
ajaysoni1924
asked
in
Digital Logic
Apr 1, 2019
by
ajaysoni1924
481
views
digital-logic
morris-mano
boolean-algebra
simplification
k-map
1
vote
0
answers
166
Morris Mano Edition 3 Exercise 3 Question 1 (Page No. 111)
Simplify the following Boolean functions using Three-Variable maps. F(x,y,z) = $\sum (0,1,5,7)$ F(x,y,z) = $\sum (1,2,3,6,7)$ F(x,y,z) = $\sum (3,5,6,7)$ F(A,B,C) = $\sum (0,2,3,4,6)$
ajaysoni1924
asked
in
Digital Logic
Apr 1, 2019
by
ajaysoni1924
1.1k
views
digital-logic
morris-mano
simplification
k-map
boolean-algebra
1
vote
1
answer
167
Morris Mano Edition 3 Exercise 2 Question 15 (Page No. 71)
Convert the following Expressions into the sum of Products and Product of sums. (AB + C)(B + C’D) X’ + X(X + Y’)(Y + Z’)
ajaysoni1924
asked
in
Digital Logic
Apr 1, 2019
by
ajaysoni1924
11.3k
views
digital-logic
morris-mano
boolean-algebra
1
vote
0
answers
168
Morris Mano Edition 3 Exercise 2 Question 17 (Page No. 71)
Draw the Logic Diagram corresponding to the following Operation without simplifying them. BC’ + AB + ACD (A + B)(C + D)(A’ + B + D) (AB + A’B’)(CD’ + C’D)
ajaysoni1924
asked
in
Digital Logic
Apr 1, 2019
by
ajaysoni1924
541
views
digital-logic
morris-mano
boolean-algebra
1
vote
2
answers
169
Morris Mano Edition 3 Exercise 2 Question 18 (Page No. 71)
Show that the Dual of the Exclusive OR is equal to its complement.
ajaysoni1924
asked
in
Digital Logic
Apr 1, 2019
by
ajaysoni1924
761
views
digital-logic
morris-mano
boolean-algebra
0
votes
0
answers
170
Morris Mano Edition 3 Exercise 2 Question 19 (Page No. 71)
by substituting the boolean expression equivalent of the binary operation defined in the below table, show the following. The inhibition operation is neither commutative nor associative. The Exclusive-OR operation is commutative and Associative.
ajaysoni1924
asked
in
Digital Logic
Apr 1, 2019
by
ajaysoni1924
1.2k
views
digital-logic
morris-mano
boolean-algebra
0
votes
0
answers
171
Morris Mano Edition 3 Exercise 2 Question 20 (Page No. 71)
Verify the truth table for three Variable Exclusive-OR function. Do that By listing all the eight combinations of X, Y and Z than Evaluate A = X $\bigoplus$ Y. also Evaluate F = A $\bigoplus Z = X \bigoplus Y\bigoplus Z$
ajaysoni1924
asked
in
Digital Logic
Apr 1, 2019
by
ajaysoni1924
493
views
digital-logic
morris-mano
boolean-algebra
0
votes
0
answers
172
Morris Mano Edition 3 Exercise 2 Question 21 (Page No. 71)
TTL SSI comes mostly in 14-pin packets. two pins are reserved for power and the other 12 pins are for input-output terminals. Determine the number of gates that can be enclosed in one package if it contains the following ... two input exclusive-OR gate three input AND gates Four input NAND Gates FIve-input NOR gates Eight input NAND gates
ajaysoni1924
asked
in
Digital Logic
Apr 1, 2019
by
ajaysoni1924
1.2k
views
digital-logic
morris-mano
boolean-algebra
digital-circuits
0
votes
0
answers
173
Morris Mano Edition 3 Exercise 2 Question 22 (Page No. 71)
Show that a positive logic NAND gate is a negative Logic Nor Gate and vice versa.
ajaysoni1924
asked
in
Digital Logic
Apr 1, 2019
by
ajaysoni1924
512
views
digital-logic
morris-mano
boolean-algebra
digital-circuits
0
votes
0
answers
174
Morris Mano Edition 3 Exercise 2 Question 23 (Page No. 71)
An integrated-circuit Logic Family has NAND Gates having Fan out 5 and Buffer gates with fan out 10. Show how the output signal of a Single NAND gate can be applied to 50 other NAND gate without overloading the output gate.use the buffer to satisfy the fan-out requirement
ajaysoni1924
asked
in
Digital Logic
Apr 1, 2019
by
ajaysoni1924
742
views
digital-logic
morris-mano
boolean-algebra
0
votes
1
answer
175
Morris Mano Edition 3 Exercise 2 Question 15 (Page No. 71)
The sum of all the minterms of the boolean function of the n variable is 1. Prove the above statement with n = 3. give a Procedure for a general proof
ajaysoni1924
asked
in
Digital Logic
Mar 31, 2019
by
ajaysoni1924
3.7k
views
digital-logic
morris-mano
boolean-algebra
min-sum-of-products-form
2
votes
2
answers
176
Morris Mano Edition 3 Exercise 2 Question 14 (Page No. 71)
Convert the following to the other canonical Form $(a) F(A,B,C,D) = \prod(0,1,2,3,4,6,12)$ $(b) F(x,y,z) = \sum(1,3,7)$
ajaysoni1924
asked
in
Digital Logic
Mar 31, 2019
by
ajaysoni1924
11.0k
views
digital-logic
morris-mano
boolean-algebra
1
vote
2
answers
177
Morris Mano Edition 3 Exercise 2 Question 13 (Page No. 71)
Express the complement of the following function in the sum of minterms. $(a) F(A,B,C,D) = \sum(0,2,6,11,13,14)$ $(b) F(x,y,z) = \prod(0,3,6,7)$
ajaysoni1924
asked
in
Digital Logic
Mar 31, 2019
by
ajaysoni1924
3.1k
views
digital-logic
morris-mano
boolean-algebra
min-sum-of-products-form
5
votes
2
answers
178
Morris Mano Edition 3 Exercise 2 Question 12 (Page No. 70)
Express the following function in the sum of minterms and The product of the maxterms. (a) F(A,B,C,D) = B’D + A’D + BD (b)F(x,y,z)=(xy + z)(xz + y)
ajaysoni1924
asked
in
Digital Logic
Mar 31, 2019
by
ajaysoni1924
34.8k
views
digital-logic
morris-mano
boolean-algebra
simplification
3
votes
1
answer
179
Morris Mano Edition 3 Exercise 2 Question 11 (Page No. 70)
Given the Following Boolean Function: F = xy'z + x'y'z + w'xy + wx'y + wxy Obtain the truth table of the function. Draw the logic diagram using the original Boolean Expression. Simplify the function to the minimum ... Draw the logic diagram of the simplified function and Compare the total number of gates with the logic diagram in part 2.
ajaysoni1924
asked
in
Digital Logic
Mar 31, 2019
by
ajaysoni1924
10.3k
views
digital-logic
morris-mano
boolean-algebra
1
vote
1
answer
180
Morris Mano Edition 3 Exercise 2 Question 10 (Page No. 70)
For the Boolean Function F Given in the Truth Table, Find the following. x y z F 0 0 0 0 0 0 1 0 0 1 0 1 0 1 1 1 1 0 0 0 1 0 1 0 1 1 0 1 1 1 1 1 List the Minterm of F’.and F Express F in the sum of Minterm in algebraic form. simplify the function to an Expression with the minimum number of the literals.
ajaysoni1924
asked
in
Digital Logic
Mar 31, 2019
by
ajaysoni1924
2.9k
views
digital-logic
morris-mano
boolean-algebra
Page:
« prev
1
2
3
4
5
6
7
8
9
10
11
12
next »
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent questions tagged boolean-algebra
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...