adplus-dvertising
frame-decoration

Question

In OR gate for 13 numbers of inputs what are the stages possible for it?

a.

1239

b.

213

c.

13

d.

1387

Posted under Discrete Mathematics

Answer: (b).213

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. In OR gate for 13 numbers of inputs what are the stages possible for it?

Similar Questions

Discover Related MCQs

Q. Which of the following is built exclusively from NOR gate?

Q. Which of the following gates is used to implement a logical conditional?

Q. What is the maximum number of prime implicants with 34-variable minimized expression?

Q. How many cells are there for an 8-variable K-Map?

Q. Determine the number of essential prime implicants of the function f(a, b, c, d) = Σm(1, 3, 4, 8, 10, 13) + d(2, 5, 7, 12), where m denote the minterm and d denotes the don’t care condition.

Q. How many number of prime implicants are there in the expression F(x, y, z) = y’z’ + xy + x’z.

Q. f(x, y, z) = xy’+yz’+xyz, what are essential prime implicants of this switching function?

Q. How many essential prime implicants are there in the K-Map of the function F = Σ(0, 1, 2, 4, 7, 11, 12, 13, 15)?

Q. Determine the number of prime implicants of the following function F?

F(a, b, c, d) = Σm(1, 3, 7, 9, 10, 11, 13, 15)

Q. For an 18-variable k-map determine the number of prime implicants?

Q. How many false essential prime implicants for the given Boolean functions f(A, B, C) = ∑m(2, 5, 6)?

Q. How many minimal forms are there in the function F(A, B, C) = ∑(1, 3, 2, 5, 6, 7) if it is having cyclic prime implicants k-map?

Q. How many states are there in combinatorial FSM?

Q. Which of the following algorithms transforms any NFA into its identical DFA?

Q. Which of the following is not a member of the set of a deterministic finite state machine?

Q. In system engineering which of the following methods bridges the gap between the two ends of system development?

Q. Optimisation of an FSM machine can be done by ________

Q. A deterministic automaton system can have ______ transition for a given state of an input symbol.

Q. Which of the following techniques refer to the equivalence of DFA and N-DFA automata?

Q. Equivalence of automata states that ____________