Q.1. Using algebraic manipulation, simplify the following expressions to minimum number of literals and express the simplified function as SOP (sum of products i.e. AND terms that are ORed) and POS (product of sums i.e. OR terms that are ANDed): (i) F(A,B,C) = A'B'C' + A'BC + A'B'C + ABC (1) F(A,B,C) = (A+B+C) (A'+B'+C') (A+B'+C') (A+B+C') (ii) F(A,B,C,D) =A'B'D + A'D + BC (A' + D') (should be simplified to 5 literals only) (iii) F(A,B,C,D) = (A+B+C+D')•(A+B+C²+D')•(A+B²+C+D') (A+B'+C'+D') Hint: To convert a single product term to POS terms, OR with one of the variables in the term ANDed with its complement (e.g. AA', BB', CC' or DD'). This amounts to ORing with 0 which does not affect he expression).

Q.1. Using algebraic manipulation, simplify the following expressions to minimum number of literals and express the simplified function as SOP (sum of products i.e. AND terms that are ORed) and POS (product of sums i.e. OR terms that are ANDed): (i) F(A,B,C) = A'B'C' + A'BC + A'B'C + ABC (1) F(A,B,C) = (A+B+C) (A'+B'+C') (A+B'+C') (A+B+C') (ii) F(A,B,C,D) =A'B'D + A'D + BC (A' + D') (should be simplified to 5 literals only) (iii) F(A,B,C,D) = (A+B+C+D')•(A+B+C²+D')•(A+B²+C+D') (A+B'+C'+D') Hint: To convert a single product term to POS terms, OR with one of the variables in the term ANDed with its complement (e.g. AA', BB', CC' or DD'). This amounts to ORing with 0 which does not affect he expression).

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. Simplify the following functions using a K-map: g)F(X,Y,Z)=XY'Z+X'+Z+Y'Z'
Using the following variable bindings: (setq x ‘(a b c d)) (setq y ‘(1 2 3 4)) Using only variables x and y, car, cdr, and cons, use Lisp expressions to generate:
1. Reduce the following function: ((A O B)•(A•C) )•( (A•B) +(A © B) )
6. X is (a,b,c,d), Y is {1,2,3,4). {(a,1), (b,2), (c,2), (d,4)) is a function from X to Y.
[Unbalanced Rod] Given a set of n weights {w₁,..., wn} and a rod of length n - 1 inches, we can attach the weights to the rod at hooks placed at one inch distances apart as shown in the figure below. -1". /10 2 3 12 2 4 We can attach a weight to any hook but no two weights can be attached to the same hook and we have to attach all the weights. For any given assignment of weights to hooks, we can compute the location of the center of mass of the rod and the weights according to the following equation (neglecting the weights of the rod and the hooks). where 0 ≤ Pi≤n-1 is the position of weight along the rod. For example, in the figure shown above, the center of mass is computed as C= C = i Wi Pi Σi Wi 10 0+2 1+3·2+4·3+12.4 +2.5 10+2+3+4+12+2 78 33 The problem is to find an assignment of weights to hooks that makes the center of mass as far as possible to the left, i.e., minimize the value of c. Answer the following questions. 1. Describe a greedy algorithm that finds the assignments that…
B. Using Algebraic manipulation, simplify the following function. H(A.B,C,D)=( B + C )(A + D ) + D (AC+AB)
3) a) Given the Boolean equation X= ABC +ABC+ ABC + ABC +ĀBC with 8-cell map(K-map) answer the following questions À BC BC BC BC BC 1 A 1 = X i) What is the number of literals? ü) What is the number of min tems? i) Is the function a SOP or POS? iv) What is the number of variables in the function? v) Simplify X using the K-Map (vi) Draw the truth table for the function X = ABC + ABC + ABC. Use your truth table to draw the timing diagram for A, B, C and X +
3. Write down the results for each of the the following function applications; if any of them is erroneous, indicate what the problem is: 4) ] а. CAR[ (( () b. CDR[ (() 4) ] c. CONS[ (a), (b) ] d. NULL[ CDR[ (a) ] ] Note: NULL [] is a primitive function that returns T if its argument is NIL and otherwise returns NIL It is, effectively, the same as null?[] of Scheme.
Python only* Use recursive function*. Define concentricCircles with 4 parameters Use def to define concentricCircles with 4 parameters here is the specification for concentricCircles function: It draws a series of concentric circles, where the first parameter specifies the radius of the outermost circle, and the second parameter specifies the number of circles to draw. When viewed as nested rings, all rings should have the same thickness. The third and fourth parameters specify an outer color and an other color, respectively. The outer color is used for the outermost circle, and then every other circle in to the center alternates between that color and the other color. We will test both how many circles are drawn as well as whether the correct circles are drawn in the correct order. Hint: Each function call frame only needs to draw a single circle. Note that you must use the turtleBeads drawDot function to draw each circle Do not use any kind of loop Within the definition of…
Q1. [Lecture 5: Dynamic Programming] Draw the final Dynamic Programming table for computing the LCS of the two strings: ABCDE, BCBADE. Show all arrows. From this table find the LCS length, all possible LCSS, and show their reverse paths. (Similar to Slide 34 of Lecture 5).
Python only* Use recursive function*. Define concentricCircles with 4 parameters Use def to define concentricCircles with 4 parameters here is the specification for concentricCircles function: It draws a series of concentric circles, where the first parameter specifies the radius of the outermost circle, and the second parameter specifies the number of circles to draw. When viewed as nested rings, all rings should have the same thickness. The third and fourth parameters specify an outer color and an other color, respectively. The outer color is used for the outermost circle, and then every other circle in to the center alternates between that color and the other color. We will test both how many circles are drawn as well as whether the correct circles are drawn in the correct order. Hint: Each function call frame only needs to draw a single circle. Note that you must use the turtleBeads drawDot function to draw each circle Do not use any kind of loop Within the definition of…
Midterm Practice Problems 1. Use recursion to write a function count_ones that returns how many Is there are in a number n when represented in decimal (base 10). For example, 1231 has two 1s. You can assume that n is nonnegative and at most 9 digits long. Do not use global (or static) variables. In main perform at least three tests of count_ones and use assert to check that the returned value is correct. Your function should have the following prototype: // count_ones (n) returns the number of is in the decimal representation of n // requires: 0 <= n < 10^9 int count_ones (int n);