f0 = 0
f1 = 1
f2 = 0
f3 = 0
f4 = 0
f5 = 0
f6 = 1
f7 = 0
f8 = 0
f9 = 0
f10 = 0
f11 = 1
f12 = 1
f13 = 0
f14 = 1
f15 = 1
DI Question 6 2 pts Consider the following Truth table 000 0| 0 000 11 00 10| 0 00 1 11 0100|1 01 0 11 0 01 1 0 | 0 01 1 1| 0 100 0 | 0 100 1| 1 10 1010 10 1 1| 1 11 001 O 11 0 1 1 0 Fill the followi...
13. Consider the following Truth Table, Boolean Equation, and K-map. Would you change anything? 5 pts AB 11 10 0 ABCABC ABC ABC 1ABC ABC ABC ABc 00 01 Truth Table K-Map A B CY AB 01 10 10 1 0 0 00 01 11 10 0 0 10 0 1 01 0 1 11 1 0 0 0 1 0 10 Y = AB + BC
4. Convert the following regular expressions to e-NFA's. (a) 1(0110)0(11 10) (b) (000)(011+001) (111) (c) (01 10(00 11)(1 10 100)
Note that for the following question you should use technology to do the matrix calculations. Consider a graph with the following adjacency matrix: 0100 0 1 110011 0 01 0 11 00 0 11 1 01 1 10 0 Assuming the nodes are labelled 1,2,3,4,5,6 in the same order as the rows and columns, answer the folllowing questions: (a) How many walks of length 2 are there from node 4 to itself? (b) How many walks of length 3 are...
Question 2 1 pts Consider the following function f(x.y.z) = y2 + xy + xyz Fill in the following K-map yz Ix 00 Select 14 Select) f, Select] 15 [Select) 1. Select) fy [Select 12 Select) to [Select) D Question 3 1 pts Consider the following function w (J.K) = (1+k") (i+j) Fill in the following K-map [Select] [Select] wi [Select) [Select] Select) [Select] Select] Select]
3. (10 pts, Ch 2 & 6.2] For the 8X1 MUX below, complete the following: a. [4 points, Ch 2] Fill in the truth table. 8x1 ABCD | 0 0 0 0 0 0 1 0 0 101 0011 0 1 0 0 0 1 0 1 0 1 100 01111 1000 1 0011 1010 1 0 1 1 1100 11 01 AB.CD) MUX s2 s1 s0 b. (3 points, Ch 6.2] Using the blank K-map below, provide the Minimized...
Simplify the following K-map: F(A,B,C,D,E) = 2(0,1,2,3,8,10,13,15,16,17,18,19,24,26,29) A=0 00 01 11 A=1 DE BC0001 11 10 10
AB 00 01 11 10 CD 00 0 0 4 1 12 1 8 1 01 1 1 5 1 13 1 9 1 11 3 1 7 0 15 0 11 0 10 2 0 6 0 14 0 10 1 Simplify F(A, B, C, D) using the zeros of the k-map to get F`, then use De Morgan’s formula to get F in product of sums and select the one that matches it from the following; a-...
use ‘ for not Question 2 Given the following Truth Table: Inputs AB Outputs X 00 0 1 11 1. Construct a K-Map on Scrap Paper 2. Perform Grouping on Scrap Paper 3. Give the SIMPLEST Boolean Expression for x in the answer box below. Note: Do not include "x="in your answer it will be marked wrong
(1 point) Consider the following Gauss-Jordan reduction 1 0 0 200 → -2 0 01-11 00|→ 9 1 01 .10 1 01-1 E1A E2E1A E4E3E2E1A Find E2 as a product AEE E of elementary matrices 2 0 0 Write A as a product A- E EE'Eof elementary matrices 1 2 3 4 91 31
(a) The truth table below shows a certain function F(P,Q,R,S). Implement the function F using an 8:1 multiplexer, without any other logic gate. Only the constants 0 and 1, and the literals (but not their complements) are available. Fill in the inputs in the multiplexer diagram. (b). Implement the function F using a 24 decoder and a 4:1 multiplexer, and at most one logic gate. Only the constants 0 and 1, and the literals (but not their complements) are available....