GATE CS 2017 (Forenoon) — Question 21

Digital LogicBoolean Algebra, Minimization, K-MapsNAT1 markMedium

Consider the Karnaugh map given below, where X represents "don't care" and blank represents 0.
Question image
Assume for all inputs (\(a, b, c, d\)), the respective complements (\(\bar{a}, \bar{b}, \bar{c}, \bar{d}\)) are also available. The above logic is implemented using 2-input NOR gates only. The minimum number of gates required is ________.
Practise the full 2017-FN paper
Challenge a friend: WhatsApp Telegram
From RENYXERAWhat rank do your marks get?GATE score, likely All-India Rank and qualifying marks for your category.
Practise more on Boolean Algebra, Minimization, K-MapsTimed, in the real exam interface · free to start

A GATE question every morning

One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.

Join
Stuck? Ask in the student group