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
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions. For hardcopy of previous year questions please see
here
Recent questions tagged kmap
0
votes
2
answers
1
Minimization doubt in DIGITAL LOGIC
asked
3 days
ago
in
Digital Logic
by
Gitika Babbar
(
111
points)

19
views
digitallogic
kmap
digitalcircuits
0
votes
0
answers
2
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
Loyal
(
9.4k
points)

31
views
digitallogic
booleanexpressions
simplification
kmap
0
votes
1
answer
3
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
Loyal
(
9.4k
points)

36
views
digitallogic
booleanexpressions
simplification
kmap
0
votes
1
answer
4
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
Loyal
(
9.4k
points)

48
views
digitallogic
booleanexpressions
simplification
kmap
0
votes
0
answers
5
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
Loyal
(
9.4k
points)

18
views
digitallogic
booleanexpressions
simplification
kmap
0
votes
0
answers
6
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
Loyal
(
9.4k
points)

20
views
digitallogic
booleanexpressions
simplification
kmap
+1
vote
1
answer
7
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
Loyal
(
9.4k
points)

19
views
digitallogic
booleanexpressions
simplification
kmap
logicgates
0
votes
0
answers
8
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
Loyal
(
9.4k
points)

15
views
digitallogic
booleanexpressions
simplification
kmap
0
votes
0
answers
9
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
Loyal
(
9.4k
points)

22
views
digitallogic
booleanexpressions
simplification
kmap
0
votes
0
answers
10
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
Loyal
(
9.4k
points)

13
views
digitallogic
booleanexpressions
kmap
simplification
0
votes
0
answers
11
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
Loyal
(
9.4k
points)

11
views
digitallogic
booleanexpressions
kmap
simplification
0
votes
0
answers
12
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
Loyal
(
9.4k
points)

11
views
digitallogic
booleanexpressions
simplification
kmap
0
votes
0
answers
13
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
Loyal
(
9.4k
points)

12
views
digitallogic
booleanexpressions
simplification
kmap
0
votes
0
answers
14
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
Loyal
(
9.4k
points)

12
views
digitallogic
booleanexpressions
kmap
simplification
0
votes
0
answers
15
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
Loyal
(
9.4k
points)

19
views
digitallogic
simplification
kmap
booleanexpressions
0
votes
0
answers
16
Morris Mano Edition 3 Exercise 3 Question 2 (Page No. 111)
Simplify the Following Boolean Expressions using threevariable kmap. xy + x’y’z’ + x’yz’ x’y’ + yz + x’yz ’ A’B + BC’ + B’C’
asked
Apr 1
in
Digital Logic
by
ajaysoni1924
Loyal
(
9.4k
points)

16
views
digitallogic
booleanexpressions
simplification
kmap
0
votes
0
answers
17
Morris Mano Edition 3 Exercise 3 Question 1 (Page No. 111)
Simplify the following Boolean functions using ThreeVariable 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)$
asked
Apr 1
in
Digital Logic
by
ajaysoni1924
Loyal
(
9.4k
points)

14
views
digitallogic
simplification
kmap
booleanexpressions
+4
votes
3
answers
18
GATE201930
Consider three $4$variable functions $f_1, f_2$, and $f_3$, which are expressed in sumofminterms as $f_1=\Sigma(0,2,5,8,14),$ $f_2=\Sigma(2,3,6,8,14,15),$ $f_3=\Sigma (2,7,11,14)$ For the following circuit with one AND gate and one XOR gate the output function $f$ can be expressed as: $\Sigma(7,8,11)$ $\Sigma (2,7,8,11,14)$ $\Sigma (2,14)$ $\Sigma (0,2,3,5,6,7,8,11,14,15)$
asked
Feb 7
in
Digital Logic
by
Arjun
Veteran
(
406k
points)

2.1k
views
gate2019
digitallogic
kmap
logicgates
0
votes
1
answer
19
MadeEasy CBT 2019: Diigtal Logic  Kmap
asked
Jan 23
in
Digital Logic
by
pream sagar
Active
(
2.3k
points)

157
views
madeeasytestseries
digitallogic
kmap
+4
votes
0
answers
20
GATEBOOK2019 Mock Test122
Which of the following conditions can be expressed by a Boolean formula in the Boolean variables $p1,p2,p3,p4$ and the connectives ∧ ∨, (without ¬ )? At least three of $p1,p2,p3,p4$ are true. Exactly three of $p1,p2,p3,p4$ are true. An even number of $p1,p2,p3,p4$ are true. I only II only III only I and III
asked
Jan 19
in
Digital Logic
by
GATEBOOK
Boss
(
11.4k
points)

192
views
gb2019mock1
booleanalgebra
kmap
0
votes
0
answers
21
MadeEasy Test
Consider the boolean expression F(A, B, C, D) = Σm = (0, 1, 2, 5, 6, 7, 8, 10, 14, 15). Find the number of essential prime implicates
asked
Jan 11
in
Digital Logic
by
VikramRB
(
239
points)

50
views
madeeasytestseries
kmap
0
votes
0
answers
22
MadeEasy Test Series: Digital Logic  Prime Implicants
asked
Jan 8
in
Digital Logic
by
smsubham
Loyal
(
9.1k
points)

83
views
madeeasytestseries
digitallogic
primeimplicants
kmap
–1
vote
1
answer
23
Digital Karnaugh Map
asked
Jan 4
in
Digital Logic
by
Rackson
Active
(
1.8k
points)

51
views
digitallogic
kmap
digitalcircuits
0
votes
1
answer
24
Kmap
Consider the boolean expression F(A,B,C,D)=Σm=(0,1,2,5,6,7,8,10,14,15).Find the number of essential prime implicants. a)1 b)2 c)3 d)4
asked
Jan 2
in
Digital Logic
by
Nandkishor3939
Active
(
1k
points)

54
views
digitallogic
kmap
+2
votes
1
answer
25
MadeEasy Test Series: Digital Logic  Prime Implicants
Total number of essential prime implicants in the given Kmap (x represents don't care) are ___ ?
asked
Oct 31, 2018
in
Digital Logic
by
kapilbk1996
(
385
points)

253
views
digitallogic
primeimplicants
kmap
madeeasytestseries
0
votes
1
answer
26
Prime implicants and essential implicants
asked
Oct 1, 2018
in
Digital Logic
by
Na462
Loyal
(
6.6k
points)

193
views
digitallogic
kmap
primeimplicants
minimization
0
votes
0
answers
27
Self Doubt
"Every cyclic Kmap given cyclic function and every cyclic function can be the selfdual function." What is the meaning of cyclic Kmap?
asked
Sep 23, 2018
in
Digital Logic
by
Shaik Masthan
Veteran
(
60.9k
points)

38
views
kmap
0
votes
0
answers
28
Minimization of POS
Please verify my approach for calculation the minimal POS form for a function f. STEPS: Find out the f' in sum of minterms. Minimize f' and find out minimal SOP form. Using DeMorgan's law, find out f. The calcuated f will be minimal and in ... approach. However, I need a confirmation whether this method is actually correct and is bound to give me correct results all the time..!
asked
Jul 26, 2018
in
Digital Logic
by
Harsh Kumar
Active
(
1.2k
points)

32
views
digitallogic
kmap
minsumofproductsform
0
votes
1
answer
29
UGCNETJuly2018II99
Simplify the following using Kmap: $F(A, B, C, D) = \Sigma (0, 1, 2, 8, 9, 12, 13)$ $d(A, B, C, D) = \Sigma (10, 11, 14, 15)$ d stands for don't care condition $A+\bar{B} \bar{D} +BC$ $A+\bar{B} \bar{D} + \bar{B} \bar{C}$ $\bar{A} + \bar{B} \bar{C}$ $\bar{A} + \bar{B} \bar{C} + \bar{B} \bar{D}$
asked
Jul 13, 2018
in
Others
by
Pooja Khatri
Boss
(
10.7k
points)

623
views
ugcnetjuly2018ii
digitallogic
kmap
0
votes
2
answers
30
K MAP
what will be the k Map for $(P+Q'+R').(P+Q'+R).(P+Q+R')$ and the simplified SOP (Sum of Product) for the above the Boolean expression? Please try to make a k map in this format
asked
May 25, 2018
in
Digital Logic
by
iarnav
Loyal
(
7.9k
points)

111
views
digitallogic
kmap
digitalcircuits
Page:
1
2
3
4
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
The day that made me an IIScian :)
Unanswered Previous year GATE/TIFR questions
From being a Failure to getting into IISc  (Rank 888, Score 692)
My interview experience at IITs/IISc
IIT Delhi CSE Mtech interview 14 may
Follow @csegate
Recent questions tagged kmap
Recent Blog Comments
@Debargh, Yes. 👍
Thanks. Regarding the probability question, was...
Thanks
What were the Eigen values of A apart from 0? I...
49,540
questions
54,099
answers
187,267
comments
71,006
users