2.11 List the truth table of the function:(a) F = xy+ xy' +y'z(b) F = x'z' + yz2.12 We can perform logical operations on strings of bits by considering each pair of correspondingbits separately (called bitwise operation). Given two eight-bit strings A 10110001 andB = 10101100, evaluate the eight-bit result after the following logical operations: (a)* AND,(b) OR, (c)* XOR, (d)* NOT A, (e) NOT B.2.17 Obtain the truth table of the following functions, and express each function in sum-of-mintermsand product-of-maxterms form:(a) (xy + :)(y + xz)(c) x'z + wx'y + wyz' + w'y'(b) (x + y')(y' + :)(d) (xy + yz' + x'z)(x + z)2.18 For the Boolean functionF = xy'z + x'y'z + w'xy + wx'y + wxy(a) Obtain the truth table of F.(b) Draw the logic diagram, using the original Boolean expression.(c Use Boolean algebra to simplify the function to a minimum number of literals.(d) Obtain the truth table of the function from the simplified expression and show that it is thesame as the one in part (a).(e) Draw the logic diagram from the simplified expression, and compare the total number ofgates with the diagram of part (b).

Answered: Image /qna-images/answer/3e5c2027-894b-4f90-abf5-1ee29b4347bb.jpg

Answered: 2.11 List the truth table of the…

Engineering

Computer Science

2.11 List the truth table of the function: (a)* F = xy + xy' + y'z (b) F = x'z' + yz

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

5.9 Implement a serial bit stream sequence detector with first two data are 00 followed by at least twoconsecutive 11 by doing the following. Specification example, if input data senquence is 0011 or 00111or 001111, ...the output will be 1; otherwise the output will be 0, such as the input is 01XX or 10XX or0010 or any sequence, ...[1] How many flip flop is needed to implement this detector?[2] Derive a state diagram for this detector.[3] What type flip flop is going to be used?[4] Draw a truth table for this detector with considering the FF chosen in [3][5] Develop state input equations[6] Sketch a logic diagram for this detector
32) Let a = 1.0 × 29, b = − 1.0 × 29 and c = 1.0 × 21. Using the floating-point model described in the text (the representation uses a 14-bit format, 5 bits for the exponent with a bias of 15, a normalized mantissa of 8 bits, and a single sign bit for the number), perform the following calculations, paying close attention to the order of operations. What can you say about the algebraic properties of floating-point arithmetic in our finite model? Do you think this algebraic anomaly holds under multiplication as well as addition? b + (a + c) = (b + a) + c = Show Steps Please
15. Consider the following Java-like code: int number = <<read number from user>>; int mask = MASK; int result = number OP mask; if (result != 0) { print("Bit 8 was set"); } The above code is supposed to print “Bit 8 was set” if bit 8 of user’s number was set to 1. If bit 8 was not set, then this code should not print anything (result==0). What hexadecimal value should MASK be, and what bit-wise operation should OP be, for the above code to work correctly?
Suppose we number the bytes in a w-bit word from 0 (least significant)to w/8 −1 (most significant).Write code for the following C function, which will return an unsignedvalue in which byte i of argument x has been replaced by byte b:unsigned replace byte (unsigned x, int i, unsigned char b);Examples:replace byte(0x12345678, 2, 0xAB) → 0x12AB5678replace byte(0x12345678, 0, 0xAB) → 0x123456AB
I want to write C or C++ functions that evaluate to ONE when the given conditions are true, and to ZERO when they are false. The following are the fourt conditions: int a(int x); //Any bit of x equals 0. int b(int x); // Any bit of x equals 1. int c(int x); //Any bit in the LSB of x equals 0. int d(int x); //Any bit in the MSB of x equals 1. The code should follow the bit-level integer coding rules, with the additional restriction that you may not use equality (==) or inequality (!=) tests.
4, in the fixed-point machine, the following statement is wrong ( ).A. In addition to the complement, the original code and the inverted code cannot indicate that the original code of −1 B. +0 is not equal to −0C. the inverse of +0 is not equal to the negative of −0 D. For the same machine word length, the complement code can represent a negative number more than the original code and the inverted code.
f(x)=x^2(x-4)(x+2)^2 Bounce(B) or Cross(C) (in ascending order of zeros): Incorrect (So type CBC or BBB or...)
Let a = 1.0 × 29 , b = −1.0 × 29 and c = 1.0 × 21 . Using thesimple floating-point model described in the text (therepresentation uses a 14-bit format, 5 bits for the exponent with abias of 15, a normalized mantissa of 8 bits, and a single sign bit forthe number), perform the following calculations, paying closeattention to the order of operations. What can you say about thealgebraic properties of floating-point arithmetic in our finitemodel? Do you think this algebraic anomaly holds undermultiplication as well as addition?1. b + (a + c) =2. (b + a) + c =
You are provided the 32-bit values N and M together with the two bit positions i and j. Provide a technique that begins M at bit j and ends it at bit i in order to insert M into N. It is fair to assume that bits j through i can accommodate all of M. In other words, if M = 10011, you may assume that there are at least 5 bits between j and i. You would not, for example, have j = 3 and i = 2 since M could not totally fit between bit 3 and bit 2.
A Gray code is a sequence of binary numbers with the property that no more than 1 bit changes in going from one element of the sequence to another. For example, here is a 3-bit binary Gray code: 000, 001, 011, 010, 110, 111, 101, and 100. Using three D flip-flops and a PLA, construct a 3-bit Gray code counter that has two inputs: reset, which sets the counter to 000, and inc, which makes the counter go to the next value in the sequence. Note that the code is cyclic, so that the value after 100 in the sequence is 000.
You are given two bit locations, i and j, together with the 32-bit values N and M. To insert M into N, provide a procedure that starts M at bit j and finishes it at bit i. It is safe to presume that all of M can fit in the bits j through i. In other words, you may infer that there are at least 5 bits between j and i if M = 10011. M could not completely fit between bit 3 and bit 2, thus you would not, for instance, have j = 3 and i = 2.
You are writing code that is equivalent to: X = A / (5 + B) Assume signed bytes and the following first 3 lines of code: mov al,A mov bl,B add bl,5 What is the one line of code that will perform the division correctly?