[1] Consider a Boolean Algebra Show that (a) xy+xz+yz=x.y + x'.z (b) (a+b)'(a'+by=0 [2] Algebraically simply the following expressions: (a) F=abc + abc + ab'c+abe'+ab'e (b) F=y(wz wz) + xy [3] Simplify the following Boolean expressions to a minimum number of literals: (a) xy + xy (b) (x+y)(x + 9) (c) xyz + 2y + xyz (d) (A+B) (A + B) [4] Reduce the following Boolean expressions to the indicated number of literals: (a) XC + ABC + AC (b) (19+2)+z+ xy +wx (c) AB(D+CD) + B(A + ACD) (d) (+C)(+C)(A + B + CD) [5] Find the complement of the following expressions: (a) xỹ + Ry (b)(a + c)(a + b)(a + b + c) (c) z+ 2(0w + xy) (d) (w +92)(x + Wz) [6] Given F= ab + b(ad + ac) implement it with AND, OR and inverter gates. [7] Implement the Boolean function F = xy +9z (a) With AND, OR, and inverter gates (b) With OR and inverter gates (c) With AND and inverter gates (d) With NAND and inverter gates (e) With NOR and inverter gates to three literals. to three literals. to one literals. to four literals.

[1] Consider a Boolean Algebra Show that (a) xy+xz+yz=x.y + x'.z (b) (a+b)'(a'+by=0 [2] Algebraically simply the following expressions: (a) F=abc + abc + ab'c+abe'+ab'e (b) F=y(wz wz) + xy [3] Simplify the following Boolean expressions to a minimum number of literals: (a) xy + xy (b) (x+y)(x + 9) (c) xyz + 2y + xyz (d) (A+B) (A + B) [4] Reduce the following Boolean expressions to the indicated number of literals: (a) XC + ABC + AC (b) (19+2)+z+ xy +wx (c) AB(D+CD) + B(A + ACD) (d) (+C)(+C)(A + B + CD) [5] Find the complement of the following expressions: (a) xỹ + Ry (b)(a + c)(a + b)(a + b + c) (c) z+ 2(0w + xy) (d) (w +92)(x + Wz) [6] Given F= ab + b(ad + ac) implement it with AND, OR and inverter gates. [7] Implement the Boolean function F = xy +9z (a) With AND, OR, and inverter gates (b) With OR and inverter gates (c) With AND and inverter gates (d) With NAND and inverter gates (e) With NOR and inverter gates to three literals. to three literals. to one literals. to four literals.

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. Find the minimum sum of products and product of sums expressions for both of the following functions using K-Maps?(????) = ∑ ?(5,6,7,8,9,13,14) + ?(3,4,11,12)F(WXYZ)= XYZ’ + WX’Z + W’XYZ +WXY + WX + W’YZ’
1. Simplify the following Boolean functions, using three-variable Kmaps: (a) F(x, y, z) = Σ(0, 1, 5, 7) (b) F(x, y, z) = Σ(1, 2, 3, 6, 7) (c) F(x, y, z) = Σ(2, 3, 4, 5)
Simplify the following Boolean functions using four-variable maps. a. F(A, B, C, D) - (4, 6,7, 15) b. F(A, B,C, D) = E (3,7, 11, 13, 14, 15) c. F(A, B,C, D) = (0, 1,2, 4, 5, 7, 11, 15) d. F(A, B, C, D) = (0, 2, 4, 5, 6, 7,8, 10, 13, 15) %3D %3D
3.15 Simplify the following Boolean function F, together with the don't-care conditions d, and then express the simplified function in product of sums form: (c) F(A, B, C, D) = Σ(5, 6, 7, 12, 14, 15,) (d) d(A, B, C, D) = Σ(3, 9, 11, 15) F(A, B, C, D) = Σ(4, 12, 7, 2, 10,) d(A, B, C, D) = Σ(0,6,8)
For each of the following regular expressions over Σ = {a, b}, state 5 strings that are in the language of the regular expression, and 5 strings that are not. 1. (a∗b)∗|a∗2. (Σ∗aaΣ∗)|(Σ∗bbΣ∗)|(ab)∗|(ba)∗|a|b
6. Simplify the following Boolean function F, together with the don't-care conditions d, and then express the simplified function in sum-of-minterms form: a. F (A, B, C, D) =Em (0, 1, 4, 7, 12, 13, 14) +E d (2,3,10,11) b. F(A, B, C, D )= IIM(1, 3, 4, 6, 8, 12, 13, 15). IId (0,2,7,11)
Simplify the following Boolean functions, using three-variable K-maps: F(x, y, z)=Σ(1, 2, 3, 7)
1. Consider L = {u E E* | u = 1....0n, n EN and for all i, o; + 0;+1}, ie u e L iff no two consecutive characters are the same. (a) Construct a regular TM M that recognizes L. (b) Prove the correctness of your construction.
2. Matrix Quantum Mechanics. Use python matrix and algebraic tools for this problem. Consider orthogonal vectors [1], [2) and [3). The operators C and P are represented by C = /C₁ 00 0 C₂ 0 0 0 C3. /P₁ 0 0 P = 0 0 P2 0 P3 Where all quantities are real. a) Do the operators C and P commute? b) Find the eigenvalues and normalized eigenvectors of the given operators.
4. Karnaugh Maps Simplify parts a through d using Karnaugh maps a) F(x.y.)-Σ(0,2,4,5) b) F(x,y,z)=x'y'+yz+x'yz' c) F(w,x,y,z)=E(2,3,12,13,14,15) d) x'z+w'xy'+w(x'y+xy') e) Find minterms of xy+yz+xy'z by plotting it in a Karnaugh map. f) Find all the prime implicants of F (w, x, y, z)=E(0, 2, 4, 5, 6, 7, 8, 10, 13, 15) Determine which are essential. g) Simplify F (A, B, C, D)=E(1, 3, 4, 5, 10, 11, 12, 13, 14, 15) using essential prime implicants.