CEA 201 - Unit 11
T
"Don't care" conditions are when certain combinations of values of variables never occur, and therefore the corresponding output never occurs. (T/F)
F
A Boolean function can be realized in the sum of products (SOP) form but not in the product of sums (POS) form. (T/F)
A
A _______ is an electronic circuit that produces an output signal that is a simple Boolean operation on its input signals. A. gate B. decoder C. counter D. flip-flop
B
A _________ accepts and/or transfers information serially. A. S-R latch B. shift register C. FPGA D. parallel register
B
A _________ is a PLD featuring a general structure that allows very high logic capacity and offers more narrow logic resources and a higher ration of flip-flops to logic resources than do CPLDs. A. SPLD B. FPGA C. PAL D. PLA
T
A combinational circuit consists of n binary inputs and m binary outputs. (T/F)
T
A register is a digital circuit used within the CPU to store one or more bits of data. (T/F)
T
Any Boolean function can be implemented in electronic form as a network of gates. (T/F)
F
Binary addition is exactly the same as Boolean algebra. (T/F)
A
CPUs make use of _________ counters, in which all of the flip-flops of the counter change at the same time. A. synchronous B. asynchronous C. clocked S-R D. timed ripple
F
Claude Shannon, a research assistant in the Electrical Engineering Department at M.I.T., proposed the basic principles of Boolean algebra. (T/F)
T
Combinational circuits are often referred to as "memoryless" circuits because their output depends only on their current input and no history of prior inputs is retained. (T/F)
C
Counters can be designated as _________. A. asynchronous B. synchronous C. both asynchronous and synchronous D. neither asynchronous or synchronous
T
Events in the digital computer are synchronized to a clock pulse so that changes occur only when a clock pulse occurs. (T/F)
B
For more than four variables an alternative approach is a tabular technique referred to as the _________ method. A. DeMorgan B. Quine-McCluskey C. Karnaugh map D. Boole-Shannon
T
In general, a decoder has n inputs and 2^n outputs. (T/F)
T
In the absence of parentheses, the AND operation takes precedence over the OR operation. (T/F)
F
Logical functions are implemented by the interconnection of decoders. (T/F)
D
The ________ exists in one of two states and, in the absence of input, remains in that state. A. assert B. complex PLD C. decoder D. flip-flop
A
The ________ flip-flop has two inputs and all possible combinations of input values are valid. A. J-K B. D C. S-R D. clocked S-R
A
The _________ table provides the value of the next output when the inputs and the present output are known, which is exactly the information needed to design the counter or any sequential circuit. A. excitation B. Kenough C. J-K flip-flop D. FPGA
T
The delay by the propagation time of signals through the gate is known as the gate delay. (T/F)
C
The operand ________ yields true if and only if both of its operands are true. A. XOR B. OR C. AND D. NOT
D
The operation _________ yields true if either or both of its operands are true. A. NOT B. AND C. NAND D. OR
T
The operation of the digital computer is based on the storage and processing of binary data. (T/F)
B
The unary operation _________ inverts the value of its operand. A. OR B. NOT C. NAND D. XOR
T
The value to be loaded into the program counter can come from a binary counter, the instruction register, or the output of the ALU. (T/F)
D
Which of the following is a functionally complete set? A. AND, NOT B. NOR C. AND, OR, NOT D. all of the above
A
________ are used in digital circuits to control signal and data routing. A. Multiplexers B. Program counters C. Flip-flops D. Gates
C
________ is implemented with combinational circuits. A. Nano memory B. Random access memory C. Read only memory D. No memory
