adplus-dvertising

Discussion Forum

Que. The minterm expansion of f(P, Q, R) = PQ + QR' + PR' is
a. m2 + m4 + m6 + m7
b. m0 + m1 + m3 + m5
c. m0 + m1 + m6 + m7
d. m2 + m3 + m4 + m5
Answer:m2 + m4 + m6 + m7
Srilekha :(December 07, 2017) I need explanation
PQ+QR'+PR'
=PQ(R+R')+QR'(P+P')+PR'(Q+Q')
=PQR+PQR'+PQR'+P'QR'+PQR'+PQ'R'
111 110 110 010 110 100
7 6 6 2 6 4
= 2+ 4+6+7
=m2+m4+m6+m7
Click Here to Reply
Confused About the Answer? Ask for Details Here
Know Explanation? Add it Here

Similar Questions:

Consider an algebraic system (A,*), where A is a set of all non-zero real numbers and * is a binary operation defined by A* b = ab/4 then (G*) is a
A 32-bit address bus allows access to a memory of capability
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 i₁=⟨w₁,x₁,y₁,z₁⟩ and i₂=⟨w₂,x₂,y₂,z₂⟩ , we would like the function to remain true as the input changes from i₁ to i₂ (i₁ and i₂ 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?
How many Boolean functions are possible with 3 Boolean variables such that the number of min terms are either one or two?
To prevent signals from colliding on the bus, ……………….. Prioritize access to memory by I/o channels and processors.
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?
Find the radix 5 representation for the following decimal representation:
(39)₁₀ = ( ) ₅
Consider a carry lookahead adder for adding two n-bit integers, built using gates of fan-in at most two. The time to perform addition using this adder is
A 4-bit carry lookahead adder, which adds two 4-bit numbers, is designed using AND, OR, NOT, NAND, NOR gates only. Assuming that all the inputs are available in both complemented and uncomplemented forms and the delay of each gate is one time unit, what is the overall propagation delay of the adder? Assume that the carry network has been implemented using two-level AND-OR logic.
A positive edge-triggered D flip-flop is connected to a positive edge-triggered JK flipflop as follows. The Q output of the D flip-flop is connected to both the J and K inputs of the JK flip-flop, while the Q output of the JK flip-flop is connected to the input of the D flip-flop. Initially, the output of the D flip-flop is set to logic one and the output of the JK flip-flop is cleared. Which one of the following is the bit sequence (including the initial state) generated at the Q output of the JK flip-flop when the flip-flops are connected to a free-running common clock? Assume that J = K = 1 is the toggle mode and J = K = 0 is the state-holding mode of the JK flip-flop. Both the flip-flops have non-zero propagation delays.
A half adder is implemented with XOR and AND gates. A full adder is implemented with two half adders and one OR gate. The propagation delay of an XOR gate is twice that of an AND/OR gate. The propagation delay of an AND/OR gate is 1.2 microseconds. A 4-bit ripple-carry binary adder is implemented by using full adders. The total propagation time of this 4-bit binary adder in microseconds is
A sequence machine is supposed to receive block of 0’s & 1’s the correct operation required 1’s, number of 1’s in 1st block must be odd and number of 0’s in 0’s block must be even. Any violation indicated by machine outputs 1 against 1st bit of opposite block. What will be minimum number of states in the sequence machine?
Horizontal micro construction has which of the following attributes?
1) Short formats
2) Limited ability to express parallel micro-operations
3) Considerable encoding of the control information
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
Which addressing mode is suitable for a high-level language statement?
Let A = 1111 1010 and B = 0000 1010 be two 8-bit 2's complement numbers. Their product in 2's complement is
What is the control unit’s function in the CPU?
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.
What is the result of evaluating the following two expressions using three-digit floating point arithmetic with rounding?

(113.+−111.)+7.51
113.+(−111.+7.51)
A circuit outputs a digit in the form of 4 bits. 0 is represented by 0000, 1 by 0001, ..., 9 by 1001. A combinational circuit is to be designed which takes these 4 bits as input and outputs 1 if the digit ≥ 5, and 0 otherwise. If only AND, OR and NOT gates may be used, what is the minimum number of gates required?

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.