46. Use the Karnaugh map method to implement the minimum SOP expression for the logic function specified in truth Table 4–17. 47. Solve Problem 46 for a situation in which the last six binary combinations are not allowed. TABLE 4-16 TABLE 4-17 Inputs Output Inputs Output ABC D 0 0 0 0 0 0 0 1 ABC 0 00 0 01 0 10 0 0 1 0 011 0 0 11 1 100 1 0100 0 10 1 101 0110 110 0111 111 10 0 0 10 0 1 1010 101 1 1 10 0 1 10 1 1110

46. Use the Karnaugh map method to implement the minimum SOP expression for the logic function specified in truth Table 4–17. 47. Solve Problem 46 for a situation in which the last six binary combinations are not allowed. TABLE 4-16 TABLE 4-17 Inputs Output Inputs Output ABC D 0 0 0 0 0 0 0 1 ABC 0 00 0 01 0 10 0 0 1 0 011 0 0 11 1 100 1 0100 0 10 1 101 0110 110 0111 111 10 0 0 10 0 1 1010 101 1 1 10 0 1 10 1 1110

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

* A combinational circuit has 3 inputs X, Y, Z and output F. F is 1 for following input combinations: X is 0, Y is 1. X is 0, Z is 1. X, Y, Z are 0. X, Y, Z are 1. Otherwise F is 0 а) Write the truth table of the function b) Find the minimum product-of-sums equation с) Draw logic circuit using minimum number of 2-input NAND gates
The state table shown in Table 3 is for a sequential synchronous circuit. Choose a specific encoding and assignment for the states, and complete the equations of excitation and design for the circuit using type D and S-R flipflops. Present Next State Yield State * = Y2Y1Y0 Y,Y1Y0 Y½Y1Y x = 0 = 1 A В A В A 1 C D A D D E 1 E C 1 1 Table 3: State Table Question 3a
Q.6 Design a digital circuit that inputs 4 bits and outputs '1' if there are two or more 'l's in the input. a) Implement the minimized version of the function using AND, OR and NOT gates. b) Implement a minimized version of the function using NAND and NOT gates. c) Implement a minimized version of the function using NOR and NOT gates. d) Implement the function using a DECODER of an appropriate size. e) Implement the function using a MULTIPLEXER of an appropriate size.
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
Hardware & Architecture HW #5 - 100 Pts (15 Pts - 5 Pts Each) Given the following truth table 3. Inputs Output A B C 0 0 0 0 0 0 1 0 0 1 0 1 0 1 1 I 1 0 0 0 1 0 1 0 110 1 1 1 I 0 a. Find the UN-SIMPLIFIED SOP Boolean Expression for the Output. b. Find the UN-SIMPLIFIED POS Boolean Expression for the Output. c. Simplify the SOP Expression using Boolean algebra. 4. (15 Pts - 5 Pts Each) Given the following truth table Inputs a. Find the UN-SIMPLIFIED SOP Boolean Expression for the Output. Output X Y Z 0 0 0 0 0 0 1 1 0 1 0 1 0 I 1 0 1 0 0 1 b. Find the UN-SIMPLIFIED POS Boolean Expression for the Output. 1 0 1 1 1 1 0 0 1 1 1 0 c. Simplify the POS Expression using Boolean algebra.
xyz + xyz + wxy+wxy+wxy using 1. Simplify the Boolean Equation F Boolean Algebra Theorems. 2. Obtain the Sum of Products (SOP) form Logic Equation that satisfies the following Truth Table and express each output in Σm form. Draw the logic circuit using fundamental gates. Inputs Outputs x y z f g 000 0 0 001 1 1 0 1 0 1 1 0 1 1 1 0 100 0 1 1 0 1 0 0 1 1 0 0 0 1 1 1 1 1
Design combinational logic for outputting the wait time associated with each state. For example, state 000 has the main street green light on for 15 seconds. The combinational logic for the input 000 would have an output 1111 corresponding to decimal 15. Let the outputs W3, W2, W1 and W0 represent a binary number corresponding to the wait time.
QUESTION 8 Implement the following truth table directly (without any minimization) using a PLA. Properly label the inputs and outputs. Inputs W X Outputs Y 0 0 1 1 0 1 0 1 1 1 1 0 1 10 1 1 0 0 1 1 1 10 0 0 0. 1 0. 3 4 0. PLA 0. 6. 1 8. 1 6. 1. 0. CIOI 0001010 BOOI 000100
Consider the following truth table. A 0 B001 В C Output 0 1 1 1 0 1 0 0 0 1 1 1 1 0 0 1 0 1 1 1 0 1 1 1 1 1a) 1b) Write the Boolean expression for the output using the sum-of-products (SOP) form. 1c) Draw the logic circuit using the expression derived in part (a). Use two-input gates (OR, AND) and single-input inverters. Write the Boolean expression for the output using product-of-sums (POS) form.
Q17. i) For the Figure Q17, find the logic function Z [3] Х lo 1 to 4 4 TO 1 l1 MUX 1 DEMUX X 2 X3 So C D- A В Figure Q17 ii) Draw the truth table for the circuit having ABCD as inputs and Z as output. [2]
The truth table for a Boolean expression is shown on figure1. A, B, C, D are inputs and Y is the output Write the Boolean expression on SOP form Y = f (A, B, C, D) Minimize the function using Karnaugh Map (K Map) Draw the minimized function using logic gates
1. Simplify the following logic equation: F = ab'c + abcd' + ab'cd' + acd Also draw the circuit before and after simplifications, and comment on savings on number of gates. % savings (number of gates required before modification – number of gates required with simplest form)* 100/(number of gates required after modification)