How many two-input AND and OR gates are required to realize Y=CD+EF+G (A) 2,2. (B) 2,3. (C) 3,3. (D) none of these.

How many two-input AND and OR gates are required to realize Y=CD+EF+G
(A) 2,2. (B) 2,3.
(C) 3,3. (D) none of these.
by

1 Answer

Answer :

Ans: A
Y=CD+EF+G
Number of two input AND gates=2
Number of two input OR gates = 2
One OR gate to OR CD and EF and next to OR of G & output of first OR gate.
by

Related questions

How many AND gates are required to realize Y = CD+EF+G (A) 4 (B) 5 (C) 3 (D) 2

Description : How many AND gates are required to realize Y = CD+EF+G (A) 4 (B) 5 (C) 3 (D) 2

Last Answer : 2

How many two input AND gates and two input OR gates are required to realize Y = BD+CE+AB (A) 1, 1 (B) 4, 2 (C) 3, 2 (D) 2, 3

Description : How many two input AND gates and two input OR gates are required to realize Y = BD+CE+AB (A) 1, 1 (B) 4, 2 (C) 3, 2 (D) 2, 3

Last Answer : Ans: A There are three product terms, so three AND gates of two inputs are required. As only two input OR gates are available, so two OR gates are required to get the logical sum of three product terms.

The result of adding hexadecimal number A6 to 3A is (A) DD. (B) E0. (C) F0. (D) EF.

Description : The result of adding hexadecimal number A6 to 3A is (A) DD. (B) E0. (C) F0. (D) EF.

Last Answer : (B) E0.

The gates required to build a half adder are (A) EX-OR gate and NOR gate (B) EX-OR gate and OR gate (C) EX-OR gate and AND gate (D) Four NAND gates.

Description : The gates required to build a half adder are (A) EX-OR gate and NOR gate (B) EX-OR gate and OR gate (C) EX-OR gate and AND gate (D) Four NAND gates.

Last Answer : (C) EX-OR gate and AND gate

How many minimum number of NOR gates are required to realize a two-input X-OR gate?

Description : How many minimum number of NOR gates are required to realize a two-input X-OR gate?

Last Answer : 5

Which of following are known as universal gates (A) NAND & NOR. (B) AND & OR. (C) XOR & OR. (D) None.

Description : Which of following are known as universal gates (A) NAND & NOR. (B) AND & OR. (C) XOR & OR. (D) None.

Last Answer : Ans: A NAND & NOR are known as universal gates, because any digital circuit can be realized completely by using either of these two gates.

Which TTL logic gate is used for wired ANDing (A) Open collector output (B) Totem Pole (C) Tri state output (D) ECL gates

Description : Which TTL logic gate is used for wired ANDing (A) Open collector output (B) Totem Pole (C) Tri state output (D) ECL gates

Last Answer : Ans: A Open collector output.

The output of a JK flipflop with asynchronous preset and clear inputs is ‘1’. The output can be changed to ‘0’ with one of the following conditions. (A) By applying J = 0, K = 0 and using a clock. (B) By applying J = 1, K = 0 and using the clock. (C) By applying J = 1, K = 1 and using the clock. (D) By applying a synchronous preset input.

Description : The output of a JK flipflop with asynchronous preset and clear inputs is 1'. The output can be changed to 0' with one of the following conditions. (A) By applying J = 0, K = 0 and using a clock. (B) ... (C) By applying J = 1, K = 1 and using the clock. (D) By applying a synchronous preset input.

Last Answer : Ans: C Preset state of JK Flip-Flop =1 With J=1 K=1 and the clock next state will be complement of the present state.

An eight stage ripple counter uses a flip-flop with propagation delay of 75 nanoseconds. The pulse width of the strobe is 50ns. The frequency of the input signal which can be used for proper operation of the counter is approximately (A) 1 MHz. (B) 500 MHz. (C) 2 MHz. (D) 4 MHz.

Description : An eight stage ripple counter uses a flip-flop with propagation delay of 75 nanoseconds. The pulse width of the strobe is 50ns. The frequency of the input signal which can be used for proper operation of the counter is approximately (A) 1 MHz. (B) 500 MHz. (C) 2 MHz. (D) 4 MHz.

Last Answer : Maximum time taken for all flip-flops to stabilize is 75ns x 8 + 50 = 650ns. Frequency of operation must be less than 1/650ns = 1.5 MHz.

When an input signal A=11001 is applied to a NOT gate serially, its output signal is (A) 00111. (B) 00110. (C) 10101. (D) 11001.

Description : When an input signal A=11001 is applied to a NOT gate serially, its output signal is (A) 00111. (B) 00110. (C) 10101. (D) 11001.

Last Answer : When an input signal A=01001 is applied to a NOT gate serially , it's output signal is

When the set of input data to an even parity generator is 0111, the output will be (A) 1 (B) 0 (C) Unpredictable (D) Depends on the previous input

Description : When the set of input data to an even parity generator is 0111, the output will be (A) 1 (B) 0 (C) Unpredictable (D) Depends on the previous input

Last Answer : Ans: B In even parity generator if number of 1 is odd then output will be zero.

The commercially available 8-input multiplexer integrated circuit in the TTL family is (A) 7495. (B) 74153. (C) 74154. (D) 74151.

Description : The commercially available 8-input multiplexer integrated circuit in the TTL family is (A) 7495. (B) 74153. (C) 74154. (D) 74151.

Last Answer : Ans: B MUX integrated circuit in TTL is 74153.

In successive-approximation A/D converter, offset voltage equal to 1/2 LSB is added to the D/A converter’s output. This is done to (A) Improve the speed of operation. (B) Reduce the maximum quantization error. (C) Increase the number of bits at the output. (D) Increase the range of input voltage that can be converted

Description : In successive-approximation A/D converter, offset voltage equal to 1/2 LSB is added to the D/A converter's output. This is done to (A) Improve the speed of operation. (B) Reduce the maximum ... Increase the number of bits at the output. (D) Increase the range of input voltage that can be converted

Last Answer : (B) Reduce the maximum quantization error.

If the input to T-flipflop is 100 Hz signal, the final output of the three T-flipflops in cascade is (A) 1000 Hz (B) 500 Hz (C) 333 Hz (D) 12.5 Hz.

Description : If the input to T-flipflop is 100 Hz signal, the final output of the three T-flipflops in cascade is (A) 1000 Hz (B) 500 Hz (C) 333 Hz (D) 12.5 Hz.

Last Answer : (D) 12.5 Hz.

How many address bits are required to represent 4K memory (A) 5 bits. (B) 12 bits. (C) 8 bits. (D) 10 bits.

Description : How many address bits are required to represent 4K memory (A) 5 bits. (B) 12 bits. (C) 8 bits. (D) 10 bits.

Last Answer : (B) 12 bits.

How many address bits are required to represent a 32 K memory (A) 10 bits. (B) 12 bits. (C) 14 bits. (D) 16 bits.

Description : How many address bits are required to represent a 32 K memory (A) 10 bits. (B) 12 bits. (C) 14 bits. (D) 16 bits.

Last Answer : (D) 16 bits.

How many flip-flops are required to construct mod 30 counter (A) 5 (B) 6 (C) 4 (D) 8

Description : How many flip-flops are required to construct mod 30 counter (A) 5 (B) 6 (C) 4 (D) 8

Last Answer : (A) 5

How many flip flops are required to construct a decade counter (A) 10 (B) 3 (C) 4 (D) 2

Description : How many flip flops are required to construct a decade counter (A) 10 (B) 3 (C) 4 (D) 2

Last Answer : Ans: C Decade counter counts 10 states from 0 to 9 ( i.e. from 0000 to 1001 ) Thus four FlipFlop's are required.

Words having 8-bits are to be stored into computer memory. The number of lines required for writing into memory are (A) 1. (B) 2. (C) 4. (D) 8.

Description : Words having 8-bits are to be stored into computer memory. The number of lines required for writing into memory are (A) 1. (B) 2. (C) 4. (D) 8.

Last Answer : Ans: D Because 8-bit words required 8 bit data lines.

A 4-bit synchronous counter uses flip-flops with propagation delay times of 15 ns each. The maximum possible time required for change of state will be (A) 15 ns. (B) 30 ns. (C) 45 ns. (D) 60 ns.

Description : A 4-bit synchronous counter uses flip-flops with propagation delay times of 15 ns each. The maximum possible time required for change of state will be (A) 15 ns. (B) 30 ns. (C) 45 ns. (D) 60 ns.

Last Answer : Ans: A 15 ns because in synchronous counter all the flip-flops change state at the same time.

How many Flip-Flops are required for mod–16 counter? (A) 5 (B) 6 (C) 3 (D) 4

Description : How many Flip-Flops are required for mod–16 counter? (A) 5 (B) 6 (C) 3 (D) 4

Last Answer : (D) 4

When simplified with Boolean Algebra (x + y)(x + z) simplifies to (A) x (B) x + x(y + z) (C) x(1 + yz) (D) x + yz

Description : When simplified with Boolean Algebra (x + y)(x + z) simplifies to (A) x (B) x + x(y + z) (C) x(1 + yz) (D) x + yz

Last Answer : Ans: D When simplified with Boolean Algebra (x + y)(x + z) simplifies to x + yz [(x + y) (x + z)] = xx + xz + xy + yz = x + xz + xy + yz (Qxx = x) = x(1+z) + xy + yz = x + xy + yz {Q(1+z) = 1} = x(1 + y) + yz = x + yz {Q(1+y) = 1}]

EF is the transversal to two parallel lines AB and CD. GM and HL are the bisector of the corresponding angles EGB and EHD.Prove that GL parallel to HL. -Maths 9th

Description : EF is the transversal to two parallel lines AB and CD. GM and HL are the bisector of the corresponding angles EGB and EHD.Prove that GL parallel to HL. -Maths 9th

Last Answer : AB || CD and a transversal EF intersects them ∴ ∠EGB = ∠GHD ( Corresponding Angles) ⇒ 2 ∠EGM = 2 ∠GHL ∵ GM and HL are the bisectors of ∠EGB and ∠EHD respectively. ⇒ ∠EGM = ∠GHL But these angles form a pair of equal corresponding angles for lines GM and HL and transversal EF. ∴ GM || HL.

EF is the transversal to two parallel lines AB and CD. GM and HL are the bisector of the corresponding angles EGB and EHD.Prove that GL parallel to HL. -Maths 9th

Description : EF is the transversal to two parallel lines AB and CD. GM and HL are the bisector of the corresponding angles EGB and EHD.Prove that GL parallel to HL. -Maths 9th

Last Answer : AB || CD and a transversal EF intersects them ∴ ∠EGB = ∠GHD ( Corresponding Angles) ⇒ 2 ∠EGM = 2 ∠GHL ∵ GM and HL are the bisectors of ∠EGB and ∠EHD respectively. ⇒ ∠EGM = ∠GHL But these angles form a pair of equal corresponding angles for lines GM and HL and transversal EF. ∴ GM || HL.

ABCD is a square. E and F are respectively the mid - points of BC and CD. If R is the mid point of EF. -Maths 9th

Description : ABCD is a square. E and F are respectively the mid - points of BC and CD. If R is the mid point of EF. -Maths 9th

Last Answer : Since R is the mid point of EF . ∴ AR is the median in △AEF. As, a median of a triangle divides it into two triangles of equal area . ∴ ar(△AER) = ar(△AFR)

ABCD is a square. E and F are respectively the mid - points of BC and CD. If R is the mid point of EF. -Maths 9th

Description : ABCD is a square. E and F are respectively the mid - points of BC and CD. If R is the mid point of EF. -Maths 9th

Last Answer : Since R is the mid point of EF . ∴ AR is the median in △AEF. As, a median of a triangle divides it into two triangles of equal area . ∴ ar(△AER) = ar(△AFR)

In Fig. 6.20, find x if AB| |CD| |EF. -Maths 9th

Description : In Fig. 6.20, find x if AB| |CD| |EF. -Maths 9th

Last Answer : Solution :-

E and F are respectively the mid-points of the non-parallel sides AD and BC of a trapezium ABCD. Prove that EF||AB and EF = 1/2 (AB +CD). -Maths 9th

Description : E and F are respectively the mid-points of the non-parallel sides AD and BC of a trapezium ABCD. Prove that EF||AB and EF = 1/2 (AB +CD). -Maths 9th

Last Answer : Solution :-

Find the back bearing of the following lines having fore bearing as given below: (i) PQ = N 55° 0' E (ii) EF == 280° 0' (iii) CD = S 58° 30' W (iv) OM= 180° 0'

Description : Find the back bearing of the following lines having fore bearing as given below: (i) PQ = N 55° 0' E (ii) EF == 280° 0' (iii) CD = S 58° 30' W (iv) OM= 180° 0'

Last Answer : i) F.B OF PQ = N 55°0 ’ E  B.B Of PQ = S 55°0 ’W  ii) F.B. Of EF = 280°0 ’   B.B OF EF = F.B -180°= 280°0 ’ -180° = 100°0 ’  iii) F.B OF CD = S 58°30’W  B.B OF CD = N 58°30’ E  iv) F.B OF GH = 180°  B.B OF GH = F.B -180°=180°-180°= 0°

Let R be the rectangular window against which the lines are to be clipped using 2D Sutherland-Cohen line clipping algorithm. The rectangular window has lower left-hand corner at (-5,1) and upper righthand corner at (3,7). Consider the following three lines for clipping with the given end point co-ordinates: Line AB: A(-6,2) and B(-1,8) Line CD: C(-1,5) and D(4,8) Line EF: E(-2,3) and F(1,2) Which of the following line(s) is/are candidate for clipping? (A) AB (B) CD (C) EF (D) AB and CD

Description : Let R be the rectangular window against which the lines are to be clipped using 2D Sutherland-Cohen line clipping algorithm. The rectangular window has lower left-hand corner at (-5,1) and upper righthand corner at (3,7). ... s) is/are candidate for clipping? (A) AB (B) CD (C) EF (D) AB and CD

Last Answer : (D) AB and CD

Which of the following gates can be used to realize all possible combinational logic functions?

Description : Which of the following gates can be used to realize all possible combinational logic functions?  (i) OR gate (ii) NOR gate (iii) Exclusive OR gate (iv) NAND gate (v) AND gate  (A) (iii), (iv) and (v)  (B) (i), (iii) and (iv)  (C) (ii) and (iv)  (D) (i) and (v)

Last Answer : Which of the following gates can be used to realize all possible combinational logic functions?  (i) OR gate (ii) NOR gate (iii) Exclusive OR gate (iv) NAND gate (v) AND gate  (A) (iii), (iv) and (v)  (B) (i), (iii) and (iv)  (C) (ii) and (iv)  (D) (i) and (v)

The reverse polish notation equivalent to the infix expression ((A + B) * C + D)/(E + F + G) (A) A B + C * D + EF + G + / (B) A B + C D * + E F + G + / (C) A B + C * D + E F G + +/ (D) A B + C * D + E + F G + /

Description : The reverse polish notation equivalent to the infix expression ((A + B) * C + D)/(E + F + G) (A) A B + C * D + EF + G + / (B) A B + C D * + E F + G + / (C) A B + C * D + E F G + +/ (D) A B + C * D + E + F G + /

Last Answer : (A) A B + C * D + EF + G + /

Convert the following infix expression into its equivalent post fix expression (A + B^ D) / (E – F) + G (A) ABD^ + EF – / G+ (B) ABD + ^EF – / G+ (C) ABD + ^EF / – G+ (D) ABD^ + EF / – G+

Description : Convert the following infix expression into its equivalent post fix expression (A + B^ D) / (E – F) + G (A) ABD^ + EF – / G+ (B) ABD + ^EF – / G+ (C) ABD + ^EF / – G+ (D) ABD^ + EF / – G+

Last Answer : (A + B^ D) / (E – F) + G

Any number with an exponent of one is equal to 128) A) two. B) itself. C) zero. D) on

Description : Any number with an exponent of one is equal to 128) A) two. B) itself. C) zero. D) on

Last Answer : B) itself.

How many different symbols are used in the octal number system? 108) A) ten B) two C) seven D) eight

Description : How many different symbols are used in the octal number system? 108) A) ten B) two C) seven D) eight

Last Answer : D) eight

The base of the octal system is 71) A) eight. B) two. C) ten. D) seven.

Description : The base of the octal system is 71) A) eight. B) two. C) ten. D) seven.

Last Answer : A) eight.

A full adder logic circuit will have (A) Two inputs and one output. (B) Three inputs and three outputs. (C) Two inputs and two outputs. (D) Three inputs and two outputs.

Description : A full adder logic circuit will have (A) Two inputs and one output. (B) Three inputs and three outputs. (C) Two inputs and two outputs. (D) Three inputs and two outputs.

Last Answer : Ans: D A full adder circuit will add two bits and it will also accounts the carry input generated in the previous stage. Thus three inputs and two outputs (Sum and Carry) are there.

Shifting a register content to left by one bit position is equivalent to (A) division by two. (B) addition by two. (C) multiplication by two. (D) subtraction by two

Description : Shifting a register content to left by one bit position is equivalent to (A) division by two. (B) addition by two. (C) multiplication by two. (D) subtraction by two

Last Answer : (C) multiplication by two.

The NOR gate output will be low if the two inputs are (A) 00 (B) 01 (C) 10 (D) 11

Description : The NOR gate output will be low if the two inputs are (A) 00 (B) 01 (C) 10 (D) 11

Last Answer : A

The NAND gate output will be low if the two inputs are (A) 00 (B) 01 (C) 10 (D) 11

Description : The NAND gate output will be low if the two inputs are (A) 00 (B) 01 (C) 10 (D) 11

Last Answer : (D) 11

Define Asynchronous sequential circuit?

Description : Define Asynchronous sequential circuit?

Last Answer : In asynchronous sequential circuits change in input signals can affect memory element at any instant of time.

Define synchronous sequential circuit

Description : Define synchronous sequential circuit

Last Answer : In synchronous sequential circuits, signals can affect the memory elements only at discrete instant of time.

What are the different types of shift type?

Description : What are the different types of shift type?

Last Answer : There are five types. They are, Serial In Serial Out Shift Register Serial In Parallel Out Shift Register Parallel In Serial Out Shift Register Parallel In Parallel Out Shift Register Bidirectional Shift Register

Define shift registers.

Description : Define shift registers.

Last Answer : The binary information in a register can be moved from stage to stage within the register or into or out of the register upon application of clock ... arithmetic and logic operations used in microprocessors. This gives rise to group of registers called shift registers.

Define registers.

Description : Define registers.

Last Answer : A register is a group of flip-flops flip-flop can store one bit information. So an n-bit register has a group of n flip-flops and is capable of storing any binary information/number containing n-bits.

What is a master-slave flip-flop?

Description : What is a master-slave flip-flop?

Last Answer : A master-slave flip-flop consists of two flip-flops where one circuit serves as a master and the other as a slave.

What is edge-triggered flip-flop?

Description : What is edge-triggered flip-flop?

Last Answer : The problem of race around condition can solved by edge triggering flip flop. The term edge triggering means that the flip-flop changes state either at the positive ... negative edge of the clock pulse and it is sensitive to its inputs only at this transition of the clock.

Define race around condition.

Description : Define race around condition.

Last Answer : In JK flip-flop output is fed back to the input. Therefore change in the output results change in the input. Due to this in the positive half of the clock pulse if both J and K are high then output toggles continuously. This condition iscalled ‘race around condition’.

What is the operation of T flip-flop?

Description : What is the operation of T flip-flop?

Last Answer : T flip-flop is also known as Toggle flip-flop. • When T=0 there is no change in the output. • When T=1 the output switch to the complement state (ie) the output toggles.

What is the operation of JK flip-flop?

Description : What is the operation of JK flip-flop?

Last Answer : When K input is low and J input is high the Q output of flip-flop is set. When K input is high and J input is low the Q output of flip-flop is reset. When both the inputs ... are high it is possible to set or reset the flip-flop (ie) the output toggle on the next positive clock edge.