CS2100 Computer Organisation Tutorial #8: MSI Components Answers to Selected Questions

Similar documents
Department of Electrical and Computer Engineering University of Wisconsin Madison. Fall

Digital Logic Design. Midterm #1

Background/Review on Numbers and Computers (lecture)

Bawar Abid Abdalla. Assistant Lecturer Software Engineering Department Koya University

EECS150 Homework 2 Solutions Fall ) CLD2 problem 2.2. Page 1 of 15

Student Name: University of California at Berkeley College of Engineering Department of Electrical Engineering and Computer Science

1. Mark the correct statement(s)

Menu. X + /X=1 and XY+X /Y = X(Y + /Y) = X

Digital Circuits ECS 371

Solutions to Tutorial 2 (Week 9)

Simplification of Boolean Functions

University of Technology

IT 201 Digital System Design Module II Notes

Digital Logic Design. Midterm #1

A B AB CD Objectives:

Chapter 2 Combinational Logic Circuits

ECE20B, Spring Final Exam lab questions.

Specifying logic functions

Digital Logic Design. Midterm #1

Department of Electrical Engineering and Computer Science MASSACHUSETTS INSTITUTE OF TECHNOLOGY Fall Test I Solutions

CprE 281: Digital Logic

Computer Organization and Levels of Abstraction

11.1. Unit 11. Adders & Arithmetic Circuits

4. Write a sum-of-products representation of the following circuit. Y = (A + B + C) (A + B + C)

ENGIN 112. Intro to Electrical and Computer Engineering

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

ECE 2030D Computer Engineering Spring problems, 5 pages Exam Two 8 March 2012

Combinational Circuits Digital Logic (Materials taken primarily from:

QUESTION BANK FOR TEST

Experiment 3: Logic Simplification

Date Performed: Marks Obtained: /10. Group Members (ID):. Experiment # 04. Boolean Expression Simplification and Implementation

Design of High Speed Mac Unit

211: Computer Architecture Summer 2016

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

Gate-Level Minimization

Programmable Logic Devices (PLDs)

Simplification of Boolean Functions

NATIONAL UNIVERSITY OF SINGAPORE CS2100 COMPUTER ORGANISATION

CHAPTER 12 REGISTERS AND COUNTERS

Gate Level Minimization Map Method

Combinational Logic Circuits Part III -Theoretical Foundations

Programmable Logic Devices

UNIT II. Circuit minimization

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

Experiment 7 Arithmetic Circuits Design and Implementation

Incompletely Specified Functions with Don t Cares 2-Level Transformation Review Boolean Cube Karnaugh-Map Representation and Methods Examples

Definitions Homework. Quine McCluskey Optimal solutions are possible for some large functions Espresso heuristic. Definitions Homework

Standard Boolean Forms

Logic Design (Part 2) Combinational Logic Circuits (Chapter 3)

Reading Object Code. A Visible/Z Lesson

Propositional Calculus. Math Foundations of Computer Science

Combinational Logic Circuits

COMBINATIONAL LOGIC CIRCUITS


Binary Adders: Half Adders and Full Adders

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

Austin Herring Recitation 002 ECE 200 Project December 4, 2013

Solutions for 3824 Midterm Exam 3/4/ Truth table. A B C Z

Reading Object Code. A Visible/Z Lesson

CSCI 220: Computer Architecture I Instructor: Pranava K. Jha. Simplification of Boolean Functions using a Karnaugh Map

Digital Logic Design. Final Examination

Chapter 3. Gate-Level Minimization. Outlines

Analysis of input and output configurations for use in four-valued CCD programmable logic arrays

McGILL UNIVERSITY Electrical and Computer Engineering Department MIDTERM EXAM

4 KARNAUGH MAP MINIMIZATION

Lecture 5. Chapter 2: Sections 4-7

SWITCHING THEORY AND LOGIC CIRCUITS

CSE370 TUTORIAL 3 - INTRODUCTION TO USING VERILOG IN ACTIVE-HDL

Chap-2 Boolean Algebra

ECE 2020B Fundamentals of Digital Design Spring problems, 6 pages Exam Two 26 February 2014

Gate-Level Minimization

Programmable Logic Devices. Programmable Read Only Memory (PROM) Example

Chapter 2 Combinational

Introduction. The Quine-McCluskey Method Handout 5 January 24, CSEE E6861y Prof. Steven Nowick

Course Project Part 1

CS/COE 0447 Example Problems for Exam 2 Spring 2011

CS8803: Advanced Digital Design for Embedded Hardware

(Refer Slide Time 3:31)

ece5745-pla-notes.txt

Date Performed: Marks Obtained: /10. Group Members (ID):. Experiment # 09 MULTIPLEXERS

Philadelphia University Faculty of Information Technology Department of Computer Science. Computer Logic Design. By Dareen Hamoudeh.

Mid-Term Exam Solutions

Circuit simplification examples

ELCT201: DIGITAL LOGIC DESIGN

1 Disjoint-set data structure.

Chapter 4. Combinational Logic

Digital Logic Design. Final Examination

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

ECE 2030B 1:00pm Computer Engineering Spring problems, 5 pages Exam Two 10 March 2010

Topics. FPGA Design EECE 277. Number Representation and Adders. Class Exercise. Laboratory Assignment #2

Combinational Logic & Circuits

PROGRAMMABLE LOGIC DEVICES

2.6 BOOLEAN FUNCTIONS

CMPUT101 Introduction to Computing - Summer 2002

Overview. EECS Components and Design Techniques for Digital Systems. Lec 16 Arithmetic II (Multiplication) Computer Number Systems.

Programmable Logic Devices

Lecture (05) Boolean Algebra and Logic Gates

EE292: Fundamentals of ECE

2. BOOLEAN ALGEBRA 2.1 INTRODUCTION

Review: Standard forms of expressions

Transcription:

C Computer Organisation Tutorial #8: MI Components Answers to elete Questions. Realize the following funtion with (a) an 8: multiplexer, an (b) a 4: multiplexer using the first input variables as the seletor inputs. (,, ) = M(, 5, 6) D(4) ou may write omplemente variables instea of rawing an inverter to erive it. If you have several hoies for your answer, hoose the simplest one (onstant logi values an are simpler than literals). ou may write x or for on t-are values. hat if we use the last input variables as the seletor inputs instea for the 4: multiplexer? Answers: is a -variable funtion, so there are = 8 rows in its truth table. Using an 8: multiplexer, we o not nee to ollapse any input; we just opy the values of iretly to the multiplexer inputs: 4 5 6 7 8: ' MU 4: MU e hoose over sine logi onstant is simpler than a literal. ' / ' To use a 4: multiplexer, we nee to ollapse the 8-row truth table to a 4-row table of multiplexer inputs (see table above). or simpliity sake, we hoose the most signifiant variables as our seletor lines (unless the instrution says otherwise), an the least signifiant variable as the input variable into the multiplexer. A7/8 emester - of 6 - C Tutorial #8 elete Answers

. Given the following zero-enable 4 eoer with negate outputs, how woul you implement the Boolean funtion J(,,,) = M(,, 6, 7) without any aitional logi gates? Answer: J(,,,) = M(,, 6, 7) = + ' (using K-map) = M 4 DC (' )' = + ' A7/8 emester - of 6 - C Tutorial #8 elete Answers

. [A/ emester xam question] ou are to esign a onverter that takes in 4-bit input ABCD an generates a -bit output GH as shown in Table below. Input Output A B C D G H Table JJJJ KKKK Table ou are given the following omponents: a. A Count- evie that takes in a 4-bit input an generates a -bit output CCC whih is the number of s in the input. or example, if =, then CCC = (or ). b. A Count- evie that takes in a 4-bit input an generates a -bit output CCC whih is the number of s in the input. or example, if =, then CCC = (or ).. A qua : multiplexer that takes in two 4-bit inputs JJJJ an KKKK, an irets one of the inputs to its output epening on its ontrol signal, as shown in Table above.. A 4-bit parallel aer that takes in two 4-bit unsigne binary numbers an outputs the sum. The blok iagrams of these omponents are shown below: Count- C C C Count- C C C Qua : MU J K Cin 4-bit aer Cout A7/8 emester - of 6 - C Tutorial #8 elete Answers

Given the above 4 omponents, you are to employ blok-level esign to esign the onverter, without using any aitional logi gate or other evies. ou may observe that if A =, then the output GH is simply the number of s in the input ABCD. ou are to make your own observation for the ase when A =. [Hint (not given in exam): ou nee only one of eah of the omponents. Complete the iagram below.] Key ieas:. If A = (or D = ), ount #s in ABCD.. If A = (or D = ), either A B C D Count- C C C Count- C C C a. #s + #s; or b. 4 + #s Cin 4-bit aer Cout a is implemente below. or b, try it yourself. Qua : MU J K G H A simpler solution without the nee of the 4-bit parallel aer is possible. Try it out yourself. A7/8 emester - 4 of 6 - C Tutorial #8 elete Answers

4. tuy the following iruit. rite out the sum-of-minterms form for (a,b,,) using the m notation. Re-implement (a,b,,) with the fewest number of 4 eoer with -enable an normal outputs, an at most two logi gates. (A solution with two eoers an one logi gate is rather straight-forwar. olutions that use more omponents than this are not aepte. There is a solution with one eoer an two logi gates, whih is harer to obtain. If you manage to get it, treat it as a bonus.) [Hint: Trae the iruit below to obtain the sum-of-minterms expression. Parts of the iruit have been trae for you.] a b 4 DC : MU ' (a' b') + (a' b) minterms,,6,7 : MU ' (a b') + (a b) minterms 8,9,4,5 b 4 DC : MU ' (b' ') + (b' ) minterms,8,, : MU ' (b ') + (b ) minterms 4,,7,5 Answer: (a,b,,) = m (,,,4,6,7,8,9,,,4,5) It is easier to think about implementing ' (whih is m(,5,,) or b' ' + b ' ), an then aing an inverter to invert it bak to. A7/8 emester - 5 of 6 - C Tutorial #8 elete Answers

b 4 DC (b' ') 4 DC b (' ) There are equivalent alternative solutions that rearrange the inputs b, an. Just hek that the output is still (b' ' + b ' )'. e aept suh solution with eoers an one logi gate, but not more. (Note that an inverter, if use, is ounte as a logi gate as well.) There is an even simpler iruit requiring only one eoer an two gates. Try this out yourself. A7/8 emester - 6 of 6 - C Tutorial #8 elete Answers