Graded quiz 2
Question 1 We want to use a ROM memory to implement a digital circuit that receives two 2-bit numbers X and Y (X=x1x0, Y=y1y0) and detects whether X is greater (G=1), lower (L=1) or equal (E=1) to Y. What information must be stored in the memory address words 0001 and 1100? Note: The most significant bit of the address bus is x1.
001, 101
Question 2 Let f(a,b,c,d,e) be a Boolean function. Identify which expression corresponds to the minterm 18 (m18) of the function.
a.-b.-c.d.-e
Question 3 Note: You will need to use VerilUOC_Desktop to answer this question. Please, complete the module "VerilUOC_Desktop tools", inside this week 2, before performing this exercise. Minimize the Boolean function as a sum of products of literals: Not Fixed Instructions to answer this question 1) In the virtual machine, open VerilUOC_Desktop, click on “Simulate”->”Verification” and then click on the BoolMin tab. 2) In "Module", select "Graded Exercises" and click on exercise <Variable>. Enter the minimized Boolean expression. 3) BoolMin returns a 4 uppercase letters code. Type it in the answer box.
Variable: 2.3.aGTRA
LURA
HZRA
Question 4 Note: You will need to use VerilUOC_Desktop to answer this question. Please, complete the module "VerilUOC_Desktop tools", inside this week 2, before performing this exercise. Draw a digital circuit that implements the following Boolean function (do not simplify the function): Not Fixed Inputs and outputs must be named respectively as a, b, c,d and f; all of them lower case. Instructions to answer this question 1) In the virtual machine, open VerilUOC_Desktop and draw the circuit. 2) Click on “Simulate”->”Verification” and then click on the VerilCirc tab. 3) In "Module" select "Graded Exercises" and click on exercise <Variable>. 4) VerilCirc returns a 4 uppercase letters code. Type it in the answer box.
Variable: 2.4.aCTFR
NA
BUEZ
Question 5 Note: You will need to use VerilUOC_Desktop to answer this question. Please, complete the module "VerilUOC_Desktop tools", inside this week 2, before performing this exercise. Write the Boolean expression implemented by the following circuit (do not simplify the function): Not Fixed Instructions to answer this question 1) In the virtual machine, open VerilUOC_Desktop, click in “Simulate” -> ”Verification” and then click in the BoolMin tab. 2) In "Module" select "Graded Exercises" and click on exercise <Variable>. Enter the Boolean expression. 3) VerilCirc returns a 4 uppercase letters code. Type it in the answer box.
Variable: 2.5.aZWRZ
NA
NA
Question 6 Questions 6, 7 and 8 are interrelated and aim to see how Boolean algebra allows us to obtain simple combinational circuits. Identify which of the Boolean expressions below implements the following circuit:
Question 7 Note: You will need to use VerilUOC_Desktop to answer this question. Please, complete the module "VerilUOC_Desktop tools", inside this week 2, before performing this exercise. Questions 6, 7 and 8 are interrelated and aim to see how Boolean algebra allows us to obtain simple combinational circuits. Simplify the boolean function obtained in the previous question as a sum of products of literals. Instructions to answer this question 1) In the virtual machine, open VerilUOC_Desktop, click in “Simulate”->”Verification” and then click in the BoolMin tab. 2) In "Module", select "Graded Exercises" and click on exercise <Variable>. Enter the minimized Boolean expression. 3) BoolMin returns a 4 uppercase letters code. Type it in the answer box.
Variable: 2.7.aNA
HDRB
Question 8 Questions 6, 7 and 8 are interrelated and aim to see how Boolean algebra allows us to obtain simple combinational circuits. Draw the circuit that implements the minimized Boolean expression obtained in question 6 and indicate how many AND, OR and INV gates are required. There is no restriction in the number of inputs of the AND and OR gates, use gates with as many inputs as you need. Write the answer as 3 integer numbers separated by a whitespace, in this order: number of AND gates, number of OR gates and number of inverters. For instance, if 4 AND gates, 1 OR and 3 inverters were required, the answer should be 4 1 3 See how this circuit, equivalent to the one in question 6, requires fewer gates than the original.
3 1 1