University of Florida EEL 3701 Fall 1996 Dr. Eric M. Schwartz

Similar documents
University of Florida EEL 3701 Fall 2014 Dr. Eric. M. Schwartz Department of Electrical & Computer Engineering Wednesday, 15 October 2014

University of Florida EEL 3701 Summer 2015 Dr. Eric. M. Schwartz Department of Electrical & Computer Engineering Tuesday, 30 June 2015

Please read carefully. Good luck & Go Gators!!!

Philadelphia University Student Name: Student Number:

Number System. Decimal to binary Binary to Decimal Binary to octal Binary to hexadecimal Hexadecimal to binary Octal to binary

CSE 140 Midterm I - Solution

Midterm Examination # 1 Wednesday, February 25, Duration of examination: 75 minutes

UNIVERSITI TENAGA NASIONAL. College of Information Technology

Experiment 7: Magnitude comparators

CprE 281: Digital Logic

Lecture 2 Review on Digital Logic (Part 1)

Overview. Multiplexor. cs281: Introduction to Computer Systems Lab02 Basic Combinational Circuits: The Mux and the Adder

Cs302 Quiz for MID TERM Exam Solved

Computer Science Final Examination Friday December 14 th 2001

Fundamentals of Digital Design

Unit 3 Session - 9 Data-Processing Circuits

Why digital? Overview. Number Systems. Binary to Decimal conversion

CHAPTER 7. Solutions for Exercises

Philadelphia University Student Name: Student Number:

Signals and Systems Digital Logic System

ECE 250 / CPS 250 Computer Architecture. Basics of Logic Design Boolean Algebra, Logic Gates

Chapter 7 Logic Circuits

This form sometimes used in logic circuit, example:

EXPERIMENT #4: SIMPLIFICATION OF BOOLEAN FUNCTIONS

Digital Logic (2) Boolean Algebra

ECE/CS 250 Computer Architecture

S C F F F T T F T T S C B F F F F F T F T F F T T T F F T F T T T F T T T

211: Computer Architecture Summer 2016

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

3. Complete the following table of equivalent values. Use binary numbers with a sign bit and 7 bits for the value

EEE130 Digital Electronics I Lecture #4

CHAPTER1: Digital Logic Circuits Combination Circuits

Lecture 5: NAND, NOR and XOR Gates, Simplification of Algebraic Expressions

Menu. Review of Number Systems EEL3701 EEL3701. Math. Review of number systems >Binary math >Signed number systems

Logic Simplification. Boolean Simplification Example. Applying Boolean Identities F = A B C + A B C + A BC + ABC. Karnaugh Maps 2/10/2009 COMP370 1

ECE/CS 250: Computer Architecture. Basics of Logic Design: Boolean Algebra, Logic Gates. Benjamin Lee

Boolean Algebra and Digital Logic 2009, University of Colombo School of Computing

Read this before starting!

Simplifying Logic Circuits with Karnaugh Maps

Binary addition example worked out

MC9211 Computer Organization

'XNH8QLYHUVLW\ (GPXQG73UDWW-U6FKRRORI(QJLQHHULQJ. ECE 110 Fall Test I. Michael R. Gustafson II

Menu. Binary Adder EEL3701 EEL3701. Add, Subtract, Compare, ALU

Chapter 2. Digital Logic Basics

CS1800 Discrete Structures Fall 2017 October, CS1800 Discrete Structures Midterm Version A

CHAPTER 7. Exercises 17/ / /2 2 0

Read this before starting!

Introduction to Karnaugh Maps

Logic Design. Chapter 2: Introduction to Logic Circuits

Implementation of Boolean Logic by Digital Circuits

ENEL Digital Circuit Design. Final Examination

SAMPLE ANSWERS MARKER COPY

Read this before starting!

Computer Organization I Test 1/Version 1 CMSC 2833 Autumn 2007

Hakim Weatherspoon CS 3410 Computer Science Cornell University

Lecture 6: Manipulation of Algebraic Functions, Boolean Algebra, Karnaugh Maps

Total Time = 90 Minutes, Total Marks = 50. Total /50 /10 /18

Systems I: Computer Organization and Architecture

EECS150 - Digital Design Lecture 19 - Combinational Logic Circuits : A Deep Dive

Written reexam with solutions for IE1204/5 Digital Design Monday 14/

ELCT201: DIGITAL LOGIC DESIGN

1 Boolean Algebra Simplification

Written exam for IE1204/5 Digital Design with solutions Thursday 29/

School of Computer Science and Electrical Engineering 28/05/01. Digital Circuits. Lecture 14. ENG1030 Electrical Physics and Electronics

Combinational Logic. By : Ali Mustafa

Chapter 3 Combinational Logic Design

EECS 270 Midterm 2 Exam Answer Key Winter 2017

2 Application of Boolean Algebra Theorems (15 Points - graded for completion only)

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

Read this before starting!

Numbers & Arithmetic. Hakim Weatherspoon CS 3410, Spring 2012 Computer Science Cornell University. See: P&H Chapter , 3.2, C.5 C.

Part 1: Digital Logic and Gates. Analog vs. Digital waveforms. The digital advantage. In real life...

Karnaugh Map & Boolean Expression Simplification

ECE 2300 Digital Logic & Computer Organization

CpE358/CS381. Switching Theory and Logical Design. Summer

We are here. Assembly Language. Processors Arithmetic Logic Units. Finite State Machines. Circuits Gates. Transistors

ENEL Digital Circuits Final Examination

Laboratory II. Exploring Digital Logic

ELECTRONICS & COMMUNICATION ENGINEERING PROFESSIONAL ETHICS AND HUMAN VALUES

ENGG 1203 Tutorial_9 - Review. Boolean Algebra. Simplifying Logic Circuits. Combinational Logic. 1. Combinational & Sequential Logic

Computer Science 324 Computer Architecture Mount Holyoke College Fall Topic Notes: Digital Logic

Boolean algebra. Examples of these individual laws of Boolean, rules and theorems for Boolean algebra are given in the following table.

Prove that if not fat and not triangle necessarily means not green then green must be fat or triangle (or both).

Numbers and Arithmetic

CMSC 313 Lecture 17. Focus Groups. Announcement: in-class lab Thu 10/30 Homework 3 Questions Circuits for Addition Midterm Exam returned

Digital Electronics Final Examination. Part A

Theory of Logic Circuits. Laboratory manual. Exercise 1

Binary logic consists of binary variables and logical operations. The variables are

DESIGN AND IMPLEMENTATION OF ENCODERS AND DECODERS. To design and implement encoders and decoders using logic gates.

CS1800 Discrete Structures Spring 2018 February CS1800 Discrete Structures Midterm Version A

1.10 (a) Function of AND, OR, NOT, NAND & NOR Logic gates and their input/output.

Section 001. Read this before starting!

Z = F(X) Combinational circuit. A combinational circuit can be specified either by a truth table. Truth Table

Boolean Algebra & Digital Logic

Unit 2 Session - 6 Combinational Logic Circuits

Save from: cs. Logic design 1 st Class أستاذ المادة: د. عماد

Chapter 1: Logic systems

Philadelphia University Faculty of Engineering

CSCI 220: Computer Architecture-I Instructor: Pranava K. Jha. BCD Codes

MODULAR CIRCUITS CHAPTER 7

Transcription:

Page 1/8 fpinstructions: Show all work on the front of the test papers. If you need more room, make a clearly indicated note on the front of the page, "MORE ON BACK", and use the back. The back of the page will not be graded without an indication on the front. You may not use any notes, HW, labs, other books, or calculators. You must pledge and sign this page in order for a grade to be assigned. This exam counts for at least 20%. of your total grade (13.3% if you fail to take one of the 3 exams). Put your name at the top of each test page and be sure your exam consists of 8 distinct pages. Read each question carefully and follow the instructions. Boolean expression answers must be in lexical order. Good luck! PLEDGE: On my honor as a University of Florida student, I certify that I have neither given nor received any aid on this examination, nor I have seen anyone else do so. PRINT YOUR NAME SIGN YOUR NAME DATE COMMENTS, FEEDBACK, or any special instructions for the professor: Page Available Points 1 0 0 2 7 3 14 4 10 5 25 6 15 7 16 8 12 TOTAL 100

Page 2/8 [7%] 1. Your beloved uncle s favorite number is 37. You therefore decide to make him a box to contain his birthday present for his 37 th birthday. The important thing is not what is in the 2 min box, but the box itself. Since Uncle Henry is an eccentric math professor, you decide to use your new knowledge of number systems to create a box lock using only the number 37 in the combination. The trick is to use varying representations of this number. (4%) a) Determine the hexadecimal, octal, binary, and BCD representations of the decimal number 3 min 37.37. (Only two digits to the right of the point are required.) Binary: Octal: Hex: BCD: (3%) b) Determine the 8-bit signed magnitude, 1 s complement, and 2 s complement representations of the decimal number -37. 2 min Signed Mag: 1 s Comp: 2 s Comp: You can now design your lock using all the above numbers. Let s see how sharp Uncle Henry really is!

Page 3/8 [6%] 2. Your new boss, Mr. Cliff Claven, has a problem with truth (tables). Please determine the 3 min canonical SOP or POS (no minimization) for each of the outputs in below truth table. S A M D I N 0 0 0 0 0 1 0 0 0 1 0 1 0 0 1 0 1 1 0 0 1 1 0 0 0 1 0 0 0 0 0 1 0 1 0 1 0 1 1 0 0 1 0 1 1 1 1 1 1 0 0 0 0 1 1 0 0 1 0 1 1 0 1 0 0 1 1 0 1 1 0 1 1 1 0 0 0 1 1 1 0 1 0 0 1 1 1 0 0 1 1 1 1 1 1 1 I = N = [8%] 3. Simplify the below Boolean expression using Boolean algebra. 5 min Z = AC( B + D) + B D + C Z =

Page 4/8 [10%] 4. Answer the following questions for the below equation: (6%) a) Determine the MSOP and MPOS. Use the below Karnaugh maps (K-maps) to solve this 4 min problem. BC A W = ( A + B + C ) ( A + B + C) ( A + B + C ) BC A W MSOP = W MPOS = W MSOP W MPOS (4%) b) The only signals available for implementing the design are A, B, and C, i.e., no 3 min complement terms are available. Which solution costs less? Justify your answer by drawing a circuit for each of the above two designs. Minimum cost (circle one): MSOP MPOS

Page 5/8 [10%] 5. Determine the equation implemented with this circuit. Do not minimize the equation. It is 3 min not necessary to put the equation in lexical order. Label the mixed-logic equation at each intermediate signal on this circuit. X = [15%] 6. Directly implement the below equation with a mixed-logic circuit 5 min diagram. Use only gates on 74 02 chips (shown to the right). Label all gates and pin numbers as you should be doing in lab. Pick whatever activation levels you want for the inputs, but make the output Y activelow. A( ) B( ) Y = ( A * B * C + D) E F C( ) D( ) Y(L) E( ) F( )

Page 6/8 [15%] 7. You are trapped on an island with a couple of sailors, an actress, a wealthy elderly couple, and 3 min a farm girl. You have 1100 meters of wire, all the TTL chips you can possibly use, several power supplies, 37 binary switches, and several Prototype Boards.. (The electronic components washed up on shore along with a space capsule after a particularly bad storm.) You need to transmit seven binary signals (outputs of the seven binary switches shown below left) from the beach lookout point to the camp, 200 meters away. The camp has 7 active-low lights which should indicate which, if any, of the 7 switches were pressed. Design a circuit to accomplish this task. Mark each long wire with its length to be sure you don t need more than the available 1100 meters. Label each chip with its name (number not necessary), e.g., MUX, XOR, etc.. 7 min SW0 Beach side Camp Side Light_0 SW1 Light_1 SW2 Light_2 SW3 Light_3 SW4 Light_4 SW5 Light_5 SW6 Light_6

Page 7/8 [10%] 8. Design a complete circuit to implement the below equation. You may use only one single 4 min chip (that has been discussed in this course). You do not need to know the chip number. Both active-high and active-low versions of all inputs are available. Label the activation level of all signals, e.g., A(L) or B(H). The output may be active-high or active-low. Do not simplify the equation. T = AB + B C + ABC [6%] 9. Analyze this open-collector circuit. (3%) a) Determine the equation for Z active-low. 1 min (3%) b) What is the equation if you interpret Z as active-high? 1 min Z(L) = Z(H) =

Page 8/8 [6%] 10. Attach the appropriate input and output devices to the below two gates so that you can 2 min demonstrate each of their functions using purely mixed-logic in LogicWorks. These are the available library of parts you may use for the above problem: [6%] 11. Use as many of the gates to the right as necessary to implement the function: 2 min The inputs are all active-high and the output is active-high. L(H) H = EL + LP E(H) H(H) P(H)