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

Similar documents
Computer Organization I Solution 3/Version 1 CMSC 2833 Autumn 2007

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

Computer Organization I CRN Test 3/Version 1 CMSC 2833 CRN Spring 2017

CHAPTER 7. Exercises 17/ / /2 2 0

UNIT 4 MINTERM AND MAXTERM EXPANSIONS

Cs302 Quiz for MID TERM Exam Solved

ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN. Week 2 Dr. Srinivas Shakkottai Dept. of Electrical and Computer Engineering

Karnaugh Maps Objectives

Karnaugh Map & Boolean Expression Simplification

MC9211 Computer Organization

Number System conversions

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

Advanced Digital Design with the Verilog HDL, Second Edition Michael D. Ciletti Prentice Hall, Pearson Education, 2011

SAMPLE ANSWERS MARKER COPY

1. Expand each of the following functions into a canonical sum-of-products expression.

( c) Give logic symbol, Truth table and circuit diagram for a clocked SR flip-flop. A combinational circuit is defined by the function

ELC224C. Karnaugh Maps

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

Computer Science Final Examination Friday December 14 th 2001

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

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

UNIVERSITI TENAGA NASIONAL. College of Information Technology

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

This form sometimes used in logic circuit, example:

DHANALAKSHMI COLLEGE OF ENGINEERING, CHENNAI DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING CS6201 DIGITAL PRINCIPLES AND SYSTEM DESIGN

Review for Test 1 : Ch1 5

CSE 140L Spring 2010 Lab 1 Assignment Due beginning of the class on 14 th April

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

CHAPTER 7. Solutions for Exercises

UNIT II COMBINATIONAL CIRCUITS:

Simplification of Boolean Functions. Dept. of CSE, IEM, Kolkata

NUMBERS AND CODES CHAPTER Numbers

Optimizations and Tradeoffs. Combinational Logic Optimization

Signals and Systems Digital Logic System

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

Philadelphia University Student Name: Student Number:

Department of Electrical & Electronics EE-333 DIGITAL SYSTEMS

Week No. 06: Numbering Systems

B.Sc. PHYSICS III YEAR

Lecture 6: Gate Level Minimization Syed M. Mahmud, Ph.D ECE Department Wayne State University

UNIT 5 KARNAUGH MAPS Spring 2011

Computer Organization I. Lecture 13: Design of Combinational Logic Circuits

0 / 1 Now, Binary value of the given number :-

Chapter 2 Combinational Logic Circuits

Sample Marking Scheme

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

Digital Systems Overview. Unit 1 Numbering Systems. Why Digital Systems? Levels of Design Abstraction. Dissecting Decimal Numbers

BINARY CODES. Binary Codes. Computer Mathematics I. Jiraporn Pooksook Department of Electrical and Computer Engineering Naresuan University

Systems I: Computer Organization and Architecture

Discrete Structures CRN Test 3 Version 1 CMSC 2123 Spring 2011

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

Chapter 4: Combinational Logic Solutions to Problems: [1, 5, 9, 12, 19, 23, 30, 33]

Lecture 7: Karnaugh Map, Don t Cares

Chapter 7 Logic Circuits

Logic. Combinational. inputs. outputs. the result. system can

Design of Combinational Logic

Minimization techniques

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

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

Schedule. ECEN 301 Discussion #25 Final Review 1. Date Day Class No. 1 Dec Mon 25 Final Review. Title Chapters HW Due date. Lab Due date.

UNIT 1. BOOLEAN ALGEBRA AND COMBINATIONAL CIRCUITS

Class Website:

CprE 281: Digital Logic

CHAPTER 2 BOOLEAN ALGEBRA

Chapter-2 BOOLEAN ALGEBRA

SUPPLEMENTARY INFORMATION

Gate-Level Minimization

Ex: Boolean expression for majority function F = A'BC + AB'C + ABC ' + ABC.

Combinational Logic. Review of Combinational Logic 1

DIGITAL ELECTRONICS & it0203 Semester 3

Digital Systems Roberto Muscedere Images 2013 Pearson Education Inc. 1

MODULAR CIRCUITS CHAPTER 7

Midterm1 Review. Jan 24 Armita

Lecture 2 Review on Digital Logic (Part 1)

Chap 2. Combinational Logic Circuits

Problem Points Score Total 100

ENGIN 112 Intro to Electrical and Computer Engineering

ENEL Digital Circuits Final Examination

Philadelphia University Student Name: Student Number:

Chapter 2 Combinational Logic Circuits

CHAPTER III BOOLEAN ALGEBRA

II. COMBINATIONAL LOGIC DESIGN. - algebra defined on a set of 2 elements, {0, 1}, with binary operators multiply (AND), add (OR), and invert (NOT):

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

Chapter 4. Combinational: Circuits with logic gates whose outputs depend on the present combination of the inputs. elements. Dr.

Unit 3 Session - 9 Data-Processing Circuits

MATH 433 Applied Algebra Lecture 22: Review for Exam 2.

12/31/2010. Digital Operations and Computations Course Notes. 01-Number Systems Text: Unit 1. Overview. What is a Digital System?

Reg. No. Question Paper Code : B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER Second Semester. Computer Science and Engineering

KUMARAGURU COLLEGE OF TECHNOLOGY COIMBATORE

CHAPTER III BOOLEAN ALGEBRA

Introduction to Karnaugh Maps

Digital Logic Design. Combinational Logic

ENG2410 Digital Design Combinational Logic Circuits

Unit 2 Session - 6 Combinational Logic Circuits

A B D 1 Y D 2 D 3. Truth table for 4 to 1 MUX: A B Y 0 0 D D D D 3

1. Basics of Information

Logical Design of Digital Systems

Combinational Logic. By : Ali Mustafa

CSE 241 Digital Systems Spring 2013

ELECTRONICS & COMMUNICATION ENGINEERING PROFESSIONAL ETHICS AND HUMAN VALUES

Transcription:

. Print your name on your scantron in the space labeled NAME. 2. Print CMSC 2833 in the space labeled SUBJECT. 3. Print the date, 9-20-2007, in the space labeled DATE. 4. Print your CRN, 2393, in the space labeled PERIOD. 5. Print the test number and version, T/V, in the space labeled TEST NO. 6. This is a closed-book examination. No reference materials are permitted. No notes are permitted. 7. You may not consult your neighbors, colleagues, or fellow students to answer the questions on this test. 8. Cellular phones are prohibited. The possessor of a cellular phone will receive a zero (0) if the phone rings or is visible during the test. 9. You may use your personal calculator on this test. You are prohibited from loaning your calculator or borrowing a calculator from another person enrolled in this course. 0. Mark the best selection that satisfies the question. If selection b is better that selections a and d, then mark selection b. Mark only one selection.. Darken your selections completely. Make a heavy black mark that completely fills your selection. 2. Answer all 25 questions. 3. Record your answers on SCANTRON form 882-E (It is green!)

. ind the correct reduced expression for ( A, implemented in figure. a. = AD+ CD + ABC b. = AD + CD + ABC c. = AD + CD + ABC d. = AD + CD + ABC A B C D 2. The hexadecimal value CAD is equal to a. 6255 octal b. 350 decimal c. 0000 binary d. 3223 base 4 igure. ( A, 3. ind the correct expression (not reduced) for ( A, implemented in figure 3 A B C D igure 3. ( A, a. = ABC + ACD + CD b. = ABC + ACD + CD c. = ABC + ACD + CD d. = ABC + ACD + CD 2

4. ind the optimal 2-level POS expression for X ( A, where ABCD is a 4-bit BCD code and WXYZ is an excess-6 code. Six is added to every valid BCD code in an excess-6 code. Inputs Outputs Decimal A B C D W X Y Z 00 00 0 0 0 0 a. X ( A, = BC + BC b. X ( A, = ( B + ( B + c. X ( A, = B C + BC d. X ( A, = ( B + ( B + 5. ind the hexadecimal codes for the ASCII sequence 'Exam'. The decimal code for the letter A is 65 and the difference between the codes for the lower case letters and the upper case letters is 32. or example, the decimal code for the letter a is 97. a. 657866D b. 4578626D c. 457866D d. 657866E 3

6. Which circuit diagram in figure 6.2 correctly implements function mapped in figure 6.? WX YZ 00 0 0 00 0 0 igure 6. ( W, X, Y, Z ) W Z Y X Z W Z Y X Z W Z Y X Z W Z Y X Z a) b) igure 6.2 Implementations of mapped in figure 6.. c) d) 7. Convert MIND base 27 to base 3. a. 220022 b. 222002 c. 22022 d. 2200220 8. ind the decimal equivalent of the eight's complement number 42.44. a. 34.4375 b. 34.5625 c. -29.4375 d. -29.5625 4

9. A trit is a three-state device. How many trits are needed to express the decimal number 4302. a. 7 b. 0 c. 9 d. 8 0. ind the optimal 2-level SOP expression for ( A, W where ABCD is a 4-bit BCD code and WXYZ is an excess-6 code. Six is added to every valid BCD code in an excess-6 code. Inputs Outputs Decimal A B C D W X Y Z 00 0 0 00 0 a. W ( A, = BC + AB + A B C 0 b. W ( A, = BC + AB + AB c. W ( A, = BC + BC + AC d. W ( A, = A + B + C. What is the largest decimal integer that can be expressed in 3 bits? a. 25 b. 89 c. 6383 d. 69 5

2. ind the minterm expression for W ( A, where ABCD is a 4-bit BCD code and WXYZ is an excess-6 code. Six is added to every valid BCD code in an excess-6 code. Inputs Outputs Decimal A B C D W X Y Z a. W A, m(2,3,4,5,6,7,8,9), d = b. W A, M (2,3,4,5,6,7,8,9), d = c. W A, M (2,3,4,5,6,7,8,9), d = d. W A, m(2,3,4,5,6,7,8,9), d = ( = m(0,,2, 3,4, 5) ( = M (0,, 2, 3, 4, 5) ( = M (0,,2,3,4,5) ( = m(0,, 2,3, 4,5) 3. ind the four's complement of -2.325. a. 3.23 b. 02. c. 33. d. 32.22 4. Refer to figures 3. and 3.2 and the explanatory text. The wind velocity at 8 hours was 6 mph, at 9 hours it was 3 mph, and at 20 hours it was mph. What was the average of recorded values for the duration t, where 8 t 20? a. 3.33 mph b. 00 c. 0 d. 3.50 mph 6

25 20 5 0 5 Wind velocity (mph) 0 0 2 4 6 8 0 2 4 6 8 20 22 24 Time (hours) 3 2 0 - -2 Voltage (Volts) igure 3. Wind velocity Sampling point -3 0 2 4 6 8 0 2 4 6 8 20 22 24 Time (hours) igure 3.2 Voltage Wind velocity is measured by a device that produces a 5-bit, 2 s complement voltage. Each single bit increment is equivalent to 0.2 Volts and -3 Volts is recorded as the 5-bit, 2 s complement value of 0000. Wind velocity is sampled every two hours, starting at zero hours, and recorded to the nearest whole number of miles per hour. The velocity recorded is valid for two hours beginning at the time sampled and extending to the next sample time. 7

5. How many bits are required to encode a single letter of a 270-letter alphabet? a. 9 b. 7 c. 0 d. 8 6. Refer to figures 3. and 3.2 and the explanatory text. What is the maximum value recorded by the device that measures wind velocity? a. 0000 b. 20 mph c. 0000 d. Volt 7. Refer to figures 3. and 3.2 and the explanatory text. What value was recorded at four hours? a. 000 b. 00 c. 00 d. 0000 8. ind the hexadecimal sequence to send each of the characters of 'Exam' with odd parity. A parity bit is appended onto a 7-bit ASCII character. The parity bit is the rightmost bit of every 8-bit message. The decimal code for the letter A is 65 and the difference between the codes for the lower case letters and the upper case letters is 32. or example, the decimal code for the letter a is 97. a. 8AC2DC b. CBC2DA c. 8AC2DA d. 45866D 9. The hexadecimal value ACE is equal to a. 64206 decimal b. 33233032 base 4 c. 7526 octal d. 000000 binary ( is the POS form of? 20. Which expression for A, = AC + AC a. ( A, = ( A + ( A + b. ( A, = AC + AC c. ( A, = ( A + ( A + d. ( A, = AC + AC 8

2. ind the maxterm expression for ( A, WXYZ is an excess-6 code. Six is added to every valid BCD code in an excess-6 code. X where ABCD is a 4-bit BCD code and Inputs Outputs Decimal A B C D W X Y Z a. X ( A, m(2,3,4,5), d = m b. X A, m(0,,6,7,8,9), d = c. X ( A, M (2,3,4,5), d = M d. X A, M (0,,6,7,8,9), d = = (0,, 2,3, 4,5) ( = m(0,, 2,3, 4,5) = (0,, 2, 3, 4, 5) ( = M (0,, 2,3, 4,5) 22. Which of the identities given in below figure 2 is not a basic identity of Boolean algebra? a. X + = b. X + X = X c. X + Y = X + Y d. X + X = 23. Which transition fails the test for a Gray code sequence? a. 0000 -> 000 b. 00 -> 000 c. 0 -> 00 d. 00 -> 00 24. ind the two's complement representation of -5.875 in an 8-bit field where the leftmost 4 bits represent the integer portion and the rightmost 4 bits represent the fractional portion. a. 000 b. 000 c. 0000 d. 000 25. The decimal value 5966.28250 is equal to a. 00000.00000 binary b. 30323332.02 base 4. c. CAE.48 hexadecimal d. 45376.42 octal 9