Computer Sciences > Gate 2018 > Digital Logic
Consider the minterm list form of a Boolean function F given below.

F(P, Q, R, S) = Ξ£m(0, 2, 5, 7, 9, 11) + d(3, 8, 10, 12, 14)


Here, m denotes a minterm and d denotes a don^^t care term. The number of essential prime implicants of the function F is ______ .

Correct : a

Similar Questions

A multiplexer is placed between a group of 32 registers and an accumulator to regulate data movement such that at any given point in time the content of only on...
#651 Fill in the Blanks
Consider a system that uses 5 bitsfor representing signed integers in 2’s complement format. In this system, two integers 𝐴 and 𝐡 are represented as 𝐴=01010 an...
#828 MCQ
Consider a permutation sampled uniformly at random from the set of all permutations of {1, 2, 3, β‹― , 𝑛} for some 𝑛 β‰₯ 4. Let 𝑋 be the event that 1 occurs before...
#829 MCQ

Related Topics

boolean algebra GATE 2018 essential prime implicants minterm don't care computer science gate Boolean function simplification GATE CS 2018 logic gates and boolean simplify boolean expression

Unique Visitor Count

Total Unique Visitors

Loading......