adplus-dvertising

Discussion Forum

Que. Consider the following Boolean function of four variables: f(w,x,y,z) = ∑(1,3,4,6,9,11,12,14) The function is:
a. independent of one variables
b. independent of two variables
c. independent of three variables
d. dependent on all the variables
Answer:independent of two variables
NItesh :(April 13, 2020) How did this happen
Click Here to Reply
Confused About the Answer? Ask for Details Here
Know Explanation? Add it Here

Similar Questions:

How many minimum 2-input nor gates are needed to realize A+BC?
A sequential circuit is having one input and 2 states; The clock is initially in state A. It remains in the same state as long as (x=0) (i.e., input =0). If the input is 1, it switches to the state B and remains there as long as input is 0. On receiving 1 it switches back to state A. If it is realized with D – FF. what is the expression for D FF?
Booth′s algorithm is used in floating – point
Consider a multiplexer with X and Y as data inputs and Z as control input. Z = 0 selects input X, and Z = 1 selects input Y. What are the connections required to realize the 2-variable Boolean function f = T + R, without using any additional hardware ?
Consider a Boolean function f (w, x, y, z). suppose that exactly one of its inputs is allowed to change at a time. If the function happens to be true for two input vectors i1 = (w1, x1, y1, z1) and i2 = (w2, x2, y2, z2) we would like the function to remain true as the input changes from i1 to i2 (i1 and i2 differ in exactly one bit position), without becoming false momentarily. Let f (w, x, y, z) = ∑(5,7,11,12,13,15). Which of the following cube covers of f will ensure that the required property is satisfied?
Which of the following is the minimization expression for A+A'B+A'B'C+A'B'C'D?
The range of integers that can be represented by an n – bit 2's complement number system is
Which of the following statement is FALSE regarding functionally completeness, (FC).
Assume that the time required for the eight functional units, which operate in each of the eight cycles, are as follows.

5us, 8us, 64s, 10us, 15us, 12us, 6us, 8us

Assume that pipe lining adds 1 us, of overhead. Find the speedup versus the single cycle data path.
How many Boolean functions are possible with 2 trinary variables?
ID catching system, the memory reference made in any short time integral tends to use only a small fraction of the total memory?
How many digits are required to represent 126 bit binary number in decimal?
The Principle of locality justifies the use of
Let A = 1111 1010 and B = 0000 1010 be two 8-bit 2's complement numbers. Their product in 2's complement is
The switching expression corresponding to f(A, B, C, D) = Σ (1, 4, 5, 9, 11, 12) is
The minimum number of JK flip-flops required to construct a synchronous counter with the count sequence (0, 0, 1, 1, 2, 2, 3, 3, 0, 0,...) is ________.
Assuming all numbers are in 2’s complement representation, which of the following numbers is divisible by 11111011?
The literal count of a Boolean expression is the sum of the number of times each literal appears in the expression. For example, the literal count of (x y + x z) is 4. What are the minimum possible literal counts of the product – of – sum and sum – of – product representations respectively of the function given by the following karnaugh map? Here, x denotes “don’t care”.
Halt operation comes under ………
Let k = 2^n. A circuit is built by giving the output of an n-bit binary counter as input to an n-to-2^n bit decoder. This circuit is equivalent to a

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.