Discussion
The number of two-input multiplexers required to construct a 210 input multiplexer is
Answer: D
Correct answer: 1023
Building a \(2^n\) input multiplexer from two-input multiplexers gives a binary tree: \(2^{n-1}\) at the first level, \(2^{n-2}\) at the next, and so on down to one. The total is
\[ 2^{9}+2^{8}+\cdots+2^{0}=2^{10}-1=1023 \]
No comment is present. Be the first to comment.
Loading…
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development