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 minimization
+1
vote
2
answers
1
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
(
795
points)

92
views
minimization
booleanexpressions
0
votes
0
answers
2
self doubt
Is there any relationship between Irredundant or Irreducable expression with minimal expression??? I mean can we say like “every irredundant is minimal” or “every minimal is irredundant” or “some expressions which are both minimal & Irredundant”
asked
Jan 11
in
Digital Logic
by
MRINMOY_HALDER
Active
(
1.2k
points)

22
views
digitallogic
minimization
0
votes
1
answer
3
selfdoubt
Give an example of DFA minimization where the initial state is final state and there are one or more final states
asked
Dec 22, 2018
in
Theory of Computation
by
ck
(
355
points)

55
views
finiteautomata
minimization
0
votes
0
answers
4
Kohavi
A certain 4 input gate called LEMON gate realizes the switching function LEMON(A,B,C,D) = BC(A+D) Assuming that the input variables are available in both primed and unprimed form: i. show a realization of the function f(w,x,y,z)= P(0,1,6,9,10,11,14,15) with only three LEMON gates and one OR gate.
asked
Dec 8, 2018
in
Digital Logic
by
RahulRoy31
(
179
points)

54
views
digitallogic
minimization
+1
vote
1
answer
5
MadeEasy Test Series: Digital Logic  K Map
asked
Nov 15, 2018
in
Digital Logic
by
Shamim Ahmed
Active
(
2.3k
points)

119
views
madeeasytestseries
digitallogic
minimization
0
votes
0
answers
6
Self doubt
No of PRIME IMPLICANTS ??
asked
Nov 5, 2018
in
Digital Logic
by
jatin khachane 1
Loyal
(
6.7k
points)

63
views
digitallogic
minimization
0
votes
1
answer
7
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
1
answer
8
Toc NFa to DFA
asked
Jun 6, 2018
in
Theory of Computation
by
Shivani gaikawad
Junior
(
603
points)

80
views
minimization
finiteautomata
+2
votes
1
answer
9
False Essential Prime Implicant
How many number of false essential prime implicants for the given Boolean functions f(A,B,C) = $\sum{m(0,3,7)}.$
asked
Jan 17, 2018
in
Digital Logic
by
Shubhanshu
Boss
(
17.9k
points)

525
views
kmap
digitallogic
primeimplicants
minimization
+2
votes
3
answers
10
Essential prime implicants
asked
Nov 29, 2017
in
Digital Logic
by
Parshu gate
Active
(
3.1k
points)

319
views
primeimplicants
digitallogic
minimization
kmap
+1
vote
0
answers
11
Essential Prime Implicants Related Question
Let there are 12 minterms in a function in which 8 minterms are covered by 2 Essential Prime Implicants. Each of the remaining 4 minterms have 2 Non Essential Prime Implicants. Then the total number of minimal expressions is Answer is 16. Can anyone provide the solution to this problem.
asked
Nov 11, 2017
in
Digital Logic
by
Sourajit25
Junior
(
953
points)

287
views
digitallogic
primeimplicants
kmap
minimization
+1
vote
1
answer
12
Number of Essential prime implicants
Find the number of Essential prime implicants present in the K Map of the function f=Σ(2,3,5,7,8,12,13).Here the answer is 2,can anybody explain why it is 2?
asked
Oct 15, 2017
in
Digital Logic
by
Sourajit25
Junior
(
953
points)

392
views
digitallogic
primeimplicants
kmap
minimization
+2
votes
1
answer
13
Finding Essential Prime Implicants
Consider the Boolean function, F(w, x, y, z) = wy + xy + w̅xyz + w̅ x̅ y + xz + x̅y̅z̅. Which one of the following is the complete set of essential prime implicants? (A) w,y,xz,x̅z̅ (B) w,y,xz (C) y,x̅y̅z̅ (D) ... the KMAP by finding out minterms, the circled terms contribute to Essential prime implicants, but i dont' see any such options, the Answer is given D
asked
Oct 13, 2017
in
Digital Logic
by
Salazar
Active
(
1k
points)

381
views
primeimplicants
digitallogic
kmap
minimization
+3
votes
1
answer
14
The max no. of prime implicants in the minimized expression
The max no. of prime implicants in the minimized expression with nvariable is 2^n1 . Can someone please explain how ?
asked
Nov 14, 2016
in
Digital Logic
by
Aakash Das
Junior
(
525
points)

1.1k
views
digitallogic
primeimplicants
minimization
kmap
To see more, click for the
full list of questions
or
popular tags
.
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
IIITH Interview Experience
Thanks GO!!
IIIT Hyerabad Interview Expeience  MS by Research in CSE
The day that made me an IIScian :)
Unanswered Previous year GATE/TIFR questions
Follow @csegate
Recent questions tagged minimization
Recent Blog Comments
Congratulations :)
Congratulations 😊 👍
Thank you bro @Shaik
Thank you Sir.
congratulations :)
49,532
questions
54,123
answers
187,320
comments
71,044
users