The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Recent questions tagged booleanalgebra
+1
vote
2
answers
1
ISI2017DCG10
The value of the Boolean expression (with usual definitions) $(A’BC’)’ +(AB’C)’$ is $0$ $1$ $A$ $BC$
asked
Sep 18
in
Digital Logic
by
gatecse
Boss
(
16.8k
points)

50
views
isi2017dcg
digitallogic
booleanalgebra
booleanexpression
+2
votes
2
answers
2
GateBook Test Series: Digital Logic  Boolean Algebra
What is the time complexity for checking whether an assignment of truth values to variables $x_1,\dots ,x_n$ satisfies a given formula $f(x_1\dots,x_n)$? $O(2^n)$ $O(g(n))$ where $g$ is a polynomial $O(log(n))$ None of the above
asked
May 15
in
Digital Logic
by
val_pro20
Active
(
1.2k
points)

210
views
gatebook
digitallogic
booleanalgebra
0
votes
1
answer
3
Boolean algebradigital logic
$(a) A = 101010$ and $B = 011101$ are $1’s$ complement numbers. Perform the following operations and indicate whether overflow occurs. $(i) A + B$ $(ii) A − B$ $(b)$ Repeat part $(a)$ assuming the numbers are $2’s$ complement numbers.
asked
May 11
in
Digital Logic
by
val_pro20
Active
(
1.2k
points)

103
views
digitallogic
booleanalgebra
+1
vote
3
answers
4
Boolean algebra expression Floyd Digital Logic
Simplify the following expression AB’C + A’BC + A’B’C Solution given is A’C + B’C can someone show me how?
asked
May 2
in
Digital Logic
by
vupadhayayx86
Active
(
1.6k
points)

172
views
digitallogic
booleanalgebra
+1
vote
3
answers
5
Testbook Test Series Question
f(A,B,C,D)=∏M(0,1,3,4,5,7,9,11,12,13,14,15) is a maxterm representation of a Boolean function f(A,B,C,D) where A is the MSB and D is the LSB. The equivalent minimized representation of this function is (A+C¯+D)(A¯+B+D)(A+C¯+D)(A¯+B+D) AC¯D+A¯BD+A¯BC A¯CD¯+AB¯CD¯+AB¯C¯D¯ (B+C¯+D)(A+B¯+C¯+D)(A¯+B+C+D)
asked
Apr 18
in
Digital Logic
by
KULDEEP SINGH 2
Junior
(
895
points)

164
views
minimization
booleanalgebra
+1
vote
2
answers
6
Morris Mano Edition 3 Exercise 4 Question 25 (Page No. 151)
prove that $ x’ \oplus y = x \oplus y’ = (x \oplus y)’ = xy+x’y’$
asked
Apr 2
in
Digital Logic
by
ajaysoni1924
Boss
(
10.5k
points)

76
views
digitallogic
booleanalgebra
combinationalcircuits
+1
vote
2
answers
7
Morris Mano Edition 3 Exercise 4 Question 26 (Page No. 151)
Prove that $x \oplus 1$ = x’ and $x \oplus 0$ = x.
asked
Apr 2
in
Digital Logic
by
ajaysoni1924
Boss
(
10.5k
points)

47
views
digitallogic
combinationalcircuits
booleanalgebra
+2
votes
2
answers
8
Morris Mano Edition 3 Exercise 4 Question 27 (Page No. 151)
Show that if xy = 0, then $x\oplus y$ = x + y.
asked
Apr 2
in
Digital Logic
by
ajaysoni1924
Boss
(
10.5k
points)

53
views
digitallogic
combinationalcircuits
booleanalgebra
0
votes
0
answers
9
Morris Mano Edition 3 Exercise 3 Question 27 (Page No. 113)
Simplify the Following boolean function by means of the tabulation method. (a) P(A,B,C,D,E,F,G)=$\sum(20,28,52,60)$ (b) P(A,B,C,D,E,F,G)= $\sum(20,28,38,39,52,60,102,103,127)$ (C) P(A,B,C,D,E,F) = $\sum(6,9,13,18,19,25,27,29,41,45,57,61)$
asked
Apr 2
in
Digital Logic
by
ajaysoni1924
Boss
(
10.5k
points)

56
views
digitallogic
booleanalgebra
simplification
kmap
+1
vote
1
answer
10
Morris Mano Edition 3 Exercise 3 Question 25 (Page No. 112)
Implement the following boolean function F together with the don’tcare conditions d using no more than two NOR gates. Assume both normal and the compliment inputs are available. F(A,B,C,D) = $\sum(0,1,2,9,11) $ $d(A,B,C,D) = \sum(8,10,14,15)$
asked
Apr 2
in
Digital Logic
by
ajaysoni1924
Boss
(
10.5k
points)

66
views
digitallogic
booleanalgebra
simplification
kmap
0
votes
1
answer
11
Morris Mano Edition 3 Exercise 3 Question 24 (Page No. 112)
A logic circuit implements the following Boolean function: F = A’C + AC’D’ it is found that the circuit input combination A=C=1 can never occur. Find a simpler expression for F using the proper don'tcare conditions.
asked
Apr 2
in
Digital Logic
by
ajaysoni1924
Boss
(
10.5k
points)

95
views
digitallogic
booleanalgebra
simplification
kmap
0
votes
0
answers
12
Morris Mano Edition 3 Exercise 3 Question 23 (Page No. 113)
Simplify the boolean function F together with the don’t care conditions d in (1) sum of products and (2)product of sums. (A) $F(w,x,y,z) = \sum(0,1,2,3,7,8,10)$ $d(w,x,y,z) = \sum(5,6,11,15)$ (b) $F(A,B,C,D) = \sum (3,4,13,15)$ $d(A,B,C,D) =\sum(1,2,5,6,8,10,12,14)$
asked
Apr 2
in
Digital Logic
by
ajaysoni1924
Boss
(
10.5k
points)

28
views
digitallogic
booleanalgebra
simplification
kmap
0
votes
0
answers
13
Morris Mano Edition 3 Exercise 3 Question 22 (Page No. 112113)
Simplify the following boolean function F together with the don’t care condition d; then express the simplified function in the sum of minterms. (a)$F(x,y,z)=\sum(0,1,2,4,5) $ $d(x,y,z)= \sum(3,6,7)$ (b) $F(A,B,C,D) = \sum(0,6,8,13,14)$ $d(A,B,C,D) = \sum(2,4,10)$ (C) $F(A,B,C,D) = \sum(1,3,5,7,9,15)$ $d(A,B,C,D)= \sum(4,6,12,13)$
asked
Apr 2
in
Digital Logic
by
ajaysoni1924
Boss
(
10.5k
points)

35
views
digitallogic
booleanalgebra
simplification
kmap
0
votes
0
answers
14
Morris Mano Edition 3 Exercise 3 Question 21 (Page No. 112)
List the Eight degenerate 2 level forms and show that they reduce to the single operation. Explain how the degenerate twolevel forms can be used to extend the number of inputs to a gate.
asked
Apr 2
in
Digital Logic
by
ajaysoni1924
Boss
(
10.5k
points)

26
views
digitallogic
simplification
descriptive
booleanalgebra
0
votes
0
answers
15
Morris Mano Edition 3 Exercise 3 Question 20 (Page No. 112)
Implement the function F with the Following two level Forms: NANDAND, ANDNOR, ORNAND, AND NOROR. F(A,B,C,D) = $\sum(0,1,2,3,4,8,9,12)$
asked
Apr 2
in
Digital Logic
by
ajaysoni1924
Boss
(
10.5k
points)

35
views
digitallogic
booleanalgebra
simplification
digitalcircuits
0
votes
0
answers
16
Morris Mano Edition 3 Exercise 3 Question 19 (Page No. 112)
Find the eight different twolevel gate circuit to implement F = xy’z + x’yz + w.
asked
Apr 2
in
Digital Logic
by
ajaysoni1924
Boss
(
10.5k
points)

24
views
digitallogic
booleanalgebra
simplification
digitalcircuits
0
votes
0
answers
17
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)$
asked
Apr 2
in
Digital Logic
by
ajaysoni1924
Boss
(
10.5k
points)

29
views
digitallogic
booleanalgebra
digitalcircuits
0
votes
0
answers
18
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) threelevel NOR gate circuits. F = wx’ + y’z’ + w’yz’ F(w,x,y,z) = $\sum(5,6,9,10)$
asked
Apr 1
in
Digital Logic
by
ajaysoni1924
Boss
(
10.5k
points)

53
views
digitallogic
booleanalgebra
simplification
digitalcircuits
0
votes
1
answer
19
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)
asked
Apr 1
in
Digital Logic
by
ajaysoni1924
Boss
(
10.5k
points)

32
views
digitallogic
booleanalgebra
digitalcircuits
logicdiagram
0
votes
0
answers
20
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)$
asked
Apr 1
in
Digital Logic
by
ajaysoni1924
Boss
(
10.5k
points)

24
views
digitallogic
booleanalgebra
simplification
digitalcircuits
0
votes
0
answers
21
Morris Mano Edition 3 Exercise 3 Question 12,17 (Page No. 112)
Simplify the following expressions and implement them with (12)twolevel NAND gate circuits (17) threelevel NAND gate circuits (a) AB’ + ABD + ABD’ + A’C’D + A’BC’ (b) BD + BCD’ + AB’C’D’
asked
Apr 1
in
Digital Logic
by
ajaysoni1924
Boss
(
10.5k
points)

20
views
digitallogic
booleanalgebra
simplification
digitalcircuits
+1
vote
1
answer
22
Morris Mano Edition 3 Exercise 3 Question 11 (Page No. 112)
Draw the ANDOR 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)$
asked
Apr 1
in
Digital Logic
by
ajaysoni1924
Boss
(
10.5k
points)

31
views
digitallogic
booleanalgebra
simplification
kmap
digitalcircuits
0
votes
0
answers
23
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’)
asked
Apr 1
in
Digital Logic
by
ajaysoni1924
Boss
(
10.5k
points)

22
views
digitallogic
booleanalgebra
simplification
kmap
0
votes
0
answers
24
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)$
asked
Apr 1
in
Digital Logic
by
ajaysoni1924
Boss
(
10.5k
points)

25
views
digitallogic
booleanalgebra
simplification
kmap
0
votes
0
answers
25
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’
asked
Apr 1
in
Digital Logic
by
ajaysoni1924
Boss
(
10.5k
points)

19
views
digitallogic
booleanalgebra
kmap
simplification
0
votes
0
answers
26
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)$
asked
Apr 1
in
Digital Logic
by
ajaysoni1924
Boss
(
10.5k
points)

17
views
digitallogic
booleanalgebra
kmap
simplification
0
votes
0
answers
27
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
asked
Apr 1
in
Digital Logic
by
ajaysoni1924
Boss
(
10.5k
points)

18
views
digitallogic
booleanalgebra
simplification
kmap
0
votes
0
answers
28
Morris Mano Edition 3 Exercise 3 Question 5 (Page No. 111)
Simplify the following boolean expressions using Four variable Kmaps. 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
asked
Apr 1
in
Digital Logic
by
ajaysoni1924
Boss
(
10.5k
points)

13
views
digitallogic
booleanalgebra
simplification
kmap
0
votes
0
answers
29
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)$
asked
Apr 1
in
Digital Logic
by
ajaysoni1924
Boss
(
10.5k
points)

16
views
digitallogic
booleanalgebra
kmap
simplification
0
votes
0
answers
30
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)$
asked
Apr 1
in
Digital Logic
by
ajaysoni1924
Boss
(
10.5k
points)

26
views
digitallogic
simplification
kmap
booleanalgebra
Page:
1
2
3
4
5
6
7
next »
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
Linear Algebra Important Points
GATE 2020
OFFICIAL GATE MOCK TEST RELEASED
IIITH: Winter Research Admissions 2019 (For Spring 2020)
TIFR and JEST exam
Follow @csegate
Recent questions tagged booleanalgebra
Recent Blog Comments
i also don't have any pdf, actually, I added the...
i don't have , if you have upload it
@mohan123 Do you have all standard book...
bro can be upload all standard book questions in...
it'll take 34 days but for most purpose you can...
50,648
questions
56,429
answers
195,217
comments
99,948
users