Logic Circuit Switching Theory
Logic Circuit Switching Theory
Logic Circuit Switching Theory
Find the two’s complement of the binary number 11011010 38 100110 00100110
These are electronic circuits that operate on one or more input signals to produce an output
signal. Logic gates
It deals with variables that take on two discrete values, and operations that assume logical
meaning. Binary Logic
The ______ of a number system gives the number of symbols used in a system; it is always
expressed in decimal numbers and is indicated by a subscript. Radix
Evaluate the output F3F3 if A=1, B=0, C=0, D=1. Refer to the figure below.
It is a Boolean term composed of one or more literals joined by the AND operation.
Product
How many Boolean functions can we construct with two input variables involved? 16
It states that every algebraic expression that we can logically construct from the postulates
of Boolean algebra are valid even when the operators and identity elements interchange.
Duality Principle
It is part of mathematics that deals with operations involving logical elements, variables and
operators, axioms and postulates.
Boolean Algebra
Logic Circuit & Switching Theory
Which of the following best represents the sum of minterms form of the function f=bd′
+acd′+ab′c+a′c′f=bd′+acd′+ab′c+a′c′? f(a,b,c,d)=∑(0,2,3,4,6,11,12,14)
f(a,b,c,d)=∑(0,1,4,5,6,10,11,12,14)
This is a term in a Boolean expression that is redundant and can be eliminated so that a
simpler expression can be obtained.
Consensus term
He is an English mathematician after whom Boolean algebra was named. George Boole
The 8-bit sum of the signed numbers (-23) and (+11) in two’s complement form is _________.
1111 1101
Simplify the Boolean expression, xy'+y' z'+x'z' to a minimum number of literals. x+y′
x+y′x+y′
Use the complement and DeMorgan’s theorems to express the Boolean function F=xy+x'
y'+y'z with NAND and NOT operations. XY + Y'
Use the complement and DeMorgan’s theorems to express the Boolean function F=xy+x'
y'+y'z with NAND and NOT operations. XY + Y'
Use the complement and DeMorgan’s theorems to express the Boolean function, F=xy+x'
y'+y'z, with OR and NOT operations. XY + Z
B
Evaluate the output F3F3 if A = 1, B = 1, C = 0, D = B
0
Convert the Boolean function described by F(x,y)=∑(1,2,3) to the other canonical form.
F = x+y
Evaluate the output F3F3 if A = 1, B = 1, C = 0, D = B 1
Obtain the simplified Boolean expression for the output FF in terms of the input variables in
the circuit shown below. Give the expression only (no need to include F=F=), and do not
put spaces between the variables and operators. B+C+AC+ABD
TRUE OR FALSE: The number of adjacent squares that can be combined in a K-map must be
a multiple of 2. FLASE
TRUE OR FALSE: When adding negative numbers in two's complement system, signed
overflow occurs when there is a carry into and a carry out of the sign bit. False
Obtain the simplified Boolean expression for the output GG in terms of the input variables
in the circuit shown below. Give the expression only (no need to include G=G=), and do not
put spaces between the variables and operators. BD’+CD’
Which of the following best corresponds to a circuit diagram of a 1:2 demultiplexer? The
demultiplexer accepts one input (IN) and passes this to one of the two outputs (A or B),
depending on the selection (SEL) bit. The truth table is shown below: b
Give the simplified Boolean expression for the outputs of the combinational circuit
described as follows:
The combinational circuit has three inputs (x,y,z) and three outputs (A,B,C). When the binary
input is 0, 1, 2 or 3, the binary output is one greater than the input. For example,
if x=0,y=1,z=1, the output is A=1,B=0,C=0.
When the binary input is 4, 5, 6, or 7, the binary output is two less than the input. For
example, if the binary input is x=1,y=0,z=0, the output is A=0,B=1,C=0.
xz'+w'yz' F=(X'Z')+(Y'Z')+(YX)
It is a product term obtained by combining the maximum possible number of adjacent squares.
Prime implicant
Minterm
It is a table or diagram made up of squares which provides a simple way to minimize Boolean functions.
Karnaugh Mapping
It is a logic circuit consisting of gates whose outputs at any time are a function of the combination of
inputs. Combinational logic circuit
Which of the following is the simplified Sum of Products equivalent of the Boolean function
F(w,x,y,z)=Π(1,3,5,7,13,15) F=wz′+x′z′
Z’+wx’
W’z’ + xz’
It is a logic circuit composed of logic gates and storage elements. Its output is a function of the inputs
and the state of the storage elements. Sequential logic circuit
TRUE OR FALSE: When adding positive numbers in two's complement system, there is no
signed overflow when neither a carry into nor a carry out of the sign bit occurs. True
Logic Circuit & Switching Theory
In a four-variable K-Map, how many adjacent squares will produce a product term with 2
literals? 4
We combine adjacent squares of the K-map that contain zeros to obtain which simplified
form of Boolean function? Product-of-sum form
The following are steps involved in designing combinational circuits except one label
It is a logic circuit composed of logic gates and storage elements. Its output is a function of
the inputs and the state of the storage elements. Sequential logic circuit
It is a digital circuit that takes in 2n input lines and produces aggregated n output lines.
Encoder
TRUE or FALSE: Multiplexers can be used as lookup tables to perform logic functions. True
TRUE or FALSE: One of the underlying causes of delay in circuits includes the time taken by
capacitors in the circuit to charge and discharge. False
What is the output of an encoder when two of its inputs are active simultaneously?
Undefined
This combinational circuit chooses an output from among several possible inputs based on
the value of the select signal. Multiplexer
TRUE or FALSE: The critical path is the shortest and fastest path from a circuit's input to its
output. False
It is the minimum time from when an input changes until any output starts to change its
value.
Contamination delay
In timing logic circuits, the transition from LOW signal to HIGH signal is called _________.
Rising edge
Select the minimized Boolean equation that best corresponds to the function performed by
the circuit shown below:
Logic Circuit & Switching Theory
A
TRUE or FALSE: A single input transition will never cause more than a single output
transition. FALSE
TRUE OR FALSE: One way to eliminate glitches is to introduce redundant implicants. True
It is the maximum time from when the input changes until the output reaches its final value.
Propagation delay
Select the minimized Boolean equation that best corresponds to the function performed by the circuit
shown below:
Select one:
a. Y=AC⊕D’
b. Y=A+C′D+CD′
Logic Circuit & Switching Theory
c. Y=A+(C′+D)′
d. Y=A+(C⊕D)′
e. A⊕CD
Select one:
b. Tristate buffers
c. SOP logic
d. Smaller multiplexers
Select one:
True
False
A four-bit priority encoder has its inputs specified below. In the figure, D0 has the lowest priority while
D3 has the highest priority.
What Boolean equations describe the outputs xx and yy if we give D0 the highest priority, and D3 the
lowest priority?
y= Answer 1
Choose...
Logic Circuit & Switching Theory
D0'D1+D0'D2'
D2+D3
D3+D1D2'
D0'D1'
Answer 2
Choose...
x= D0'D1+D0'D2'
D2+D3
D3+D1D2'
D0'D1'
TRUE or FALSE: The critical path is the shortest and fastest path from a circuit's input to its output.
Select one:
True
False
What is the output of an encoder when two of its inputs are active simultaneously?
Select one:
a. It has no output.
b. Undefined
c. 0
d. 1
Truth table
AA BB CC YY
0 0 0 0
0 0 1 0
0 1 0 1
0 1 1 1
1 0 0 0
1 0 1 0
1 1 0 1
1 1 1 1
In timing logic circuits, the transition from LOW signal to HIGH signal is called _________.
Select one:
a. Rising edge
b. Transient response
c. 50% point
d. Falling edge
Select one:
a. Y=C′+AB
b. Y=A+BC′
c. Y=B+A′C′
d. Y=A+B+C′
Logic Circuit & Switching Theory
Which of the following diagrams will match the output given in the truth table below?
A
B C Y
0 0 0 1
0 0 1 0
0 1 0 0
0 1 1 0
1 0 0 0
1 0 1 0
1 1 0 0
1 1 1 1
Select one:
a.
b.
c.
d.
Logic Circuit & Switching Theory
Determine the contamination delay, in ps, of the circuit. Use the delays given in the table below. Write
the number only
Answer:130
TRUE or FALSE: A single input transition will never cause more than a single output transition.
Select one:
True
False
TRUE or FALSE: One of the underlying causes of delay in circuits includes the time taken by capacitors in
the circuit to charge and discharge.
Logic Circuit & Switching Theory
Select one:
True
False
It is the minimum time from when an input changes until any output starts to change its value.
Select one:
a. Propagation delay
b. Contamination delay
c. Glitch
d. Transient response
Select the minimized Boolean equation that best corresponds to the function performed by the circuit
shown below:
Select one:
a. Y=AB′+A′C′+BC′
b. Y=AB′C′D+C′D′+A′B
c. Y=ABC′+AC′D+B′C′
d. Y=A′C′D′+B′C′D′+A′B′
Truth Table
AA BB CC YY
0 0 0 1
0 0 1 1
0 1 0 1
Logic Circuit & Switching Theory
0 1 1 1
0
1 0 1
1 0 1 1
1 1 0 0
1 1 1 1
Which of the following best describes the simplified form of the Boolean function above?
Determine the Boolean functions that best correspond to outputs of a four-bit 2's complementer circuit.
The 2's complementer circuit is described as follows:
Answer 1
z=z= Choose...
A'
Answer 2
x=x= Choose...
B XOR (C+D)
Answer 3
y=y= Choose...
C XOR D
Answer 4
w=w= Choose...
A(B XOR C XOR D)
It is a digital circuit that takes in 2n2n input lines and produces aggregated nn output lines.
Select one:
a. Encoder
b. Demultiplexer
c. Multiplexer
d. Decoder
Logic Circuit & Switching Theory
Determine the propagation delay, in ps, of the circuit. Use the delays given in the table below. Write the
number only.
Answer:25
Which of the following is the Boolean function that correspond to the truth table?
A majority circuits is a combinational circuits whose output is equal to 1 if the input variable
have more than 1’s than 0’s C
Logic Circuit & Switching Theory