adplus-dvertising

Discussion Forum

Que. Suppose only one multiplexer and one inverter are allowed to be used to implement any Boolean function of n variables. What is the minimum size of the multiplexer needed?
a. 2^n line to 1 line
b. 2^(n+1) line to 1 line
c. 2^(n-1) line to 1 line
d. 2^(n-2) line to 1 line
Answer:2^(n-1) line to 1 line
Shruti :(November 20, 2019) Please explain the answer
Click Here to Reply
Confused About the Answer? Ask for Details Here
Know Explanation? Add it Here

Similar Questions:

To put the 8085 microprocessor in the wait state
How many bits are needed to represent 20 digit decimal number in binary?
A computer system has 4k – word cache organized in a block – set-associative manner, with 4 blocks per set, 64 words per block, memory is word addressable. The number of bits in the SET and WORD fields of the main memory address format is
Consider the equation (123)5 = (x8)y with x and y as unknown. The number of possible solutions is _____ .
A 32-bit address bus allows access to a memory of capability
The bus system of a machine has the following propagation delay times 40 ns for the signals to propagate through the multiplexers, 90ns to perform the ADD operating in the ALU, 30ns delay in the destination decoder, and 20ns to store the data into the destination register. What is the minimum cycle time that can be used for the clock?
In 8085, which of the following modifies the program counter ?
The Principle of locality justifies the use of
Consider the following Boolean function of four variables: f(w,x,y,z) = ∑(1,3,4,6,9,11,12,14) The function is:
How many Boolean functions are possible with 2 trinary variables?
Which is the most appropriate match for the items in the first column with the items in the second column:

X. Indirect Addressing I. Array implementation
Y. Indexed Addressing II. Writing re-locatable code
Z. Base Register Addressing III. Passing array as parameter
Consider the following subtraction and Identify the correct answer.

(C012.25)₄ – (10111001110.101)₈
Sign extension is a step in
A 5 stage pipeline with the stages taking 1, 1, 3, 1, 1 units of time has a through put of
Consider the grammar rule E → E1 - E2 for arith­metic expressions. The code generated is targeted to a CPU having a single user register. The sub­traction operation requires the first operand to be in the register. If E1 and E2 do not have any com­mon sub expression, in order to get the shortest possible code
Which of the following statement is FALSE regarding functionally completeness, (FC).
Consider a 4 bit Johnson counter with an initial value of 0000. The counting sequence of this counter is:
Horizontal microprogramming :
Which of the following data transfer modes takes relatively more time?
A 1-input, 2-output synchronous sequential circuit behaves as follows : Let zk, nk denote the number of 0's and 1's respectively in initial k bits of the input (zk + nk = k). The circuit outputs 00 until one of the following conditions holds.

zk - nk = 2. In this case, the output at the k-th and
all subsequent clock ticks is 10.
nk - zk = 2. In this case, the output at the k-th and
all subsequent clock ticks is 01.

What is the minimum number of states required in the state transition graph of the above circuit?

GATE CSE Resources

Questions from Previous year GATE question papers

UGC NET Computer science Resources

UGC NET Previous year questions and practice sets

NET General Paper 1

UGC NET Previous year questions and practice sets

GATE CSE Online Test

Attempt a small test to analyze your preparation level. This GATE exam includes questions from previous year GATE papers.

UGC NET practice Test

Practice test for UGC NET Computer Science Paper. The questions asked in this NET practice paper are from various previous year papers.