DOC PREVIEW
GT ECE 2030 - ECE 2030 Final

This preview shows page 1-2-3 out of 10 pages.

Save
View full document
View full document
Premium Document
Do you want full access? Go Premium and unlock all 10 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 10 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 10 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 10 pages.
Access to all documents
Download any document
Ad free experience

Unformatted text preview:

ECE2030 Introduction to Computer Engineering8 problems Sample Final1/10Name: ____________________________________Student ID# ________________________________This exam is closed notes, closed book, and CALCULATORS ARE NOT PERMITTED. Show all workand place answers in the space provided. If more work space is needed, please use the back of the test sheetand make a note of this next to the problem number. Partial credit will only be given to work that ispresented in a clear and structured manner.Problem Number (Total Points)Points AwardedProblem #1 (10pts)Problem #2 (10pts)Problem #3 (15pts)Problem #4 (10pts)Problem #5 (10pts)Problem #6 (10pts)Problem#7 (5pts)Problem#8 (10pts)Problem#9 (20pts) Total Points: ________________ECE2030 Introduction to Computer Engineering8 problems Sample Final2/10Problem 1 (10 points) CMOS Circuit Design(a) (5 points) Show the CMOS circuit implementation of the following function using only eighttransistors. Assume that you have the complemented and uncomplemented variables A,B,C, and Davailable to you.FXYWZ=++a) (5 points) Can you replace two series connected inverters with the following two transistor circuitto buffer the input signal (i.e. Yes or No)? Why?VddLogic “1”Logic “0”GRDInOut?InOut=ECE2030 Introduction to Computer Engineering8 problems Sample Final3/10Problem 2: K-Map (10 points)(a) (2 points) Put the following truth table in a 4-variable k-map.ABCDOut00001000100010000110010000101001101011111000010010101001011111000110111110111111(b) (8 points) Show the simplified POS from the k-map.00 01 11 1000011110ABCDECE2030 Introduction to Computer Engineering8 problems Sample Final4/10Problem 3 (15 points): Implementation of Logic Functions and Building Blocks(a) (5 points) Using mixed logic notation, implement the following function using only NOR gates andinverters. † F = AB + C + DE(b) (5 points) Implement OUT in the following truth table using a multiplexer. You pick the size!InputsOutputsABCOUT00010011010001101001101011001111(c) (5 points) Given the following description of a priority encoder, list the inputs (D0,D1,D2, and D3) inorder from the highest priority to the lowest priority.D0D1D2D3A1A0V(alid)0000xx00X011110X1X10101000111xxx001ECE2030 Introduction to Computer Engineering8 problems Sample Final5/10Problem 4 (10 points): Number Systems(a) (4 points)What is the range of the immediate value in an I-format instruction assuming that it uses2’s complement representation for negative numbers.(b) (2 points) Find the decimal equivalent of the binary number (11000)2 assuming that it is a signednumber using 5 bit two’s complement representation.(c) (2 points) Convert (100111101001)2 into hexadecimal (i.e. base 16).(d) (2 points) Convert 0xCB (i.e. a hexadecimal number) into a binary number.ECE2030 Introduction to Computer Engineering8 problems Sample Final6/10Problem 5: (10 points) State Machines(a) (8 points) Given the following state transition table construct the corresponding state diagram.Current State Input Next State OutputS1S0XNS1NS0Out000011001101010010011110100010101111110100111010(b) (2 points) What is the difference between a Mealy and Moore state machine?01001011ECE2030 Introduction to Computer Engineering8 problems Sample Final7/10Problem 6 (10points) – Timing DiagramsComplete the timing diagram of the following sequential circuit. Assume that the propagation delay ofeach register is 5ns and that the delay of the inverter is negligible.INOUTWECLK1-bit registerINOUTWECLKINOUTWECLK1-bit registerINOUTWECLK1-bit registerINOUTWECLKINOUTWECLK1-bit registerPHI_A PHI_Bload1InputOutputload2LOAD1PHI_A010 20 30 40 50 60 70 80 90 100 110 120 130 140 150 160 170Time [ns]PHI_BOUTPUTAssume initial value of output is at a high voltageINPUTLOAD2ECE2030 Introduction to Computer Engineering8 problems Sample Final8/107) Memory System Design (5 points)Consider the task of building a 512M x 8 memory system out of 64Mx1 memory chips.a) (2.5 points) How many 64Mx1 memory chips would you need to build the 512Mx8 memorysystem?b) (2.5 points) What size “address” decoder do you need to build this memory system?ECE2030 Introduction to Computer Engineering8 problems Sample Final9/108) Microcode (10 points) The datapath below incorporates an adder/subtractor, a logical shifter that can shift to the left or rightby one bit, and main memory. The arithmetic operation is specified by /subadd control line. Thesubtraction is x out – y out. The shift direction is controlled by the right/left control line. The ld enand the st en determine whether a load or store memory operation is performed, respectively. Theenable signals determine which functional unit drives the Z bus. The datapath also contains a registerfile with 32, 32 bit registers. On each cycle, one sub/add, one shift operation, or one memoryoperation can occur in the datapath. Given this simplified datapath, write the corresponding microcode for the following operation.M[$R1]= (19*M[$R2]) - $R7CYCLEXYZrweau enadd/subsu enright/leftld enst enmselr/w1234567891011AUShifterRegisterFile32x32Z X Y5 5 5x outy outWrite Zrweau enadd/subsu enright/left323232memoryaddressdatald enst enMselr/wECE2030 Introduction to Computer Engineering8 problems Sample Final10/109) (20 points) Assembly Language Programming(a) (15 points) Consider the following data segment (assume that the machine is little endian!).datadata_block: .word 0x22,0x11, 0xab, 0x78, 0x11, 0xff, 0x24, 0x00Write an assembly program that searches the data segment for the word containing 0x11 and replacesthe value with 0xaa. You can assume that the information in the data segment ends with a null word,0x00000000, (as you can see in the above data segment!)I have started the program for you, but you must finish it and comment it. You may use any assemblycommands that we used in class. To receive full credit you must use a loop!.textla $s2, data_blockaddi $t0, $zero, 0x11addi $t1, $zero , 0xaa(b) (5 points) List two primary actions that the jal assembly command


View Full Document

GT ECE 2030 - ECE 2030 Final

Documents in this Course
Load more
Download ECE 2030 Final
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view ECE 2030 Final and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view ECE 2030 Final 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?