# MCQs on Digital Electronics

##### Page 16 of 35. Go to page 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35
01․ An n variable K-map can have
n2 cells
2n cells
nn cells
n2n cells

K-maps are ways of minimizing the Boolean functions using diagrams which are made up of squares. By minimization we imply a function with minimum number of terms and each term with lowest number of literals. Anytime you have n variables, you will have 2n cells possible combinations, and 2n cells placed in a truth table or Karnaugh Map.

02․ An n variable K-map can have
n2 cells
2n cells
nn cells
n2n cells

K-maps are ways of minimizing the Boolean functions using diagrams which are made up of squares. By minimization we imply a function with minimum number of terms and each term with lowest number of literals. Anytime you have n variables, you will have 2n cells possible combinations, and 2n cells placed in a truth table or Karnaugh Map.

03․ Each term in the standard SOP form is called a
minterm
maxterm
don’t care
literal

The term "standard" here means that the expression consists exclusively of minterms (in the case of Standard SOP) or maxterms (in the case of Standard POS). As we can see, the names are quite descriptive, the SOP form takes on the appearance of being a sum of several terms, each of which is the product of several factors while the POS form takes on the appearance of being a product of several factors, each of which is the sum of several terms.

04․ Each term in the standard POS form is called a
minterm
maxterm
don’t care
literal

The term "standard" here means that the expression consists exclusively of minterms (in the case of Standard SOP) or maxterms (in the case of Standard POS). A maxterm is a Boolean expression resulting in a '0' for the output of a single cell expression, and 1's for all other cells in the Karnaugh map, or truth table.

05․ The main criterion in the design of a digital circuit is reduction of
cost
size
weight
volume

The problem with having a complicated circuit (i.e. one with many elements, such as logical gates) is that each element takes more physical space in its implementation and cost is also more. Circuit minimization may be one form of logic optimization used to reduce the area of complex logic in integrated circuits.

06․ The binary number designations of the rows and columns of the K-map are in
binary code
BCD code
Gray code
XS-3 code

The sequence used in k map is not in binary sequence which would be 00, 01, 10, 11. It is 00, 01, 11 10, which is Gray code sequence. Gray code sequence only changes one binary bit as we go from one number to the next in the sequence, unlike binary. That means that adjacent cells will only vary by one bit, or Boolean variable. This is what we need to organize the outputs of a logic function so that we may view commonality. Moreover, the column and row headings must be in Gray code order, or the map will not work as a Karnaugh map.

07․ An 8-square eliminates
2 variables
3 variables
4 variables
8 variables

K- map is a graphical representation and can be used to minimize the logical expression with 'o', '1' and don't care. In k- map, Group of 8 cells is called as octet, it will eliminates 3 variables in given expression. (23 = 8) Similarly , group of 4 cells is called as quad, it will eliminates 2 variables and group of 2 cells is called as pair, it will eliminates 1 variable.

08․ An 8-square is called
a pair
an octet
a cube

K- map is a graphical representation and can be used to minimize the logical expression with 'o', '1' and don't care. In k- map, group of 8 cells is called as octet, it will eliminates 3 variables in given expression. (23 = 8)

09․ The terms which cannot be combined further in the tabular method are called
implicants
prime implicants
essential prime implicants
selective prime implicants

In logical expression, each minterm is known as implicant. Prime implicant is a product term obtained from maximum possible combination of cells in k-map. Essential prime implicant is a prime implicant which is possible to combine only one way and there is no alternative. Essential prime implicant is compulsory term in final expression and it should not be redundant or alternative also.

10․ The implicants which will definitely occur in the final expression are called
prime implicants
essential prime implicants
selective prime implicants
redundent prime implicants

In logical expression, each minterm is known as implicant. Prime implicant is a product term obtained from maximum possible combination of cells in k-map. Essential prime implicant is a prime implicant which is possible to combine only one way and there is no alternative. Essential prime implicant is compulsory term in final expression and it should not be redundant or alternative also.

<<<1415161718>>>