GATE CS 2021 (Afternoon) — Question 62

Digital LogicBoolean Algebra, Minimization, K-MapsNAT2 marksMedium

Consider a Boolean function \(f(w, x, y, z)\) such that \(f(w, 0, 0, z) = 1\) \(f(1, x, 1, z) = x + z\) \(f(w, 1, y, z) = wz + y\) The number of literals in the minimal sum-of-products expression of \(f\) is _________.
Practise the full 2021-AN paper
Challenge a friend: WhatsApp Telegram
From RENYXERAThis week's 10-question challengeSame 10 past-GATE questions for everyone this week — see where you stand.
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