adplus-dvertising

Discussion Forum

Que. What is the minimum number of gates required to implement the Boolean function (AB+C)if we have to use only 2-input NOR gates?
a. 2
b. 3
c. 4
d. 5
Answer:3
Ramesh :(November 18, 2021) To me, the answer is 4. Applying De Morgans theorem two times will lead to y'' = ((A'+B')+C')'
This requires 4 NOR gate, 1 for A', another for B', another for C' and the last for ((A'+B')+C')'
review this answer please
AB+C = (A+C)(B+C) = ((A+C)’ + (B+C)’)’.
So 3 NOR gates are required.
Click Here to Reply
Confused About the Answer? Ask for Details Here
Know Explanation? Add it Here

Similar Questions:

A 10 – bit Asynchronous counter is having initial value 0 1 0 0 0 1 1 1 1 1. How many flip flops are complemented at next clock?
The register which keeps track of the execution of a program and which contains the memory address of the instruction currently being executed is known as …………
What is the minimum number of gates required to implement the Boolean function (AB+C)if we have to use only 2-input NOR gates?
How many bits are needed to represent 20 digit decimal number in binary?
The CPU initializes the DMA by sending ………
The 8085 microprocessor responds to the presence of an interrupt
The performance of a pipelined processor suffers if
What is the minimum number of NAND gates required to implement a 2-input EXCLUSIVE-OR function without using any other logic gate?
A 5 stage pipeline with the stages taking 1, 1, 3, 1, 1 units of time has a through put of
Booth′s algorithm is used in floating – point
The number (123456)8 is equivalent to
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?
Which of the following is the minimization expression for A+A'B+A'B'C+A'B'C'D?
Addressing mode is …………………
Assembler directives represent………………
1) Machine instructions to be included in the object program
2) The allocation of storage for constants or program variable
The minimum time delay between the initiations of two independent memory operations is called
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?
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?
In a two-level memory hierarchy, the access time of the memory is 12 nanoseconds and the access time of the main memory is 1.5 microseconds. The hit ratio is 0.98. What is the average access time of the two-level memory system?
The switching expression corresponding to f(A, B, C, D) = Σ (1, 4, 5, 9, 11, 12) 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.