GATE & PSUs - Electrical & Electronics Engineering (EE & ECE)

Boolean Algebra, K-Maps & Logic Minimization question bank (Digital Electronics & Microprocessors)

Practice 7 free GATE & PSUs - Electrical & Electronics Engineering (EE & ECE) Digital Electronics & Microprocessors - Boolean Algebra, K-Maps & Logic Minimization questions with answers and step-by-step solutions.

Start free Book a demo
All Hard Medium
Q1.
How many $2$-to-$1$ multiplexers are required to construct an $8$-to-$1$ multiplexer without any additional external logic gates?

(A)
$7$
(B)
$8$
(C)
$4$
(D)
$15$
Show answer & solution
Verified Answer & Solution Locked
Sign in to your free student account to reveal verified answers, instant hints, and detailed explanations.
Sign in to view
Q2.
[Boolean Algebra, K-Maps & Logic Minimization Concept 6] How many $2$-to-$1$ multiplexers are required to construct an $8$-to-$1$ multiplexer without any additional external logic gates?

(A)
$7$
(B)
$8$
(C)
$4$
(D)
$15$
Show answer & solution
Verified Answer & Solution Locked
Sign in to your free student account to reveal verified answers, instant hints, and detailed explanations.
Sign in to view
Protected Questions

Unlock All 7 Questions in Boolean Algebra, K-Maps & Logic Minimization

Log in or sign up free to access every question with complete solutions, create chapter practice tests, and track your performance.

Sign in to unlock Create free account

Sign up free to access all 7 questions

Unlock every Boolean Algebra, K-Maps & Logic Minimization question, generate papers, and practice at your own pace.

Start free