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

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

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

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

UNCA CSCI 255 Exam 1 Spring February, This is a closed book and closed notes exam. It is to be turned in by 1:45 PM.

Boolean Analysis of Logic Circuits

EECS 140/141 Introduction to Digital Logic Design Spring Semester 2017 Exam #1 Date: 27 February 2017

Announcements. Chapter 2 - Part 1 1

Read this before starting!

Read this before starting!

Chapter 2 Combinational Logic Circuits

Read this before starting!

2.6 BOOLEAN FUNCTIONS

Midterm Exam Thursday, October 24, :00--2:15PM (75 minutes)

ENEL 353: Digital Circuits Midterm Examination

Chapter 2. Boolean Expressions:

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

ECE 551 Digital System Design and Synthesis. Instructor: Kewal K. Saluja. Midterm Exam

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

Moodle WILLINGDON COLLEGE SANGLI. ELECTRONICS (B. Sc.-I) Introduction to Number System

1. Mark the correct statement(s)

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

Standard Boolean Forms

Combinational Logic Circuits Part III -Theoretical Foundations

Combinational Logic & Circuits

ELCT201: DIGITAL LOGIC DESIGN

Read this before starting!

CS/EE1012 INTRODUCTION TO COMPUTER ENGINEERING SPRING 2013 HOMEWORK I. Solve all homework and exam problems as shown in class and sample solutions

Bawar Abid Abdalla. Assistant Lecturer Software Engineering Department Koya University

KING FAHD UNIVERSITY OF PETROLEUM & MINERALS COMPUTER ENGINEERING DEPARTMENT

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

in this web service Cambridge University Press

Read this before starting!

ELCT201: DIGITAL LOGIC DESIGN

Gate-Level Minimization. section instructor: Ufuk Çelikcan

ENEL Digital Circuits Midterm Examination

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

TWO-LEVEL COMBINATIONAL LOGIC

Computer Sc. & IT. Digital Logic. Computer Sciencee & Information Technology. 20 Rank under AIR 100. Postal Correspondence

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

Philadelphia University Student Name: Student Number:

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

SWITCHING THEORY AND LOGIC CIRCUITS

Section 001. Read this before starting!

Lecture (04) Boolean Algebra and Logic Gates

Lecture (04) Boolean Algebra and Logic Gates By: Dr. Ahmed ElShafee

SYNERGY INSTITUTE OF ENGINEERING & TECHNOLOGY,DHENKANAL LECTURE NOTES ON DIGITAL ELECTRONICS CIRCUIT(SUBJECT CODE:PCEC4202)

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

Digital Design. Chapter 4. Principles Of. Simplification of Boolean Functions

B.Tech II Year I Semester (R13) Regular Examinations December 2014 DIGITAL LOGIC DESIGN

Logic Design: Part 2

Digital logic fundamentals. Question Bank. Unit I

Summary. Boolean Addition

II/IV B.Tech (Regular/Supplementary) DEGREE EXAMINATION. Answer ONE question from each unit.

DIGITAL SYSTEM DESIGN

Course Syllabus [1/2]

ECE 20B, Winter Purpose of Course. Introduction to Electrical Engineering, II. Administration

/90 TOTAL. 1(a) 8pts. fiv(a,b) is called the function.

(Refer Slide Time 6:48)


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

Experiment 4 Boolean Functions Implementation

CSE 20 DISCRETE MATH. Winter

Read this before starting!

Binary logic. Dr.Abu-Arqoub

Gate Level Minimization Map Method

Injntu.com Injntu.com Injntu.com R16

EE292: Fundamentals of ECE

Chapter 2. Boolean Algebra and Logic Gates

Gate Level Minimization

Spring 2010 CPE231 Digital Logic Section 1 Quiz 1-A. Convert the following numbers from the given base to the other three bases listed in the table:

COPYRIGHTED MATERIAL INDEX

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

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

FUNDAMENTALS OF DIGITAL CIRCUITS

Boolean Algebra & Digital Logic

Gate-Level Minimization

CprE 281: Digital Logic

Lecture 2: Number Systems

DKT 122/3 DIGITAL SYSTEM 1

IT 201 Digital System Design Module II Notes

Summary of Course Coverage

SRM ARTS AND SCIENCE COLLEGE SRM NAGAR, KATTANKULATHUR

Simplification of Boolean Functions

Unit-IV Boolean Algebra

Introduction to Microprocessors and Digital Logic (ME262) Boolean Algebra and Logic Equations. Spring 2011

NAME: 1a. (10 pts.) Describe the characteristics of numbers for which this floating-point data type is well-suited. Give an example.

Chapter 2 Combinational

Lecture (05) Boolean Algebra and Logic Gates

Bawar Abid Abdalla. Assistant Lecturer Software Engineering Department Koya University

CSE 20 DISCRETE MATH. Fall

Switching Circuits & Logic Design

2. BOOLEAN ALGEBRA 2.1 INTRODUCTION

CS1800 Discrete Structures Final Version A

CS/ECE 252: INTRODUCTION TO COMPUTER ENGINEERING UNIVERSITY OF WISCONSIN MADISON. Instructor: Rahul Nayar TAs: Annie Lin, Mohit Verma

A B AB CD Objectives:

CS 121 Digital Logic Design. Chapter 1. Teacher Assistant. Hadeel Al-Ateeq

Digital Fundamentals

COMPUTER SCIENCE SECTION A

Transcription:

Last (family) name: First (given) name: Student I.D. #: Circle section: Lipasti Kim Department of Electrical and Computer Engineering University of isconsin - Madison ECE/CS 352 Digital System Fundamentals Quiz #1 Thursday, February 13, 2003, 7:15 8:30 PM Instructions: 1. Closed book examination. 2. No calculator, hand-held computer or portable computer allowed. 3. Five points penalty if fail to enter name, ID#, or instructor selection. 4. No one shall leave room during last 5 minutes of the examination. 5. Upon announcement of the end of the exam, stop writing on the exam paper immediately. Pass the exam to isles to be picked up by a TA. The instructor will announce when to leave the room. 6. Failure to follow instructions may result in forfeiture of your exam and will be handled according to US 14 Academic misconduct procedures. Problem Points Score 1 20 2 20 3 20 4 10 5 15 6 15 Total 100 ECE/CS 352 Spring 2003 Quiz #1 February 13, 2003 1

1. (20 points) number representations and conversion (a) (5 points) (63) 10 = ( ) 7 (b) (5 points) Determine the radix r for following case. (246)r = (132) 10 ECE/CS 352 Spring 2003 Quiz #1 February 13, 2003 2

(c) (5 points) Find the Octal representation of the following Hexadecimal number: (8A3E.1) 16 = ( ) 8 (d) (5 points) Find the binary representation for the BCD number 1001 0000 1000 BCD ECE/CS 352 Spring 2003 Quiz #1 February 13, 2003 3

2. (20 points) arithmetic operations, binary code (a) (10 points) Perform arithmetic operations in the following number representation. Indicate carries (for addition) and borrows (for subtraction) in addition to final answer. (5 points) Binary 0 0 1 1 1 0 1 1 1 0 (5 points) Binary 1 0 1 0 0 0 1 0 1 1 (b) (10 points) Perform the following BCD addition arithmetic operations in the space provided below. ou must show all your work to receive full credit. 387 10 439 10 ECE/CS 352 Spring 2003 Quiz #1 February 13, 2003 4

3. (20 points) Boolean Algebra, Truth table, canonical forms (a) (10 points) Express the following Boolean function in minimized product of sum form. ou must show all your work to receive full credit. F(,, V, ) = V V (b) (10 points) Express the following Boolean function in a minimized sum of product form. ou must show all your work to receive full credit. F(A, B, C, D) =? M(1, 3, 6, 13, 14, 15). ECE/CS 352 Spring 2003 Quiz #1 February 13, 2003 5

ECE/CS 352 Spring 2003 Quiz #1 February 13, 2003 6 4. (10 points) Boolean Algebra Prove the following identity, ),,, ( F, algebraically. = There is no need to explicitly list the use of commutative law as it is used frequently. ou may use all the Boolean identities listed at the end of this exam paper (page 10). ou should not need more than the spaces provided. Boolean Expression Boolean Identity used =

5. (15 points) Systematic Boolean simplification (a) (10 points) Express the function F(A, B, C, D) =? m(1, 5, 6, 8, 10, 11, 13, 15) using a minimized sum of product standard form. Find and list three different minimized sum of product forms for function F(A, B, C, D) with the minimum literal cost. ou must show all your work to receive full credit. (b) (5 points) Suppose the complements of inputs are not available and inputs are needed to be complemented for the use of each product term. Thus, use of the sum of product form with a minimum number of complemented literals is desired. hich sum of product term would you use among three possible sum of product forms you have found from part (a)? Using only a sentence or two briefly explain your reasoning. ECE/CS 352 Spring 2003 Quiz #1 February 13, 2003 7

6. (15 points) Systematic Boolean simplification (a) (7 points) Consider the Boolean function below: F(a, b, c, d) =? M (1, 4, 5, 6, 9, 10). Find ALL the prime implicants of function F(a, b, c, d) using the tabular method. Answers without work will not receive any credit! ECE/CS 352 Spring 2003 Quiz #1 February 13, 2003 8

(b) (8 points) A Boolean function g(w,x,y,z) consists of the following six prime implicants: w x z, w x y, w y z, w x z, w x y, y z Use a covering table, categorize these PIs into (i) Essential PI(s) (EPI), (ii) Less-than PI(s) (LTPI), (iii) Secondary Essential PI(s) (SEPI), or (iv) Redundant PI(s) (RPI). w x y z 0 1 2 5 6 7 10 14 0 0-0 0 0 0-0 0 1 0 1 1 0 1 1 - - - 1 0 PI category ECE/CS 352 Spring 2003 Quiz #1 February 13, 2003 9

Basic Identities of Boolean Algebra 1. 0 = 2. 1 = 3. 1 = 1 4. 0 = 0 5. = 6. = 7. =1 8. = 0 9. = 10. = 11. = Commutative Law 12. ( ) = ( ) 13. () = () Associative Law 14. ( ) = 15. = ( )( ) Distributive Law 16. = 17. = DeMorgan s Law Useful Boolean Identities 18. = 19. = 20. = 21. = 22. ( )( ) = 23. ( )( ) = ECE/CS 352 Spring 2003 Quiz #1 February 13, 2003 10