PROBLEMS: 1. Perform a logical AND using the following two binary numbers: 10111011 AND 11100111. Show your work. 2. Perform a logical OR using the following two binary numbers: 10111011 OR 11100111. Show your work. 3. Perform a logical XOR using the following two binary numbers: 10111011 XOR 11100111. Show your work. 4. Design a logic circuit to implement the following equation: (A + B) AND (CD). 5. If A = 1, B = 0 and C= 1, what is the output of the following equation: (A AND B) OR C?

PROBLEMS: 1. Perform a logical AND using the following two binary numbers: 10111011 AND 11100111. Show your work. 2. Perform a logical OR using the following two binary numbers: 10111011 OR 11100111. Show your work. 3. Perform a logical XOR using the following two binary numbers: 10111011 XOR 11100111. Show your work. 4. Design a logic circuit to implement the following equation: (A + B) AND (CD). 5. If A = 1, B = 0 and C= 1, what is the output of the following equation: (A AND B) OR C?

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

Carefully study the following logic circuits and answer the next two questions. The binary output at F2 is Blank 1 . The binary output at F3 is Blank 2 .
Answer this question, part (1), (2) & (3). Design a combinational logic circuit that converts a three-bit binary number from code A to code B, according to the table on the right. Answer the following questions: Code A Code B 000 000 001 001 011 010 010 011 110 100 111 101 101 110 100 111 Construct the truth table for the circuit. Derive the Sum-of-Products (SoPs) Boolean expression for each of the circuit outputs. Using Boolean algebra, simplify the expression you obtained in Part 2 above.
1. write a truth table using this symbol: --> 2. write the inputs for the truth table to the left of the --> and write the outputs for the truth table to the right of the --> 3. write the compliment, or NOT using ' Given the following Boolean equation: F = A XOR B XOR C XOR D that represents a digital logic circuit where the output is F and the inputs A, B, C, and D, write the truth table for the Boolean equation.
Implement the following Logic Circuit using C++. A, B, C, and D are the input bits while F is the output bit function.
I believe this problem is from computer systems/architecture. PLEASE TRY YOUR BEST. I NEED TO UNDERSTAND THIS PROBLEM I need you to design a digital logic circuit as a read only memory (ROM) [Decoder + OR gates]. A ROM accepts a three–bit number (x2 x1 x0) and generates an output binary number equal to the input squared + 2. Here is the equation: A = x2 + 2, with input (x) : 0 ≤ (x) ≤ 7 (a) Try to set–up the truth–table [Binary inputs: (x); Binary outputs: ..., A2, A1, A0] (b) What is the size of the initial (unsimplified) ROM ? (c) What is the size of the final (simplified) ROM ?
1. Design a 16*1 MUX using 4 *1 MUXs. 2. Design a 4-bit ALU to perform the following functions:A + B, A - B, A + 1, A’ . B’ ,A OR B, A XOR B, A AND B 3. Design a combinational logic that compares X and Y, where X = X1X0 and Y = Y1Y0; the output of combinational logic is 1, when X < Y; otherwise the output is 0.(a) Show truth table.(b) Find output function using K-map. 4. Design a logic circuit with three inputs and one output; the output generates even parity bit of the inputs.(a) Show the truth table. (b) Find output function. (c) Draw logic circuit.
Using suitable circuit diagrams, implement the following logic equations using CMOS i. f(xy) = overline (x + y) ii. f(xy) =( x -y) iii. f(x.y,z)=( overline x.y.z )
Write the Boolean equations and draw the logic diagram of the circuit whose outputs are defined by the following truth table: Table P2.27f 1 f 2 a b c1 1 0 0 00 1 0 0 11 0 0 1 01 1 0 1 11 0 1 0 00 1 1 0 11 0 1 1 1
A combinational circuit with four inputs (A,B,C,D) and one output (Z) is designed as follows using an 8:1 multiplexer. Inputs A,B,C are connected to the select lines ?S2, S1, S0 respectively. Multiplexer has the following values connected to the data inputs: I0,I6 =1; I1,I3 =D; I2,I5 =0; I4,I7 =D’ Write the simplest logic expression of the circuit realized above Z= f(A, B, C, D)
Design a logic circuit that compares 2 5-bit numbers. Inputs : Q(n) ---- 5 bits B --- 5 bits but always constant value 10000 I need to draw a circuit that compares the values from Q(n) with 10000. Please send an explanatory and detailed solution.
2. Using properties of Boolean algebra, simplify the following Boolean expressions so they could be tuilt with the minimum number of gates. a.AB+B(AC+BC+ABC+A) 2. Using properties of Boolean algebra, simplify the following Boolean expressions so they coulus be built with the minimum number of gates. a.AB+B(AC+BC+ABC+A )b.AB′+A′C′+B′CD+AC+BC
Truth tables simplifies the operations of the various logic gates.Draw a truth table to represent the logical operation {A+B +A’C)(B+A+AC’) and comment on your output