• Home
  • Textbooks
  • Electrical Engineering: Principles and Applications
  • Logic Circuits

Electrical Engineering: Principles and Applications

Allan R. Hambley

Chapter 7

Logic Circuits - all with Video Answers

Educators


Chapter Questions

05:40

Problem 1

State three advantages of digital technology compared with analog technology.

Linda Winkler
Linda Winkler
Numerade Educator
01:59

Problem 2

Define these terms: bit, byte, and nibble.

M Hassan Anwar
M Hassan Anwar
Numerade Educator
01:57

Problem 3

Explain the difference between positive logic and negative logic.

M Hassan Anwar
M Hassan Anwar
Numerade Educator
02:47

Problem 4

What are noise margins? Why are they important?

M Hassan Anwar
M Hassan Anwar
Numerade Educator
01:31

Problem 5

How is serial transmission of a digital word different from parallel transmission?

Kamila Zakarian
Kamila Zakarian
Numerade Educator
02:36

Problem 6

Convert the following binary numbers to decimal form: $a. ^{*}101.101 ; b .0111 .11 ; c .1010 .01$
d. $111.111: e .1000 .0101 ; f^{*} 10101.011$.

PK
Plamen Kamenov
Numerade Educator
02:36

Problem 7

Express the following decimal numbers in binary form and in binary-coded-decimal form: a $17 ;$ b. $8.5 ; c ^{*}9.75 ;$ d. $73.03125$ $e .67 .375$.

PK
Plamen Kamenov
Numerade Educator
01:21

Problem 8

How many bits per word are needed to rep resent the decimal integers 0 through $100 ? 0$ through $1000 ? 0$ through $10^{6} ?$

Clarissa Noh
Clarissa Noh
Numerade Educator
02:36

Problem 9

Add these pairs of binary numbers : a. $^{*}1101.11$ and $101.111;$ b. $1011$ and $101;$ c $10001.111$ and $0101.001$

PK
Plamen Kamenov
Numerade Educator
01:52

Problem 10

Find the result (in BCD format) of adding the $\mathrm{B C D}$ numbers. a.$^{*} 10010011.0101$ and $00110111.0001;$ b. $01011000.1000$ and $10001001.1001$.

Nick Johnson
Nick Johnson
Numerade Educator
View

Problem 11

Express the following decimal numbers in binary, octal, and hexadecimal forms: a. $173$ b. $299.5: \mathrm{c} .735 .75: \mathrm{d} .^{*} 313.0625: \mathrm{e} .112 .25$.

Mir  Afzal
Mir Afzal
Numerade Educator
01:35

Problem 12

Write each of the following decimal numbers as an eight-bit signed two's-complement number: a $.19 ; \mathbf{b} .-19: \mathbf{c}^{*} 75 ; \mathbf{d} .^{*}-87 ; \mathbf{e} .-95;$ $\mathbf{f}. 99$

Nick Johnson
Nick Johnson
Numerade Educator
01:52

Problem 13

Express each of the following hexadecimal numbers in binary, octal, and decimal forms
a. FA.F $_{16}$; b. $2 \mathrm{A} .1_{16}$; $\mathrm{c} .777 .7_{16}$

Nick Johnson
Nick Johnson
Numerade Educator
12:17

Problem 14

Express each of the following octal numbers in binary, hexadecimal, and decimal forms: a. $777.78: \mathbf{b} .123 .5_{8}: \mathbf{c} .24 .4_{8}$

Ahmad Reda
Ahmad Reda
Numerade Educator
02:12

Problem 15

What number follows 777 when counting in a. decimal; b. octal; c. hexadecimal?

Aaron Goree
Aaron Goree
Numerade Educator
02:12

Problem 16

What range of decimal integers can be represented by a. three-bit binary numbers, b. three-digit octal numbers; c. three-digit hexadecimal numbers?

Aaron Goree
Aaron Goree
Numerade Educator
00:49

Problem 17

Starting with the three-bit Gray code listed in Figure $7.9,$ construct a four-bit Gray code. For what applications is a Gray code advantageous? Why?

James Kiss
James Kiss
Numerade Educator
01:37

Problem 18

Convert the following numbers to decimal form: Convert the following numbers to decimal form: a. $^{*}FA5.6$ $_{16}:$ b. $^{*} 725.3_{8} ;$ c. $3 \mathrm{F} 4.8_{16}$ d. $73.25_{8} ;$ e$\mathrm{FF} \cdot \mathrm{F} 0_{16}$.

Brooke Bussoletti
Brooke Bussoletti
Numerade Educator
01:52

Problem 19

Find the one's and two's complements of the binary numbers: a. $^{*}11101000 ;$ b. $00000000$
c. $10101010 ;$ d. $11111100 ;$ e. $11000000$.

Nick Johnson
Nick Johnson
Numerade Educator
01:35

Problem 20

Perform these operations by using 8 bit signed two's-complement arithmetic $$\text { a. } 17_{10}+15_{10} ; \text { b. } 17_{10}-15_{10}: c_{4}^{*} 33_{10}-37_{10}$$ d. $15_{10}-63_{10}:$ e $49_{10}-44_{10}$

Nick Johnson
Nick Johnson
Numerade Educator
03:20

Problem 21

Describe how to test whether overflow or underflow has occurred in adding signed two's-complement numbers

Prathan Jarupoonphol
Prathan Jarupoonphol
Numerade Educator
01:35

Problem 22

What is a truth table?

M Hassan Anwar
M Hassan Anwar
Numerade Educator
01:08

Problem 23

State De Morgan's laws.

Mayukh Banik
Mayukh Banik
Numerade Educator
04:56

Problem 24

Draw the circuit symbol and list the truth table for the following: an AND gate, an OR gate, an inverter, a NAND gate, a NOR gate, and an $\mathrm{XOR}$ gate. Assume two inputs for each gate (except the inverter).

M Hassan Anwar
M Hassan Anwar
Numerade Educator
01:49

Problem 25

Describe a method for proving the validity of a Boolean algebra identity.

M Hassan Anwar
M Hassan Anwar
Numerade Educator
01:39

Problem 26

Write the truth table for each of these Boolean expressions:
a. $D=A B C+A \bar{B}$
b. $^{\prime} E=A B+A \bar{B} C+\bar{C} D$
c. $Z=W X+\overline{(W+Y)}$
d. $D=A+\bar{A} B+C$
e. $D=\overline{(A+B C)}$

Manik Pulyani
Manik Pulyani
Numerade Educator
02:11

Problem 27

Write a Boolean expression for the output of each of the logic circuits shown in Figure $\mathrm{P} 7.27$.

Adriano Chikande
Adriano Chikande
Numerade Educator
04:36

Problem 28

Use a truth table to prove the identity
$$(A+B)(A+C)=A+B C$$

M Hassan Anwar
M Hassan Anwar
Numerade Educator
03:27

Problem 29

Use a truth table to prove the identity $$(A+B)(\bar{A}+A B)=B$$

M Hassan Anwar
M Hassan Anwar
Numerade Educator
02:40

Problem 30

Use a truth table to prove the identity $$A+\bar{A} B=A+B$$

M Hassan Anwar
M Hassan Anwar
Numerade Educator
04:36

Problem 31

Use a truth table to prove the identity $$A B C+A B \bar{C}+A \bar{B} \bar{C}+A \bar{B} C=A$$

M Hassan Anwar
M Hassan Anwar
Numerade Educator
06:48

Problem 32

Draw a circuit to realize each of the following expressions using AND gates, OR gates, and inverters:
a. $F=A+\bar{B} C$
b. $F=A \overline{B C}+A B \bar{C}+\bar{A} B C$
c. $\begin{aligned}c^{*} F=&(\bar{A}+\bar{B}+C)(A+B+\bar{C}) \\ &(A+\bar{B}+C) \end{aligned}$

M Hassan Anwar
M Hassan Anwar
Numerade Educator
01:49

Problem 33

Replace the AND operations by ORs and vice versa by applying De Morgan's laws to each of these expressions:
a. $F=A B+(\bar{C}+A) \bar{D}$
b. $F=A(\bar{B}+C)+D$
c. $F=A \bar{B} C+A(B+C)$
d. $\begin{aligned} ^{*}F=&(A+B+C)(A+\bar{B}+C) \\ &(\bar{A}+B+\bar{C}) \end{aligned}$
e. $^{*}F=A B C+A B C+\overline{A B C}$

Mirza  Aslam Beig
Mirza Aslam Beig
Numerade Educator
01:43

Problem 34

Why are NAND gates said to be sufficient for combinatorial logic? What other type of gate is sufficient?

Varsha Aggarwal
Varsha Aggarwal
Numerade Educator
01:18

Problem 35

Consider the circuit shown in Figure $\mathrm{P} 7.35$ The switches are controlled by logic variables such that, if $A$ is high, switch $A$ is closed, and if $A$ is low, switch $A$ is open. Conversely, if $B$ is high, the switch labeled $\bar{B}$ is open. and if $B$ is low, the switch labeled $\bar{B}$ is closed. The output variable is high if the output voltage is $5 \mathrm{V}$, and the output variable is low if the output voltage is zero. Write a logic expression for the output variable. Construct the truth table for the circuit.

Adriano Chikande
Adriano Chikande
Numerade Educator
05:06

Problem 36

Repeat Problem P7.35 for the circuit shown in Figure $P 7.36$

Amit Srivastava
Amit Srivastava
Numerade Educator
01:31

Problem 37

Sometimes "bubbles" are used to indicate inverters on the input lines to a gate. as illustrated in Figure $\mathrm{P} 7.37 .$ What are the equivalent gates for those of Figure $\mathrm{P} 7.37$ ? Justify your answers

Varsha Aggarwal
Varsha Aggarwal
Numerade Educator
01:03

Problem 38

Using the SOP approach, describe the synthesis of a logic expression from a truth table Repeat for the POS approach

Carson Merrill
Carson Merrill
Numerade Educator
02:43

Problem 39

Give an example of a decoder.

M Hassan Anwar
M Hassan Anwar
Numerade Educator
03:01

Problem 40

Consider Table $\mathrm{P} 7.40 .4, B,$ and $C$ represent logic-variable input signals; $F$ through $K$ are outputs. Using the POS approach, write a Boolean expression for $F$ in terms of the inputs, Repeat by using the SOP approach.

Adriano Chikande
Adriano Chikande
Numerade Educator
00:35

Problem 41

Repeat Problem P7.40 for $G$.

Amy Jiang
Amy Jiang
Numerade Educator
12:11

Problem 42

Repeat Problem P7.40 for $H$.

Yongyao Zhou
Yongyao Zhou
Numerade Educator
04:13

Problem 43

Repeat Problem P7.40 for $I$.

Nicholas Sacco
Nicholas Sacco
Numerade Educator
01:49

Problem 44

Repeat Problem P7.40 for $J$.

James Kiss
James Kiss
Numerade Educator
01:00

Problem 45

Repeat Problem P7,40 for $K$.

Raj Bala
Raj Bala
Numerade Educator
01:53

Problem 46

Show how to implement the SOP circuit shown in Figure $P 7.46$ by using only NAND gates.

Adriano Chikande
Adriano Chikande
Numerade Educator
02:16

Problem 47

Show how to implement the POS circuit shown in Figure $\mathrm{P} 7.47$ by using only NOR gates.

Nishant Kumar
Nishant Kumar
Numerade Educator
05:03

Problem 48

Design a logic circuit to control electrical power to the engine ignition of a speed boat. Logic output $I$ is to become high if ignition power is to be applied and is to remain low otherwise, Gasoline fumes in the engine compartment present a serious hazard of explosion. A sensor provides a logic input $F$ that is high if fumes are present. Ignition power should not be applied if fumes are present. To help prevent accidents, ignition power should not be applied while the out drive is in gear. Logic signal $G$ is high if the out drive is in gear and is low otherwise. A blower is provided to clear fumes from the engine compartment and is to be operated for five minutes before applying ignition power. Logic signal $B$ becomes high after the blower has been in operation for five minutes. Finally. an emergency override signal $E$ is provided so that the operator can choose to apply ignition power even if the blower has not operated for five minutes and if the out drive is in gear. but not if gasoline fumes are present. a. Prepare a truth table listing all combinations of the input signals $B, E, F,$ and $G .$ Also, show the desired value of $I$ for each row in the table. b. Using the SOP approach, write a Boolean expression for $I$. c. Using the POS approach, write a Boolean expression for $I$ d. Try to manipulate the expressions of parts (b) and (c) to obtain a logic circuit having the least number of gates and inverters Use AND gates, OR gates, and inverters.

Mirza  Aslam Beig
Mirza Aslam Beig
Numerade Educator
04:56

Problem 49

Use only NAND gates to find a way to implement the $X O R$ function for two inputs, $A$ and $B$. (Hint. The inputs of a two-input NAND can be wired together to obtain an inverter. List the truth table and write the SOP expression. Then, apply De Morgan's laws to convert the OR operation to AND.)

M Hassan Anwar
M Hassan Anwar
Numerade Educator
04:56

Problem 50

Use only two-input NOR gates to find a way to implement the XOR function for two inputs, $A$ and $B$. (Hint. The inputs of a two input NOR can be wired together to obtain an inverter. List the truth table and write the POS expression. Then, apply De Morgan's laws to convert the AND operation to OR.)

M Hassan Anwar
M Hassan Anwar
Numerade Educator
04:31

Problem 51

Consider the BCD-to-seven-segment decoder discussed in conjunction with Figure 7.26 on page $369 .$ Suppose that the BCD data are represented by the logic variables $B_{8}, B_{4}, B_{2}$ and $B_{1}$. For example, the decimal number 7 is represented in $\mathrm{BCD}$ by the word 0111 in which the leftmost bit is $B_{8}=0$. the second bit is $B_{4}=1,$ and so forth. a. Find a logic circuit based on the product of maxterms having output $A$ that is high only if segment $A$ of the display is to be on. b. Repeat for segment $B$.

WZ
Wen Zheng
Numerade Educator
04:56

Problem 52

Suppose that two numbers in signed two's complement form have been added. $S_{1}$ is the sign bit of the first number, $S_{2}$ is the sign bit of the second number, and $S_{T}$ is the sign bit of the total. Suppose that we want a logic circuit with output $E$ that is high if either overflow or underflow has occurred; otherwise, $E$ is to remain low. a. Write the truth table. b. Find an SOP expression composed of minterms for $E .$ e. Draw a circuit that yields $E,$ using AND, OR, and NOT gates.

M Hassan Anwar
M Hassan Anwar
Numerade Educator
01:43

Problem 53

a. Construct a Karnaugh map for the logic function
$$\begin{aligned}
F=& \bar{A} B C \bar{D}+A B C \bar{D}+\bar{A} B \bar{C} D \\
&+A B C D+\bar{A} B C \bar{D}+\bar{A} \bar{B} C \bar{D}
\end{aligned}$$
b. Find the minimum SOP expression. e. Find the minimum POS expression.

Manik Pulyani
Manik Pulyani
Numerade Educator
01:43

Problem 54

A logic circuit has inputs $A, B,$ and $C .$ The output of the circuit is given by $$D=\sum m(0,3,4)$$
a. Construct the Karnaugh map for $D$
b. Find the minimum SOP expression.
c. Find two equally good minimum POS expressions

Manik Pulyani
Manik Pulyani
Numerade Educator
01:43

Problem 55

A logic circuit has inputs $A, B,$ and $C .$ The output of the circuit is given by
$$D=\prod M(1,3,4,6)$$
a. Construct the Karnaugh map for $D$
b. Find the minimum SOP expression.
c. Find the minimum POS expression.

Manik Pulyani
Manik Pulyani
Numerade Educator
06:48

Problem 56

a. Construct a Karnaugh map for the logic function $$D=A B C+\bar{A} B C+A B \bar{C}+B C$$
b. Find the minimum SOP expression and realize the function, using AND, OR, and NOT gates. c. Find the minimum POS expression and realize the function, using AND,OR, and NOT gates

M Hassan Anwar
M Hassan Anwar
Numerade Educator
01:43

Problem 57

a. Construct a Karnaugh map for the logic function $$F=A B \bar{C} \bar{D}+A B C D+A B C \bar{D}+\bar{A} B C D$$
b. Find the minimum SOP expression.
c. Realize the minimum SOP function, using AND, OR, and NOT gates. d. Find the minimum POS expression.

Manik Pulyani
Manik Pulyani
Numerade Educator
01:20

Problem 58

Consider Table P7.58 in which $A, B, C$ and $D$ are input variables $F, G, H,$ and $I$ are the out put variables a. Construct a Karnaugh map for the output variable $F$. b. Find the minimum SOP expression for this logic function.
c. Use AND, OR, and NOT gates to real ize the minimum SOP function. d. Find the minimum POS expression.

Carson Merrill
Carson Merrill
Numerade Educator
01:49

Problem 59

Repeat Problem $\mathrm{P} 7.58$ for output variable $G$.

Sheryl Ezze
Sheryl Ezze
Numerade Educator
02:09

Problem 60

Repeat Problem P7.58 for output variable $H$.

Arpit Gupta
Arpit Gupta
Numerade Educator
02:41

Problem 61

Repeat Problem P7.58 for output variable $I$

Ren Jie Tuieng
Ren Jie Tuieng
Numerade Educator
03:06

Problem 62

We need a logic circuit that gives an output $X$ that is high only if a given hexadecimal digit is even (including 0 ) and less than 7 . The inputs to the logic circuit are the bits $B_{8}, B_{4}, B_{2}$ and $B$, of the binary equivalent for the hexadecimal digit. (The most significant bit is $B_{8}$ and the least significant bit is $B_{1}$.) Construct a truth table and the Karnaugh map; then, write the minimized SOP expression for $X$.

WZ
Wen Zheng
Numerade Educator
04:31

Problem 63

We need a logic circuit that gives an output $X$ that is high when an error in the form of an unused code occurs in a given $\mathrm{BCD}$ codeword. The inputs to the logic circuit are the bits $B_{8}, B_{4}, B_{2},$ and $B_{1}$ of the $B C D$ codeword. (The most significant bit is $B_{8}$, and the least significant bit is $B_{1}$.) Construct the Karnaugh map and write the minimized SOP and POS expressions for $X$

WZ
Wen Zheng
Numerade Educator
04:31

Problem 64

We need a logic circuit that gives a high out. put if a given hexadecimal digit is $4,6, \mathrm{C}$ or $\mathrm{E}$. The inputs to the logic circuit are the bits $B_{B}$ $B_{4}, B_{2},$ and $B_{1}$ of the binary equivalent for the hexadecimal digit. (The most significant bit is $B_{8},$ and the least significant bit is $B_{1}$.) Construct the Karnaugh map and write the minimized SOP and POS expressions for $X$.

WZ
Wen Zheng
Numerade Educator
04:56

Problem 65

We need to design a logic circuit for inter changing two logic signals. The system has three inputs $l_{1}, l_{2},$ and $S$ as well as two outputs $O_{1}$ and $O_{2} .$ When $S$ is low, we should have $O$ $=I_{1}$ and $O_{2}=I_{2}$. On the other hand, when $S$ is high, we should have $O_{1}=I_{2}$ and $O_{2}=I_{1}$ Thus, $S$ acts as the control input for a reversing switch. Use Karnaugh maps to obtain a minimal SOP design. Draw the circuit.

M Hassan Anwar
M Hassan Anwar
Numerade Educator
01:43

Problem 66

A city council has three members, $A, B,$ and $C .$ Each member votes on a proposition (1 for yes, 0 for no). Find a minimized SOP logic expression having inputs $A, B,$ and $C$ and out put $X$ that is high when the majority vote is yes and low otherwise. Show that the minimized logic circuit checks to see if any pair of the three board members have voted yes Repeat for a council with five members (Hint In this case, the circuit checks to see if any group of three has all voted yes.)

Manik Pulyani
Manik Pulyani
Numerade Educator
03:15

Problem 67

A city council has four members, $A, B, C,$ and $D .$ Each member votes on a proposition (1 for yes, 0 for no). Find a minimized SOP logic expression having inputs $A, B, C,$ and $D$ and output $X$ that is high when the vote is tied and low otherwise.

MB
Matt Bremer
Numerade Educator
09:14

Problem 68

One way to help ensure that data are communicated correctly is to append a parity bit to each data word such that the number of 18 in the transmitted word is even. Then, if an odd number are found in the received result, we know that at least one error has occurred. a. Show that the circuit in Figure $\mathrm{P} 7.68$ produces the correct parity bit $P$ for the nibble (four-bit data word) $A B C D .$ In other words, show that the transmitted word $A B C D P$ contains an even number of 1 s for all combinations of data. b. Determine the minimum SOP expression for $P$ in terms of the data bits. e. If the received word contains a single bit error, the number of ones in the word will be odd. Draw a circuit using four XOR gates that outputs a 1 if the received word $A B C D P$ contains an odd number of 1 s and outputs a 0 otherwise.

Robin Corrigan
Robin Corrigan
Numerade Educator
01:42

Problem 69

Suppose we want circuits to convert the binary codes into the three-bit Gray codes shown in Table $P 7.69 .$ Find the minimum SOP expressions for $X, Y,$ and $Z$ in terms of $A, B$ and $C$.

Manik Pulyani
Manik Pulyani
Numerade Educator
01:13

Problem 70

Find the minimum SOP expressions for $A, B$ and $C$ in terms of $X, Y$, and $Z$ for the codes of Table $P 7.69$.

Lucas Finney
Lucas Finney
Numerade Educator
01:30

Problem 71

We have discussed BCD numbers in which the bits have weights of $8,4,2,$ and 1 . Another way to represent decimal integers is the 4221 code in which the weights of the bits are $4,2,2,$ and $1 .$ The decimal integers, the BCD equivalents, and the 4221 equivalents are shown in Table $\mathrm{P} 7.71$. We want to design logic circuits to convert BCD codewords to 4221 codewords a Fill in the Karnaugh map for $F$, placing $x$ 's (don't cares) in the squares for $\mathrm{BCD}$ codes that do not occur in the table. Find the minimum SOP expression allowing the various $x^{3}$ s to be cither 1 s or 0 s to make the expression as simple as possible, b. Repeat (a) for $G$
c. Repeat (a) for $H$. d. Repeat (a) for $I$.

James Kiss
James Kiss
Numerade Educator
01:43

Problem 72

We want to design logic circuits to convert the 4221 codewords of Problem $\mathrm{P} 7.71$ to $\mathrm{BCD}$ codewords. a. Fill in the Karnaugh map for $A,$ placing $x^{\prime}$ s (don't cares) in the squares for 4221 codes that do not occur in the table Find the minimum SOP expression allowing the various $x$ 's to be cither 1 s or 0 s to make the expression as simple as possible. b. Repeat (a) for $B$, c. Repeat (a) for $C$, d. Repeat (a) for $D$.

Manik Pulyani
Manik Pulyani
Numerade Educator
08:09

Problem 73

Another code that is sometimes used to represent decimal digits is the excess-3 code. To convert a decimal digit to excess-3. we add 3 to the digit and express the sum as a four-bit binary number. For example, to convert the decimal digit 9 to excess- 3 code, we have $$9_{10}+3_{10}=12_{10}=1100_{2}$$ Thus 1100 is the excess- 3 codeword for 9 . The excess-- 3 codewords for the other decimal digits are shown in Table P7.71 We want to design logic circuits to convert $\mathrm{BCD}$ codewords to excess- 3 codewords a. Fill in the Karnaugh map for $W$, placing $x$ 's (don't cares) in the squares for $\mathrm{BCD}$ codes that do not occur in the table. Find the minimum SOP expression allowing the various $x^{\prime}$ s to be cither 1 s or 0 s to make the expression as simple as possible. b. Repeat (a) for $X$ c. Repeat (a) for $Y$, d. Repeat (a) for $Z$.

WZ
Wen Zheng
Numerade Educator
01:04

Problem 74

We want to design logic circuits to convert the excess- 3 codewords of Problem $\mathrm{P} 7.73$ to $\mathrm{BCD}$ codewords. a. Fill in the Karnaugh map for $A,$ placing $x^{\prime}$ 's (don't cares) in the squares for excess-3 codes that do not occur in the table. Find the minimum SOP expression allowing the various $x$ 's to be either 1 s or 0 s to make the expression as simple as possible, b. Repeat (a) for $B$. c. Repeat (a) for $C$. d. Repeat (a) for $D$.

Mirza  Aslam Beig
Mirza Aslam Beig
Numerade Educator
01:53

Problem 75

Use NOR gates to draw the diagram of an $S R$ flip-flop. Repeat using NAND gates.

Adriano Chikande
Adriano Chikande
Numerade Educator
04:56

Problem 76

Draw the circuit symbol and give the truth table for an $S R$ flip-flop

M Hassan Anwar
M Hassan Anwar
Numerade Educator
04:56

Problem 77

Draw the circuit symbol and give the truth table for a clocked $S R$ flip-flop.

M Hassan Anwar
M Hassan Anwar
Numerade Educator
03:23

Problem 78

Explain the distinction between synchronous and asynchronous inputs to a flip-flop.

M Hassan Anwar
M Hassan Anwar
Numerade Educator
01:42

Problem 79

What is edge triggering?

M Hassan Anwar
M Hassan Anwar
Numerade Educator
04:56

Problem 80

Draw the circuit symbol and give the truth table for a positive-edge-triggered $D$ flip-flop.

M Hassan Anwar
M Hassan Anwar
Numerade Educator
02:04

Problem 81

Assuming that the initial state of the shift register shown in Figure $\mathrm{P} 7.81$ is 100 (ie, $Q_{0}=1$ $Q_{1}=0,$ and $Q_{2}=0$, find the successive states After how many shifts does the register return to the starting state?

James Kiss
James Kiss
Numerade Educator
01:19

Problem 82

Repeat Problem $\mathrm{P} 7.81$ if the XOR gate is replaced with a. an OR gate; b. an AND gate.

Ajay Singhal
Ajay Singhal
Numerade Educator
03:24

Problem 83

The $D$ flip-flops of Figure $\mathrm{P} 7.83$ are positiveedge triggered. Assuming that prior to $t=0$ the states are $Q_{0}=Q_{1}=0,$ sketch the voltage waveforms at $Q_{0}$ and $Q_{1}$ versus time. Assume logic levels of $0 \mathrm{V}$ and $5 \mathrm{V}$.

Arpit Gupta
Arpit Gupta
Numerade Educator
02:24

Problem 84

The $D$ flip-flops of Figure $P 7,84$ are positiveedge triggered, and the $C l$ input is an asynchronous clear. Assume that the states are $Q_{0}=Q_{1}=Q_{2}=Q_{3}=0$ at $t=0 .$ The clock input $V_{\mathrm{IN}}$ is shown in Figure $\mathrm{P} 7.83 .$ Sketch the voltage waveforms at $Q_{0}, Q_{1}, Q_{2},$ and $Q_{3}$ versus time. Assume logic levels of $0 \mathrm{V}$ and $5 \mathbf{V}$.

M Hassan Anwar
M Hassan Anwar
Numerade Educator
01:12

Problem 85

Use AND gates, OR gates, inverters, and a negative-edge-triggered $D$ flip-flop to show how to construct the $J K$ flip-flop of Figure 7.50 on page 390.

Clarissa Noh
Clarissa Noh
Numerade Educator
01:20

Problem 86

Consider the ripple counter of Figure 7.53 on page $392 .$ Suppose that the flip-flops have asynchronous clear inputs. Show how to add gates so that the count resets to zero immediately when the count reaches six. This results in a modulo-six counter.

James Kiss
James Kiss
Numerade Educator
01:29

Problem 87

Figure $\mathrm{P} 7.87$ shows the functional diagram of an electronic die that can be used in games of chance. The system contains a high speed clock, a push-button momentary con tact switch that returns to the upper (logic 1 ) position when released, and a counter that counts through the cycle of states: 001,010 011,100,101,110 (i.c, the binary equivalents of the number of spots on the various sides of the die). $Q_{3}$ is the most significant bit (MSB), and $Q_{1}$ is the least significant bit (LSB). The system has a display consisting of seven light-emitting diodes (LED), each of which lights when logic 1 is applied to it. The encoder is a combinatorial logic circuit that translates the state of the counter into the logic signals needed by the display. Each time the switch is depressed, the counter operates, stopping in a random state when the switch is released, a. Use $J K$ flip-flops having asynchronous preset and clear inputs to draw the detailed diagram of the counter. b. Design the encoder, using Karnaugh maps to minimize the logic elements needed to produce each of the seven output signals.

Hunza Gilgit
Hunza Gilgit
Numerade Educator
01:17

Problem 88

Four light-emitting diodes (LED) are arranged at the corners of a diamond, as illustrated in Figure $\mathrm{P} 7.88$. When logic 1 is applied to an LED, it lights, Only one diode is to be on at a time. The on state should move from diode to diode either clockwise or counterclockwise, depending on whether $S$ is high or low, respectively. One complete revolution should be completed in each two second interval. a. What is the frequency of the clock? b. Draw a suitable logic circuit for the counter. $.$. Construct the truth table and use Karnaugh maps to determine the mini mum SOP expressions for $D_{1}$ through $D_{4}$ in terms of $S, Q_{1}$. and $Q_{2}$.

Narayan Hari
Narayan Hari
Numerade Educator