Last Name Student Number. Last Name Student Number

Similar documents
University of Toronto Faculty of Applied Science and Engineering Edward S. Rogers Sr. Department of Electrical and Computer Engineering

University of Toronto Faculty of Applied Science and Engineering Edward S. Rogers Sr. Department of Electrical and Computer Engineering

Chapter 3. Gate-Level Minimization. Outlines

ENEL 353: Digital Circuits Midterm Examination

EECS150, Fall 2004, Midterm 1, Prof. Culler. Problem 1 (15 points) 1.a. Circle the gate-level circuits that DO NOT implement a Boolean AND function.

QUESTION BANK FOR TEST

Experiment 3: Logic Simplification

Experiment 4 Boolean Functions Implementation

University of Toronto Mississauga. Flip to the back cover and write down your name and student number.

ENEL Digital Circuits Midterm Examination

Chapter 2 Combinational Logic Circuits

Assignment (3-6) Boolean Algebra and Logic Simplification - General Questions

Ch. 5 : Boolean Algebra &

LSN 4 Boolean Algebra & Logic Simplification. ECT 224 Digital Computer Fundamentals. Department of Engineering Technology

PART 1. Simplification Using Boolean Algebra

Chapter 2. Boolean Expressions:

Summary. Boolean Addition

Code No: R Set No. 1

University of Toronto Faculty of Applied Science and Engineering Department of Electrical and Computer Engineering Final Examination

UNIVERSITY OF TORONTO FACULTY OF APPLIED SCIENCE AN:p ENGINEERING. ECE241F - Digital Syst~ms Final Examination

Department of Electrical Engineering McGill University ECSE 221 Introduction to Computer Engineering Assignment 2 Combinational Logic

Chapter 2 Combinational

CprE 281: Digital Logic

Boolean Analysis of Logic Circuits

Final Examination (Open Katz, asynchronous & test notes only, Calculators OK, 3 hours)

Gate-Level Minimization

Code No: R Set No. 1

Combinational Digital Design. Laboratory Manual. Experiment #3. Boolean Algebra Continued

Code No: R Set No. 1

EEE130 Digital Electronics I Lecture #4_1

Student Number: UTORid: Question 0. [1 mark] Read and follow all instructions on this page, and fill in all fields.

Philadelphia University Student Name: Student Number:

Combinational Circuits Digital Logic (Materials taken primarily from:

Bawar Abid Abdalla. Assistant Lecturer Software Engineering Department Koya University

DKT 122/3 DIGITAL SYSTEM 1

ECE 152A LABORATORY 2

ELCT201: DIGITAL LOGIC DESIGN

Chapter 3. Boolean Algebra and Digital Logic

2008 The McGraw-Hill Companies, Inc. All rights reserved.

Combinational Logic Circuits

Gate-Level Minimization

Simplification of Boolean Functions

CENG 241 Digital Design 1

Final Exam Solution Sunday, December 15, 10:05-12:05 PM

SIR C.R.REDDY COLLEGE OF ENGINEERING, ELURU DEPARTMENT OF INFORMATION TECHNOLOGY LESSON PLAN

INDIAN INSTITUTE OF TECHNOLOGY KHARAGPUR Stamp / Signature of the Invigilator

Section 001. Read this before starting!

Dr. S. Shirani COE2DI4 Midterm Test #1 Oct. 14, 2010


Bawar Abid Abdalla. Assistant Lecturer Software Engineering Department Koya University

1. Mark the correct statement(s)

Digital Logic Design (CEN-120) (3+1)

EPC6055 Digital Integrated Circuits EXAM 1 Fall Semester 2013

BOOLEAN ALGEBRA. Logic circuit: 1. From logic circuit to Boolean expression. Derive the Boolean expression for the following circuits.

Gate-Level Minimization

Points Addressed in this Lecture. Standard form of Boolean Expressions. Lecture 4: Logic Simplication & Karnaugh Map

EECS 270 Midterm Exam

數位系統 Digital Systems 朝陽科技大學資工系. Speaker: Fuw-Yi Yang 楊伏夷. 伏夷非征番, 道德經察政章 (Chapter 58) 伏者潛藏也道紀章 (Chapter 14) 道無形象, 視之不可見者曰夷

University of Technology

ELCT201: DIGITAL LOGIC DESIGN

Code No: 07A3EC03 Set No. 1

Gate Level Minimization Map Method

ENGIN 112 Intro to Electrical and Computer Engineering

VALLIAMMAI ENGINEERING COLLEGE. SRM Nagar, Kattankulathur DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING EC6302 DIGITAL ELECTRONICS

DIGITAL ELECTRONICS. P41l 3 HOURS

EECS 140/141 Introduction to Digital Logic Design Fall Semester 2016 Exam #1 Date: 3 October 2016

Redundant States in Sequential Circuits

Homework. Update on website issue Reading: Chapter 7 Homework: All exercises at end of Chapter 7 Due 9/26

Gate-Level Minimization. BME208 Logic Circuits Yalçın İŞLER

PART B. 3. Minimize the following function using K-map and also verify through tabulation method. F (A, B, C, D) = +d (0, 3, 6, 10).

Digital Logic Lecture 7 Gate Level Minimization

1. Fill in the entries in the truth table below to specify the logic function described by the expression, AB AC A B C Z

9/10/2016. The Dual Form Swaps 0/1 and AND/OR. ECE 120: Introduction to Computing. Every Boolean Expression Has a Dual Form

problem maximum score 1 10pts 2 8pts 3 10pts 4 12pts 5 7pts 6 7pts 7 7pts 8 17pts 9 22pts total 100pts

LAB #3: ADDERS and COMPARATORS using 3 types of Verilog Modeling

Lecture 4: Implementation AND, OR, NOT Gates and Complement

University of California, Davis Department of Electrical and Computer Engineering. Lab 1: Implementing Combinational Logic in the MAX10 FPGA

Midterm Exam Review. CS 2420 :: Fall 2016 Molly O'Neil

Logic Gates and Boolean Algebra ENT263


CprE 281: Digital Logic

Boolean Logic CS.352.F12

Software Engineering 2DA4. Slides 2: Introduction to Logic Circuits

R07

C A R L E T O N U N I V E R S I T Y. FINAL EXAMINATION April Duration: 3 Hours No. of Students: 108

LAB #1 BASIC DIGITAL CIRCUIT

Simplification of Boolean Functions

A3 A2 A1 A0 Sum4 Sum3 Sum2 Sum1 Sum

Injntu.com Injntu.com Injntu.com R16

IT 201 Digital System Design Module II Notes

Slide Set 5. for ENEL 353 Fall Steve Norman, PhD, PEng. Electrical & Computer Engineering Schulich School of Engineering University of Calgary

CHAPTER-2 STRUCTURE OF BOOLEAN FUNCTION USING GATES, K-Map and Quine-McCluskey

Written exam for IE1204/5 Digital Design Thursday 29/

Department of Electrical and Computer Engineering University of Wisconsin - Madison. ECE/CS 352 Digital System Fundamentals.

Section 001. Read this before starting! You may use one sheet of scrap paper that you will turn in with your test.

CS/ECE 252: INTRODUCTION TO COMPUTER ENGINEERING UNIVERSITY OF WISCONSIN MADISON

Boolean Algebra. BME208 Logic Circuits Yalçın İŞLER

CS8803: Advanced Digital Design for Embedded Hardware

CE161-4-AU UNIVERSITY OF ESSEX. Undergraduate Examinations 2014 DIGITAL SYSTEMS ARCHITECTURE. Time allowed: TWO hours

Chapter 2 Combinational Logic Circuits

Transcription:

University of Toronto Faculty of Applied Science and Engineering Department of Electrical and Computer Engineering Midterm Examination ECE 241F - Digital Systems Wednesday October 13, 2004, 6:00pm [5] Q1. For the below circuit, write the minimal sum of products form of the logic function of f 1 and f 2 in terms of x 1, x 2, and x 3. Duration: 90 minutes Examiners: S Brown, J. Rose, K. Truong and B. Wang ANSWER ALL QUESTIONS ON THESE SHEETS, USING THE BACK SIDE IF NECESSARY. 1. No calculator and no cellphones are allowed. 2. The number of marks available for each question is indicated in the square brackets []; each portion of a question also shows how many marks are allocated to it. 3. There are two extra blank pages at the end of the test for rough work. AID ALLOWED: The Course Textbook, Fundamentals of Digital Logic with Verilog Design. Last Name: First Name: Student Number: Lecture Section: Section 01 (Rose) [ ] Section 02 (Wang) [ ] Section 03 (Brown) [ ] Section 04 (Truong) [ ] Total Available Marks: Question 1 2 3 4 5 6 7 8 9 Total Marks 5 6 5 9 5 10 6 5 4 55 Available Marks Achieved Page 1 of 15 Page 2 of 15

[6] Q2 In Section 2.1 of the textbook, circuits that turn a simple light, L, on or off are used to illustrate some basic logic functions. This questions involves some similar circuits with switches controlled by inputs x, y, or z, or the constant values 0 or 1. A switch controlled by 0 is turned off, and a switch controlled by 1 is turned on. [2] (a) Consider the circuit diagram shown below. You are to write a logic expression, in sum of products form, for the function L, where L is 1 when the light is on and 0 when the light is off. Higher marks will be given for determining the simplest SOP expression possible. Q2, continued [2] (b) Consider the circuit diagram shown below. You are to write a logic expression in products of sums form for the function L. Higher marks will be given for the simplest POS expression possible. ANSWER (it is not necessary to show the steps used to derive your answer): ANSWER (it is not necessary to show the steps used to derive your answer): Page 3 of 15 Page 4 of 15

Q2, continued [2] (c) Consider the circuit diagram shown below. You are to write a logic expression in sum of products form for the function L. Higher marks will be given for the simplest SOP expression possible. [5] Q3. Short answer, lab-related questions. [0.5] (a) When using Quartus to design a circuit with the block/schematic editor, is it necessary to also provide to Quartus the equivalent Verilog code before you can successfully compile the schematic? CIRCLE YES NO [1] (b) What is the purpose of the logic probe in the lab? [2] (c) What is wrong with the following circuit? State why it is wrong. a b c f ANSWER (it is not necessary to show the steps used to derive your answer): d e Page 5 of 15 Page 6 of 15

Question 3, continued [1.5] (d) Observe the following output from the Quartus simulator, which shows a simulation of a digital circuit with inputs A and B and output F: [9] Q4 For this question you are to use algebraic manipulation to produce minimum sum-of-products or product-of-sums expressions. You need to show your work and the steps that are being used in your solution. Higher marks will be given for solutions that apply the theorems and identities of Boolean algebra in as few steps as possible. So, you are to show all of your steps, but don t use more steps than needed. [3] (a) Use Boolean algebra to minimize the following expression. Your final answer should be the minimal SOP form for this function. f = xy + ( x + y)( x + z)( x + y + z) [0.5] (i) Which of the two types of simulation possible is being used? [1] (ii) What is the function of the logic gate being simulated? Page 7 of 15 Page 8 of 15

Question 4, continued [3] (b) Use Boolean algebra to minimize the following expression. Your final answer should be the minimal sum of products (SOP) form for this function. Question 4, continued [3] (c) Use Boolean algebra to minimize the following expression. Your final answer should be the minimal product of sums (POS) form for this function. f = x y z + x z + y z + x y z f = ( w + x + y)( w + x + y)( w + x + y)( w + x + y)( w + x + y + z) Page 9 of 15 Page 10 of 15

[5] Q5. Read this question carefully. You are to design a circuit that has 3 inputs, A, B and Clock, and one output, F. The output F should be the exclusive-or function of the signals A and B captured just prior to the falling edge (i.e. the 1 to 0 transition) of the signal Clock. You may use only AND, OR, NAND, NOR or NOT gates in your design, but you should present your design hierarchically meaning that you can show a repetitive part of your design as a separate group of gates enclosed by a box with a name, and then use that named box one or more times in the final design. [10] Q6. Consider the circuit shown below. Assume there is no propagation or clock-to-q delay in the latch, flipflop and gates. Draw the timing diagram showing A, B, Q L(latch), Q FF(flipflop) and C. Page 11 of 15 Page 12 of 15

[6] Q7. [2] (a) For the Karnaugh map shown below derive the minimum-cost sum-of-product (SOP) for the logic function f (a,b,c,d). ab 00 01 11 10 cd 00 1 1 1 1 01 0 0 0 1 11 0 0 0 0 10 1 0 0 1 [5] Q8. For the 2-level logic circuit given below, a b c d [1] (a) Write the logic expression g (a,b,c,d) in sum-of-products (SOP) form. g [4] (b) Implement the function f (a,b,c,d) using as few 2-input NAND gates as possible. Assume that both the true and complemented variables are available as inputs. [2] (b) Represent the function g (a,b,c,d) in the following K-map. ab cd 00 01 11 10 00 01 11 10 [2] (c) Derive the minimum-cost product-of-sums (POS) expression for g (a,b,c,d). Page 13 of 15 Page 14 of 15

[4] Q9. Draw the schematic diagram and derive the logic expressions for the output functions for the Verilog code given below. Be sure to label all wires using the same symbols as in the code. module simple_cct (x1, x2, x3, y1, y2); input x1, x2, x3; output y1, y2; assign y1 = x1 ^ x2 ^ x3; assign y2 = (x1 & x2) ((x1 ^ x2) & x3); endmodule GIVE SCHEMATIC HERE: GIVE EQUIVALENT LOGIC EXPRESSIONS FOR OUTPUTS y1 and y2 HERE: Page 15 of 15