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 k-map
0
votes
3
answers
1
Minimization doubt in DIGITAL LOGIC
asked
Jun 14
in
Digital Logic
by
Gitika Babbar
(
157
points)
|
97
views
digital-logic
k-map
digital-circuits
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
Boss
(
10.5k
points)
|
56
views
digital-logic
boolean-algebra
simplification
k-map
+1
vote
1
answer
3
Morris Mano Edition 3 Exercise 3 Question 25 (Page No. 112)
Implement the following boolean function F together with the don’t-care 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
digital-logic
boolean-algebra
simplification
k-map
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't-care conditions.
asked
Apr 2
in
Digital Logic
by
ajaysoni1924
Boss
(
10.5k
points)
|
95
views
digital-logic
boolean-algebra
simplification
k-map
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
Boss
(
10.5k
points)
|
28
views
digital-logic
boolean-algebra
simplification
k-map
0
votes
0
answers
6
Morris Mano Edition 3 Exercise 3 Question 22 (Page No. 112-113)
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
digital-logic
boolean-algebra
simplification
k-map
+1
vote
1
answer
7
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)$
asked
Apr 1
in
Digital Logic
by
ajaysoni1924
Boss
(
10.5k
points)
|
31
views
digital-logic
boolean-algebra
simplification
k-map
digital-circuits
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
Boss
(
10.5k
points)
|
22
views
digital-logic
boolean-algebra
simplification
k-map
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
Boss
(
10.5k
points)
|
25
views
digital-logic
boolean-algebra
simplification
k-map
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
Boss
(
10.5k
points)
|
19
views
digital-logic
boolean-algebra
k-map
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
Boss
(
10.5k
points)
|
17
views
digital-logic
boolean-algebra
k-map
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
Boss
(
10.5k
points)
|
18
views
digital-logic
boolean-algebra
simplification
k-map
0
votes
0
answers
13
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
asked
Apr 1
in
Digital Logic
by
ajaysoni1924
Boss
(
10.5k
points)
|
13
views
digital-logic
boolean-algebra
simplification
k-map
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
Boss
(
10.5k
points)
|
16
views
digital-logic
boolean-algebra
k-map
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
Boss
(
10.5k
points)
|
26
views
digital-logic
simplification
k-map
boolean-algebra
0
votes
0
answers
16
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’
asked
Apr 1
in
Digital Logic
by
ajaysoni1924
Boss
(
10.5k
points)
|
23
views
digital-logic
boolean-algebra
simplification
k-map
0
votes
0
answers
17
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)$
asked
Apr 1
in
Digital Logic
by
ajaysoni1924
Boss
(
10.5k
points)
|
18
views
digital-logic
simplification
k-map
boolean-algebra
+8
votes
3
answers
18
GATE2019-30
Consider three $4$-variable functions $f_1, f_2$, and $f_3$, which are expressed in sum-of-minterms 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
(
424k
points)
|
2.5k
views
gate2019
digital-logic
k-map
digital-circuits
+1
vote
1
answer
19
MadeEasy CBT 2019: Diigtal Logic - K-map
asked
Jan 23
in
Digital Logic
by
pream sagar
Active
(
2.3k
points)
|
180
views
made-easy-test-series
digital-logic
k-map
0
votes
0
answers
20
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)
|
52
views
made-easy-test-series
k-map
0
votes
0
answers
21
MadeEasy Test Series: Digital Logic - Prime Implicants
asked
Jan 8
in
Digital Logic
by
smsubham
Loyal
(
9.6k
points)
|
107
views
made-easy-test-series
digital-logic
prime-implicants
k-map
–1
vote
1
answer
22
Digital Karnaugh Map
asked
Jan 4
in
Digital Logic
by
Rackson
Active
(
1.8k
points)
|
55
views
digital-logic
k-map
digital-circuits
0
votes
1
answer
23
K-map
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
(
1.3k
points)
|
68
views
digital-logic
k-map
+2
votes
1
answer
24
MadeEasy Test Series: Digital Logic - Prime Implicants
Total number of essential prime implicants in the given K-map (x represents don't care) are ___ ?
asked
Oct 31, 2018
in
Digital Logic
by
kapilbk1996
(
403
points)
|
315
views
digital-logic
prime-implicants
k-map
made-easy-test-series
0
votes
1
answer
25
Prime implicants and essential implicants
asked
Oct 1, 2018
in
Digital Logic
by
Na462
Loyal
(
6.9k
points)
|
238
views
digital-logic
k-map
prime-implicants
minimization
0
votes
0
answers
26
Self Doubt
"Every cyclic K-map given cyclic function and every cyclic function can be the self-dual function." What is the meaning of cyclic K-map?
asked
Sep 23, 2018
in
Digital Logic
by
Shaik Masthan
Veteran
(
64.6k
points)
|
44
views
k-map
0
votes
0
answers
27
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.3k
points)
|
42
views
digital-logic
k-map
min-sum-of-products-form
0
votes
1
answer
28
UGCNET-July-2018-II-99
Simplify the following using K-map: $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.8k
points)
|
836
views
ugcnetjuly2018ii
digital-logic
k-map
0
votes
2
answers
29
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
(
8.3k
points)
|
121
views
digital-logic
k-map
digital-circuits
0
votes
3
answers
30
k map
Consider the Karnaugh map given below, where X represents "don't care" and blank represents 0. what will be the SOP?
asked
May 25, 2018
in
Digital Logic
by
iarnav
Loyal
(
8.3k
points)
|
125
views
digital-logic
k-map
digital-circuits
Page:
1
2
3
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 k-map
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 3-4 days but for most purpose you can...
50,648
questions
56,429
answers
195,216
comments
99,945
users