adplus-dvertising

Discussion Forum

Que. Define the connective * for the Boolean variables X and Y as: X * Y = XY + X' Y'. Let Z = X * Y.
Consider the following expressions P, Q and R.

P: X = Y⋆Z
Q: Y = X⋆Z
R: X⋆Y⋆Z=1

Which of the following is TRUE?
a. Only P and Q are valid
b. Only Q and R are valid
c. Only P and R are valid
d. All P, Q, R are valid
Answer:All P, Q, R are valid
Confused About the Answer? Ask for Details Here
Know Explanation? Add it Here

Similar Questions:

The simplified SOP (Sum Of Product) form of the boolean expression (P + Q' + R') . (P + Q' + R) . (P + Q + R') is
Which of the following expressions is equivalent to (A⊕B)⊕C
Let X denote the Exclusive OR (XOR) operation. Let ‘1’ and ‘0’ denote the binary constants. Consider the following Boolean expression for F over two variables P and Q:

F(P, Q) = ( ( 1 X P) X (P X Q) ) X ( (P X Q) X (Q X 0) )

The equivalent expression for F is
A 5 stage pipeline with the stages taking 1, 1, 3, 1, 1 units of time has a through put of
Consider a 4 bit Johnson counter with an initial value of 0000. The counting sequence of this counter is:
If 73x (in base-x number system) is equal to 54y (in base-y number system), the possible values of x and y are
If P,Q,R are boolean variables, then (P+Q’)(PQ’+PR)(P’R’+Q’) simplifies to
Find the radix 5 representation for the following decimal representation:
(39)₁₀ = ( ) ₅
A system that has a lot of crashes, data should be written to the disk using?
We want to design a synchronous counter that counts the sequence 0-1-0-2-0-3 and then repeats. The minimum number of J-K flip-flops required to implement this counter is
The register which holds the address of the locating to or from which data are to be transferred is known as
What is the minimum number of NAND gates required to implement a 2-input EXCLUSIVE-OR function without using any other logic gate?
The number (123456)8 is equivalent to
Horizontal microprogramming :
To put the 8085 microprocessor in the wait state
How many 3 – to – 8 line decoders with an enable input are needed to construct a 6 – to – 64 line decoder without using any other logic gates?
P is a 16 – bit signed integer. The 2’s complement representation of P is (F87B)₁₆. The 2’s complement representation of 8 * p is
Find the value of radix r, with the following equality is matached.

√(21)ᵣ = (11)ᵣ
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 ?
Let A = 1111 1010 and B = 0000 1010 be two 8-bit 2's complement numbers. Their product in 2's complement is

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.