Login
Register
Dark Mode
Brightness
Ambient Glow – Questions list
Register
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged min-sum-of-products-form
10
10 votes
3
3 answers
1.8k
1.8k views
GATE CSE 2026 | Set 2 | Question: 30
Consider the following $4$-variable Boolean function\[F(A, B, C, D)=\Sigma m(0,1,2,3,8,9,10,11)\]Consider $A$ as MSB, $D$ as LSB. Which one of the following options repre...
gatecse
1.8k
views
asked
Feb 23
Digital Logic
gatecse-2026-set2
digital-logic
min-sum-of-products-form
k-map
two-marks
+
–
15
15 votes
3
3 answers
1.6k
1.6k views
GATE CSE 2026 | Set 1 | Question: 38
Consider a Boolean function $F$ with the following minterm expression:\[F(P, Q, R, S)=\sum m(1,2,3,4,5,7,10,12,13,14)\]Which of the following options is/are the minimal s...
gatecse
1.6k
views
asked
Feb 23
Digital Logic
gatecse-2026-set1
two-marks
digital-logic
min-sum-of-products-form
k-map
multiple-selects
+
–
4
4 votes
4
4 answers
922
922 views
GO Classes DPP | Digital Logic | Implicants | Morris Mano
Simplify the boolean function $F(A, B, C, D)=\Sigma(0,2,3,5,7,8,10,11,13,15)$$F=A D+B^{\prime} C+A B^{\prime} D$ $F=A C+B^{\prime} D+A B^{\prime} C$ $F=B D+B^{\prime}D^{\...
GO Classes
922
views
asked
Jun 12, 2025
Digital Logic
goclasses
digital-logic
k-map
min-sum-of-products-form
boolean-algebra
goclasses-cs-dpp
goclasses-cs-dpp-day-14
goclasses-digital-logic-practice-questions
+
–
8
8 votes
8
8 answers
932
932 views
GO Classes DPP | Digital Logic | Boolean Algebra | Philadelphia University
The simplification of the Boolean expression $(\overline{\bar{A} B \bar{C}})+(\overline{A \bar{B} C})$ is01ABC
GO Classes
932
views
asked
Jun 6, 2025
Digital Logic
goclasses
digital-logic
boolean-algebra
min-sum-of-products-form
goclasses-cs-dpp
goclasses-cs-dpp-day-8
goclasses-digital-logic-practice-questions
+
–
7
7 votes
3
3 answers
617
617 views
GO Classes DPP | Digital Logic | K Map | Philadelphia University
The K-map for a Boolean function is shown in the figure. The number of essential prime implicants for this function is 4 5 6 8
GO Classes
617
views
asked
Jun 6, 2025
Digital Logic
goclasses
digital-logic
k-map
prime-implicants
min-sum-of-products-form
boolean-algebra
goclasses-cs-dpp
goclasses-cs-dpp-day-8
goclasses-digital-logic-practice-questions
+
–
4
4 votes
6
6 answers
809
809 views
GO Classes DPP | Digital Logic |boolean-algebra| Philadelphia University
The function $\mathbf{F}(\mathbf{A}, \mathbf{B}, \mathbf{C})=\sum(\mathbf{1}, \mathbf{2}, \mathbf{3}, \mathbf{5}, \mathbf{7})$ is equivalent to$\bar{C}+\bar{A} B$$C+A B$$...
GO Classes
809
views
asked
Jun 3, 2025
Digital Logic
goclasses
digital-logic
boolean-algebra
canonical-normal-form
k-map
min-sum-of-products-form
goclasses-cs-dpp
goclasses-cs-dpp-day-5
goclasses-digital-logic-practice-questions
+
–
8
8 votes
6
6 answers
827
827 views
GO Classes DPP | Digital Logic | Boolean Algebra | UNC Charlotte
Minimize the below expression$$F(a, b, c, d)=\left(\left(a+b^{\prime}+d^{\prime}\right) \cdot(c+d) \cdot\left(a^{\prime}+c+d\right) \cdot\left(a+b+d^{\prime}\right)\right...
GO Classes
827
views
asked
May 31, 2025
Digital Logic
goclasses
digital-logic
boolean-algebra
min-sum-of-products-form
canonical-normal-form
k-map
goclasses-cs-dpp
goclasses-cs-dpp-day-2
goclasses-digital-logic-practice-questions
+
–
17
17 votes
4
4 answers
6.3k
6.3k views
GATE CSE 2025 | Set 1 | Question: 32
Consider the following four variable Boolean function in sum-of-product form$$ F\left(b_{3}, b_{2}, b_{1}, b_{0}\right)=\sum(0,2,4,8,10,11,12)$$where the value of the fun...
Arjun
6.3k
views
asked
Feb 27, 2025
Digital Logic
gatecse2025-set1
digital-logic
min-sum-of-products-form
easy
two-marks
+
–
1
1 vote
0
0 answers
341
341 views
Boolean Expression conversion using DeMorgan's theorem
1. Using DeMorgan’ s theorem, Convert the following Boolean Expressions to the Equivalent Expressions that have only OR and Complement Operation. Show that the function...
Kiruthika_Kiruthika
341
views
asked
Nov 2, 2024
Digital Logic
digital-logic
boolean-algebra
min-sum-of-products-form
k-map
+
–
0
0 votes
1
answers
1 answer
299
299 views
standard resources question comparator
Let x = x1x0 and y = y1y0 be unsigned 2-bit numbers. The function F = 1 if x y and F = 0 otherwise. The minimal sum of product expression for F, is - (a) y1y0 + x0y0 + x...
srijankarak_123
299
views
asked
Oct 22, 2024
Digital Logic
digital-logic
min-sum-of-products-form
+
–
23
23 votes
2
2 answers
13.6k
13.6k views
GATE CSE 2024 | Set 1 | Question: 37
Consider a Boolean expression given by $\text{F(X, Y, Z)}=\sum(3,5,6,7)$.Which of the following statements is/are CORRECT?$\text{F(X, Y, Z)}=\Pi(0,1,2,4)$ $\text{F(X, Y, ...
Arjun
13.6k
views
asked
Feb 16, 2024
Digital Logic
gatecse-2024-set1
multiple-selects
digital-logic
min-sum-of-products-form
two-marks
+
–
71
71 votes
4
answers
4 answers
31.5k
31.5k views
GATE CSE 2021 | Set 2 | Question: 52
Consider a Boolean function $f(w,x,y,z)$ such that $$\begin{array}{lll} f(w,0,0,z) & = & 1 \\ f(1,x,1,z) & =& x+z \\ f(w,1,y,z) & = & wz +y \end{array}$$The number of li...
Arjun
31.5k
views
asked
Feb 18, 2021
Digital Logic
gatecse-2021-set2
digital-logic
boolean-algebra
min-sum-of-products-form
numerical-answers
two-marks
+
–
Page:
1
2
next »