SLST Computer Science and Apllication
1. The advantages of K-map are: It is a method of simplifying the Boolean
expressions and it is ______.
a) systematic, very simple
b) complex, time-consuming
c) manual, error-prone
d) outdated, inefficient
2. The disadvantages of K-map are: It becomes tedious for problems involving
______ variables and also this method cannot be ______.
a) 3 or more, automated
b) 5 or more, programmed
c) 6 or more, simplified
d) 4 or more, verified
3. An n-variable K-map can have ______ cells or squares.
a) n²
b) 2ⁿ
c) n!
d) n × 2
4. Each of the product terms in the standard SOP form is called a ______.
a) maxterm
b) minterm
c) literal
d) implicant
5. Each of the sum terms in the standard POS form is called a ______.
a) minterm
b) maxterm
c) literal
d) subcube
6. A product term that contains all the variables of the function either in
complemented or uncomplemented form is called a ______.
a) maxterm
b) minterm
c) literal
d) don’t care
7. A sum term that contains all the variables of the function either in
complemented or uncomplemented form is called a ______.
a) minterm
b) maxterm
c) implicant
d) subcube
8. The cost of a circuit is measured in terms of ______.
a) number of gates
b) number of gate inputs
SLST Computer Science and Apllication
c) number of outputs
d) number of transistors
9. A ______ minterm is a minterm that is present in the canonical SOP
expression.
a) false
b) true
c) redundant
d) essential
10. A ______ minterm is a minterm that is not present in the canonical SOP
expression.
a) false
b) true
c) redundant
d) essential
11. A standard SOP form can always be converted into a standard POS form by
treating the ______.
a) present minterms as maxterms
b) missing minterms as maxterms
c) don’t care terms as maxterms
d) redundant terms as maxterms
12. A standard POS form can always be converted into a standard SOP form by
treating the ______.
a) present maxterms as minterms
b) missing maxterms as minterms
c) don’t care terms as minterms
d) redundant terms as minterms
13. Two squares on a K-map are said to be adjacent to each other if they are
______.
a) diagonally placed
b) physically adjacent or wrappable
c) in the same row
d) in the same column
14. The binary number designations of the rows and columns of the K-map are in
______.
a) binary code
b) Gray code
c) BCD code
d) Excess-3 code
15. The main criterion in the design of digital circuits is ______.
a) speed
b) power consumption
SLST Computer Science and Apllication
c) reduction of cost
d) number of gates
16. Subcubes in the K-map form either ______ or ______.
a) squares, rectangles
b) circles, triangles
c) lines, dots
d) cubes, spheres
17. A real minimal expression is the minimal of the ______ minimals.
a) SOP only
b) POS only
c) SOP and POS
d) none of the above
18. A 2-square is called ______.
a) a quad
b) an octet
c) a pair
d) a subcube
19. A 4-square is called ______.
a) a pair
b) a quad
c) an octet
d) a subcube
20. An 8-square is called ______.
a) a pair
b) a quad
c) an octet
d) a subcube
21. Two minterms or maxterms can be combined only when they are ______.
a) complementary
b) adjacent
c) identical
d) opposite
22. A 16-square eliminates ______ variables.
a) two
b) three
c) four
d) five
23. Combinations for which the value of an expression is not specified are called
______ combinations.
a) essential
b) don’t care
SLST Computer Science and Apllication
c) redundant
d) false
24. ______ logic is one in which each input signal passes through only two gates
to reach the output.
a) two-level
b) three-level
c) hybrid
d) multi-level
25. ______ logic provides uniform propagation delay between input and output.
a) two-level
b) three-level
c) hybrid
d) multi-level
26. ______ logic is one in which different input signals pass through different
numbers of gates to reach the output.
a) two-level
b) three-level
c) hybrid
d) multi-level
27. The ______ technique is used to reduce a large mapping problem to one that
uses just a small map.
a) variable mapping
b) fixed mapping
c) loop mapping
d) subcube mapping
28. Combining adjacent squares in a K-map containing 1s (or 0s) for the purpose
of simplification of a SOP (or POS) expression is called ______.
a) grouping
b) looping
c) subcubing
d) minimizing
29. The total number of 1s present in a term is called its ______ or ______.
a) index, weight
b) literal, implicant
c) minterm, maxterm
d) cube, subcube
30. Any variable appearing in the expression in complemented or
uncomplemented form is called a ______.
a) minterm
b) maxterm
c) literal
d) implicant
SLST Computer Science and Apllication
31. The advantage of the tabular method is it is ______ and hence ______.
a) manual, slow
b) fully algorithmic, programmable
c) complex, error-prone
d) visual, simple
32. The terms which cannot be combined further in the tabular method are called
______.
a) essential implicants
b) redundant implicants
c) prime implicants
d) selective implicants
33. The implicants which will definitely occur in the final expression are called
______.
a) redundant prime implicants
b) essential prime implicants
c) selective prime implicants
d) false prime implicants
34. The ______ is a pictorial representation of the relationship between the prime
implicants and the minterms of the expression.
a) K-map
b) prime implicant chart
c) subcube diagram
d) truth table
35. All dominating ______ and dominated ______ can be removed while drawing
the reduced prime implicant chart.
a) rows, columns
b) columns, rows
c) minterms, maxterms
d) cubes, subcubes
36. The bunch of 1s on the K-map which form a 2-square, 4-square, etc. is called a
______.
a) minterm
b) subcube
c) literal
d) implicant
37. The prime implicant which contains at least one 1 that cannot be covered by
any other prime implicant is called an ______.
a) redundant prime implicant
b) essential prime implicant
c) selective prime implicant
d) false prime implicant
SLST Computer Science and Apllication
38. The PI whose each 1 is covered by at least one EPI is called a ______.
a) redundant prime implicant
b) essential prime implicant
c) selective prime implicant
d) false prime implicant
39. A PI which is neither an EPI nor an RPI is called a ______.
a) selective prime implicant
b) false prime implicant
c) essential prime implicant
d) redundant prime implicant
40. The PI made of a bunch of 0s is called a ______.
a) essential prime implicant
b) false prime implicant
c) redundant prime implicant
d) selective prime implicant
41. An n variable K-map can have
(a) n² cells
(b) 2ⁿ cells
(c) nⁿ cells
(d) n2ⁿ cells
42. Each term in the standard SOP form is called a
(a) minterm
(b) maxterm
(c) don't care
(d) literal
43. Each term in the standard POS form is called a
(a) minterm
(b) maxterm
(c) don't care
(d) literal
44. The main criterion in the design of a digital circuit is reduction of
(a) cost
(b) size
(c) weight
(d) volume
SLST Computer Science and Apllication
45. The binary number designations of the rows and columns of the K-map are in
(a) binary code
(b) BCD code
(c) Gray code
(d) XS-3 code
46. An 8-square eliminates
(a) 2 variables
(b) 3 variables
(c) 4 variables
(d) 8 variables
47. An 8-square is called
(a) a pair
(b) a quad
(c) an octet
(d) a cube
48. Uniform propagation delay is provided using
(a) two level logic
(b) multilevel logic
(c) hybrid logic
(d) high level logic
49. Any variable appearing in the final expression is called a
(a) literal
(b) a real variable
(c) final variable
(d) variable
50. The total number of 1s present in a term is called the
(a) index
(b) weight
(c) logic level
(d) term number
51. Combining of adjacent squares on a K-map containing 1s (or 0s) for the
purpose of simplification of a SOP (or POS) expression is called
SLST Computer Science and Apllication
(a) looping
(b) squaring
(c) charting
(d) forming
52. The terms which cannot be combined further
(a) implicants in the tabular method are called
(b) prime implicants
(c) essential prime implicants
(d) selective prime implicants
53. The implicants which will definitely occur in the final expression are called
(a) prime implicants
(b) essential prime implicants
(c) selective prime implicants
(d) redundent prime implicants
54. The code used for labeling the cells of a K-map is
(a) 8-4-2-1 binary
(b) hexadecimal
(c) gray
(d) octal
55. The number of cells in a 6 variable K-map is
(a) 6
(b) 12
(c) 36
(d) 64
56. In the Quine-McClusky method of minimization of the function f(A,B,C,D) the
PI corresponding
(a) A'BCD'
(b) BC
(c) B'C'
(d) AB'C'D
57. The Quine-McClusky method of minimization of a logic expression is a
(i) graphical method
SLST Computer Science and Apllication
(ii) algebraic method
(iii) tabular method
(iv) a computer-oriented algorithm
The correct answers are
(a) (iii) and (iv)
(b) (ii) and (iv)
(c) (i) and (iii)
(d) (i) and (ii)
58. In simplification of a Boolean function of n variables, a group of 2ᵐ adjacent 1s
leads to a term with
(a) m - 1 literals less than the total number of variables
(b) m + 1 literals less than the total number of variables
(c) n + m literals
(d) n - m literals
59. The number of adjacent cells each cell in an n variable K-map can have is
(a) n - 1
(b) n
(c) n + 1
(d) 2n
60. A 16-square eliminates
(a) 2 variables
(b) 3 variables
(c) 4 variables
(d) 8 variables
61. In K-map simplification, a group of four adjacent 1s leads to a term with
(a) one literal less than the total number of variables
(b) two literals less than the total number of variables
(c) three literals less than the total number of variables
(d) four literals less than the total number of variables
62. Minimization of logical expressions while designing digital systems helps in
reducing
(a) cost
SLST Computer Science and Apllication
(b) space requirements
(c) power requirements
(d) all of the above
63. The NAND-NAND realization is equivalent to
(a) AND-NOT realization
(b) AND-OR realization
(c) OR-AND realization
(d) NOT-OR realization
64. The NOR-NOR realization is equivalent to
(a) AND-OR realization
(b) NOT-AND realization
(c) OR-NOT realization
(d) OR-AND realization
65. AND-OR realization of a combinational circuit is equivalent to
(a) NAND-NOR realization
(b) NAND-NAND realization
(c) NOR-NOR realization
(d) NOR-NAND realization
66. OR-AND realization of a combinational circuit is equivalent to
(a) NAND-NOR realization
(b) NAND-NAND realization
(c) NOR-NAND realization
(d) NOR-NOR realization
67. For the design of a combinational circuit with four outputs using only NAND
gates, the number of K-maps required for the simplification process is
(a) 0
(b) 1
(c) 2
(d) 4
68. The AND-OR realization of a combinational circuit requires three 3-input
AND gates and one 3-input OR gate. This circuit can be designed using
(a) four input NAND gates only
SLST Computer Science and Apllication
(b) three 3-input OR gates and one 3-input AND gate
(c) three 3-input NAND gates and one 3-input NOR gate
(d) none of the above
69. The Quine-McCluskey algorithm is primarily used for:
(a) Minimizing Boolean expressions with don't care conditions
(b) Converting SOP to POS forms
(c) Designing sequential circuits
(d) Implementing arithmetic operations
70. In a 5-variable K-map, the maximum number of cells that can be grouped
together is:
(a) 8
(b) 16
(c) 32
(d) 64
