adplus-dvertising

Discussion Forum

Que. The simplified SOP (Sum Of Product) form of the boolean expression (P + Q' + R') . (P + Q' + R) . (P + Q + R') is
a. (P'.Q + R')
b. (P + Q'.R')
c. (P'.Q + R)
d. (P.Q + R)
Answer:(P + Q'.R')
Ritika :(June 21, 2021) (P+Q'+R').(P+Q'+R).(P+Q+R')

=(P+R`)(Q+Q`)(P+Q`+R)

=P+PR+PQ`+R`P+R`Q`

=P(1+Q`)+R`P+R`Q`

=P(1+R`)+R`Q`

=P+R`Q`
Click Here to Reply
Ritika Pravakar :(June 21, 2021) (P+Q'+R').(P+Q'+R).(P+Q+R')

=(P+R`)(Q+Q`)(P+Q`+R)

=P+PR+PQ`+R`P+R`Q`

=P(1+Q`)+R`P+R`Q`

=P(1+R`)+R`Q`

=P+R`Q`
Click Here to Reply
Confused About the Answer? Ask for Details Here
Know Explanation? Add it Here

Similar Questions:

In an SR latch made by cross coupling two NAND gates, If both S and R inputs are set to 0, then it will result in
Sign extension is a step in
For a pipelined CPU with a single ALU, consider the following situations

1. The j + 1-st instruction uses the result of the j-th instruction
as an operand
2. The execution of a conditional jump instruction
3. The j-th and j + 1-st instructions require the ALU at the same
time

Which of the above can cause a hazard ?
A CPU has two modes-privileged and non-privileged. In order to change the mode from privileged to non-privileged
The function AB’C + A’BC + ABC’ + A’B’C + AB’C’ is equivalent to
The system bus consists of
What is the equivalent decimal representation for the following radix representation?

(34.44)₈
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?
Spatial locality refers to the problem that once a location is referenced
In a look-ahead carry generator, the carry generate function Gi and the carry propagate function Pi for inputs Ai and Bi are given by:

Pi = Ai ⨁ Bi and Gi = AiBi

The expressions for the sum bit Si and the carry bit Ci+1 of the look-ahead carry adder are given by:

Si = Pi ⨁ Ci and Ci+1 = Gi + PiCi , where C0 is the input carry.

Consider a two-level logic implementation of the look-ahead carry generator. Assume that all Pi and Gi are available for the carry generator circuit and that the AND and OR gates can have any number of inputs. The number of AND gates and OR gates needed to implement the look-ahead carry generator for a 4-bit adder with S3, S2, S1, S0 and C4 as its outputs are respectively:
A processor that has carry, overflow and sign flag bits as part of its program status word (PSW) performs addition of the following two 2's complement numbers 01001101 and 11101001. After the execution of this addition operation, the status of the carry, overflow and sign flags, respectively will be:
Consider an array multiplier for multiplying two n bit numbers. If each gate in the circuit has a unit delay, the total delay of the multiplier is
Comparing the time T1 taken for a single instruction on a pipelined CPU with time T2 taken on a non­ pipelined but identical CPU, we can say that
Let A = 1111 1010 and B = 0000 1010 be two 8-bit 2's complement numbers. Their product in 2's complement is
Which of the following is not a valid class of interrupts?
1) Program
2) Timer
3) I/o
4) Hardware failure
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
Which of the following expressions is equivalent to (A⊕B)⊕C
A low memory can be connected to 8085 by using
The simplified SOP (Sum Of Product) form of the boolean expression (P + Q' + R') . (P + Q' + R) . (P + Q + R') is
Consider the following register – transfer language:

R₃ ← R₂+ M[R₁ + R₂]

Where R₁, R₂ are the CPU registers and M is a memory location in primary memory, which addressing mode is suitable for above register transfer language?

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.