Question
a.
A1B1
b.
A0B1
c.
B0B1
d.
B1B0
Posted under Computer Architecture
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. In the truth table formation, inputs are taken as A1A0 for A input and __________for B input.
Similar Questions
Discover Related MCQs
Q. The Boolean expression for the output F1 will be F1 = x. y. z′. This is ___________form.
View solution
Q. For a function F, the complement of this function F′ is obtained by interchanging 1 with
View solution
Q. A variable on its own or in its complemented form is known as a________________.
View solution
Q. It is a single literal or a logical product (AND) of several literals.
View solution
Q. A Karnaugh map (K-map) is an abstract form of ____________ diagram, organized as a matrix of squares,
View solution
Q. There are _____________ Minterms for 3 variables (a, b, c).
View solution
Q. There are ______ cells in a 4-variable K-map.
View solution
Q. The K-map based Boolean reduction is based on the following Unifying Theorem:
A + A′ = 1
View solution
Q. Each product term of a group, w′.x.y′ and w.y, represents the ____________ in that group.
View solution
Q. The prime implicant, which has at least one element that is not present in any other implicant, is known as________________________.
View solution
Q. Product-of-Sums expressions can be implemented using
View solution
Q. Each group of adjacent Minterms (group size in powers of twos) corresponds to a possible product term of the given_____________________.
View solution
Q. How to find the Simplest SOP expression?
View solution
Q. Don’t care conditions can be used for simplifying Boolean expressions in_______________.
View solution
Q. It should be kept in mind that don’t care terms should be used along with the terms that are present in________________.
View solution
Q. _____________ expressions can be implemented using either (1) 2-level AND-OR logic circuits or (2) 2-level NAND logic circuits.
View solution
Q. Using the transformation method, you can realize any POS realization of OR-AND with only
View solution
Q. There are many situations in logic design in which simplification of logic expression is possible in terms of XOR and _________________ operations.
View solution
Q. Logic gates are widely used in _______________ design, and therefore are available in IC form.
View solution
Q. In case of XOR/XNOR simplification, you have to look for the following
View solution
Suggested Topics
Are you eager to expand your knowledge beyond Computer Architecture? We've curated a selection of related categories that you might find intriguing.
Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!
