Consider the combinational circuit shown in Fig. 3.1.4. i) Derive the Boolean expressions for T₁ through T4. Evaluate the outputs F₁ and F₂ as a function of the four inputs. ii) List the truth table with 16 binary combinations of the four input variables. Then list the binary values for T₁ through T4 and outputs F₁ and F₂ in the table. iii) Plot the output Boolean function obtained in part (ii) on maps and show that simplified Boolean expressions are equivalent to the ones obtained in part (i) T3 A B C D D T₂ F₁ -F₂

Consider the combinational circuit shown in Fig. 3.1.4. i) Derive the Boolean expressions for T₁ through T4. Evaluate the outputs F₁ and F₂ as a function of the four inputs. ii) List the truth table with 16 binary combinations of the four input variables. Then list the binary values for T₁ through T4 and outputs F₁ and F₂ in the table. iii) Plot the output Boolean function obtained in part (ii) on maps and show that simplified Boolean expressions are equivalent to the ones obtained in part (i) T3 A B C D D T₂ F₁ -F₂

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

1. Write Boolean equations for the circuit shown below. They do not need to be optimized. A B D X Y Z
Construct a truth table for the Boolean expression given below. f(x, y,z) = x(yz+z)
Q1: Let F1 = x.Y, F2 A OB , F3 = F1 + F2 Implement the above Boolean expression with logic circuit giving the truth table.
Table 3 INPUTS OUTPUTS Y F A3. Connect the circuit shown in Fig. 4.2. Apply the inputs X and Y in Table 2 with data switches. Monitor the output with the probe and record the output for each set of inputs in the F column of Table 2. 1 1 1 1 A6. Construct the expression obtained in A4 by using only NAND gates. Draw and implement the NAND gates connection diagram of the function. Record the output for each set of inputs in the F column of Table 4. (Note that A+B = (A'.B') F F= Fig. 4.2 Table 2 INPUTS OUTPUT Y F Table 4 1 INPUTS OUTPUTS 1 F 1 1 1 A4. Express the function in Fig. 4.2 as a sum of minterms (sum-of-products) using Table 2. 1 1 F= Questions (True or False): # Question 1 All the logic functions can be implemented with only NAND Gates. (T/F) 2 A5. Draw the logic circuit of the expression obtained in A4 by using NOT, OR, AND gates. B Implement the logical circuit to monitor the output with a probe and record the output for each set of inputs in the F column of Table 3.
7. Given the following truth table, write an algebraic expression for the function F, simplify the expression, and then draw a logic circuit for it. A C F 1 1 1 1 1 1 1 1 1 1 1 1
8. For the following circuits, find a Boolean expression and construct the truth table. a) A B b) A B. N
1. For the following Function, draw the circuit and construct the truth table: F = [(X + Y' )' . (X' Y')]' (Non-anonymous question)
B2. Write the Boolean equation directly from the following circuit: E
A)Write the expression related to the logic circuit given above as the sum of products.b) Simplify the expression using the axioms and theorems of Boolean algebra.
5. Consider the circuit diagram in Fig. 1 a. Write the Boolean expression for the function F(x, y, z) b. Construct the truth table describing the outputs of the circuit F(x, y, z). c. Express the function F (x.y,z) as product of maxterms. Please give your answer as a function of x, y, and z. Do Fig. 1 for Question 5
Q. A combinational logic circuit with three inputs A,B and C and one outputs F presented by the given truth table. (i) Find the output expression F. (ii) Simplified F as much as possible and then draw the circuit using logic gates. A BCF 0 00 1 00 1 1 0 10 0 0 1 1 0 100 101 1 1 10 1 1 1 1 1
Q1: Given the logic circuit bellow, implement each of the following: - (2 degree for each) 1- Starting from the input side and writing output expression for each of the gates. 2- Identify a Boolean expression. 3- Show the behavior of the logic circuit with a truth table. 4- 5- L