final
Find the reduced POS equation for the Boolean function given below through the use of a K-map: F(A,B,C,D) = ∑∑ m(0, 1,2, 3, 7, 9, 11, 15)
(B'+C) (B' + D) (A' + D)
The binary number below is written using 2's complement notation. What decimal number does it represent? 10011011
-101
What do you get if your perform a logical shift right on the following bits? 11001010
01100101
Given the Boolean function below, how many 1's are in the truth table for this function? F(A,B,C,D) = A'C' +A'BD + AD' +ABC'
10
10011 - 1111 is what?
100
Let A = 10100011 and let B (the control) = 00001111. What is the result of the selective-clear operation on A and B?
10100000
The sum of the two binary numbers 11001 and 10111 is what?
110000
Convert the decimal number 399 to binary.
110001111
The hexadecimal number 73A (base 16) represents what decimal number (base 10)?
1850
How many different symbols do we have that represents the two-input NAND gate?
2
An 8x3 encoder has how many output lines?
3
For an 8x3 encoder, suppose there is a "high" on input line number 5. What binary number (in decimal form) is on the output lines?
5
Which chips did we use in Lab #7? Select all that apply.
7483 7495 74157
Which of the following statements are TRUE about a microoperation? Select all that apply.
A fundamental operation on data stored in registers Data transfer from one register to another is one category of microoperations Subtraction may be a microoperation Performed in one clock pulse
Find the reduced SOP equation for the Boolean function given below through the use of a K-map: F(A,B,C,D) = ∑∑ m(0, 1,2, 3, 7, 9, 11, 15)
A'B' +CD +B'D
Which of the following are registers in the Basic Computer? Select all that apply
AC IR TR DR
Which of the following gates produces just a single high output over all the possible inputs?
AND NOR
Given Figure 4-13, what operation is sent out on Fii output line: S33 = 0 S22 = 0 S11 = 0 S00 = 0 C00 = 0
Addition
Given Figure 4-9, determine what operation is performed on inputs A and B given the following values: s11 = 0 s00 = 0 cinin = 0
Addition
Find the reduced SOP equation for the Boolean function given below. Use K-maps to reduce. F(A,B,C,D) = ∑∑ m(0, 2, 4, 5, 6, 8, 12, 14, 15) d(A,B,C,D) = ∑∑ m(7, 10, 13)
B + D'
Which machine instruction on our Basic Computer is used for branching to a subroutine?
BSA
Which of the following statements are TRUE about a 4k x 8 RAM chip? Select all that apply.
Chip contains 4096 words There are 8 data input lines One word of data at a time can be written to the chip
Given Figure 4-9, determine what operation is performed on inputs A and B given the following values: s11 = 1 s00 = 1 cinin = 0
Decrement
Which of the following are addressing modes on the Basic Computer? Select all that apply
Direct Indirect
The octal number 347 (base 8) is what number written in hexadecimal notation?
E7
What binary circuit did you build in Lab #3?
Even parity generator for a 3-bit word
(AB + C) ( B + C'D) is in SOP form
False
A 1x8 Demultiplexer has two select lines.
False
A JK flip-flop can be easily converted to a D flip=flop by tying the J and K inputs directly to each other.
False
A clocked SR latch changes state on the falling edge of the clock.
False
A combinational circuit can be described by a truth table with n-input columns and one output column.
False
A combinational circuit is a logical circuit with n-inputs and exactly one output.
False
A master-slave SR flip-flop changes state on the rising edge of the clock.
False
A single flip-flop is capable of storing 4 bits of data at any given time.
False
An arithmetic right-shift can product overflow.
False
An arithmetic shift right corresponds to a multiplication by 2
False
Both the half-adder and the full-adder circuits have three output lines.
False
DeMorgan's Law states the following: (AB)' = A'B' and (A+B)' = A'+B
False
For TTL chips, power is typically applied to pin 7 and ground is applied to pin 14.
False
For the SR flip-flop, if S=1 and R=0, then this flip-flop will be cleared at the next clock pulse.
False
High and low in TTL chips are represented by different current levels.
False
If we perform a circular left shift on: 00101110 , the result is 01011101
False
If we perform an arithmetic right shift on: 10001101, the result is: 01000110
False
In Lab #1, we discovered that a disconnected input is treated as a low.
False
In Lab #4, you built a 3-bit binary counter that counts up as long a the external input y is 1. When y = 0, the counter remains in its current state.
False
In Lab 6, we added two 4-bit numbers using the 7495 adder chip.
False
In Lab 7, we implemented the microoperation: A ⟵⟵ A + B using only the following chips: 7495 7483
False
In the following microoperation: p + q : R1 ⟵⟵ R2 + R3, R4 ⟵⟵ R5 ∨∨ R6 The "+" to the left of ":" stands for addition and the "∨∨" stands for logical AND
False
Let F(A,B,C) = A'B'C' + AB'C' + A'BC' + ABC' Using Boolean algebra rules, F(A,B,C,D) can be reduced to the simplest form below: F(A,B,C) = BC'
False
Our Basic Computer has five types of machine instructions
False
Recursive subroutines are supported on the Basic Computer
False
Suppose the circuit of Figure 4-7 has the following input values. M = 0 A = 0110 B = 0011 then the outputs are as follows: S = 1001 C44 = 1
False
The 2716 EPROM chip can be erased without taking the chip off the motherboard.
False
The big difference between a RAM chip and a ROM chip is that you can write to a ROM chip but not to a RAM chip.
False
The design process for a sequential circuit is a 4-step process that involves the following steps in the order shown: 1. Draw state diagram 2. Develop the K-maps 3. Generate the transition table 4. Draw the sequential circuit
False
The excitation table for the JK flip-flop is as follows:
False
The following Boolean function is in normal form: F(A,B,C) = A'BC + AB + AB'C'
False
The program counter (PC) register in our Basic Computer is 16 bits in length and hold the address of the next instruction to be executed
False
We use the NOR gate exclusively to implement a reduced SOP Boolean equation
False
When a key on the keyboard of our Basic Computer is pressed, an interrupt cycle will always take place.
False
Which of the following are examples of a combinational circuit? Select all that apply.
Half adder Full adder Decoder Mux
What special properties of the Exclusive-OR gate did we discuss that allows us to build an adder-subtractor circuit ? Select all that apply.
If one input is zero, the exclusive-OR gate passes the other input through If one input is one, the exclusive OR gate inverts the other input
If a 2x4 decoder is enabled and has a decimal 2 on its input lines, then which output line goes high?
Line 2
We can connect 8 registers, each register of which has 16 bits, to a common data bus as follows. Select all statements that are TRUE
May use multiplexeers May use tri-state buffer gates Would need 8 tri-state buffer gates for each data bus line
What fundamental gate is assigned the lowest number in the TTL family of chips?
NAND
What fundamental gate is represented by the following truth table: A B F 0 0 1 0 1 1 1 0 1 1 1 0
NAND
Which fundamental gates are represented by two different symbols?
NAND NOR
The bidirectional shift register with parallel load (figure 2-9) has which of the following capabilities? Select all that apply.
Shift down Shift up Load new bits into register Keep same value
In a right arithmetic shift, what happens to the high-order bit?
Stays the same as before the shift
Given Figure 4-9, determine what operation is performed on inputs A and B given the following values: s11 = 0 s00 = 1 cinin = 1
Subtraction
A 4x1 Multiplexer connects one of it's four input lines to the output line.
True
A decoder is the inverse of an encoder.
True
A sequential circuit is a combinational circuit that contains one or more flip-flops.
True
A two-input AND gate may be built from multiple NAND gates.
True
A two-input NOR gate may be used as a one-input inverter
True
All flip-flops require a clock input in order to operate.
True
An 8x3 encoder and a 3x8 decoder are considered to be inverses of each other.
True
An arithmetic left-shift can produce overflow.
True
Each Assembly Language instruction for a particular CPU is made up of one or more microoperations
True
If we build a sequential circuit that counts: 0, 1, 3, 4, 5, 7,... and then repeats, we will obtain the following equations: J(C) = B K(C) = B J(B) = A K(B) = 1 J(A) = 1 K(A) = B
True
In Boolean algebra, X + X = X
True
In Lab #5, you built a clocked SR latch.
True
It is possible to design a sequential circuit that goes through the count sequence: 1, 5, 3, 7, and then repeats
True
Minterm and Maxterm notation are two shorthand notations we use to represent a Boolean function
True
Our first register we considered (Figure 2-6) has no way to control when a value is loaded into the register.
True
Suppose the circuit of Figure 4-7 has the following input values. M = 1 A = 0110 B = 0011 then the outputs are as follows: S = 0011 C44 = 1
True
The Boolean function F(A,B,C) = ∑∑ m(0, 1, 5, 6) may be implemented using a 8x1 or a 4x1 Mux.
True
The following statement may be implemented as a microoperation: R1 ⟵⟵ R1 + R2
True
The full-adder circuit adds three binary bits together.
True
The half-adder circuit adds two binary bits together.
True
The logical unit we designed performs four logical operations.
True
The notation: R1 ⟵⟵ R2, R2 ⟵⟵ R1 indicates that Registers 1 and 2 swap their contents in one clock pulse
True
The output from a data bus created using MUXes can be loaded into multiple registers
True
The purpose of the MUXes in Lab #7 is to select where the value to be loaded into Register A comes from
True
The state diagram of a sequential circuit shows what states the circuit goes through as well as the order in which the states occur.
True
There is a pattern in the count sequence of a 3-bit count-up counter that makes the design of this circuit easy. So easy, in fact, that you don't have to go through the four step design process.
True
We have several ways to represent a Binary circuit. Which of the following are unique?
Truth Table Minterm notation Maxterm notation
When an interrupt cycle occurs, where is the return address stored?
Word 0
The truth table below represents what fundamental gate? A B F 0 0 0 0 1 1 1 0 1 1 1 0
exclusive OR
What Boolean function did we construct in Lab 2?
exclusive OR