ECE2030 8 problems Introduction to Computer Engineering Sample Final Name Student ID This exam is closed notes closed book and CALCULATORS ARE NOT PERMITTED Show all work and place answers in the space provided If more work space is needed please use the back of the test sheet and make a note of this next to the problem number Partial credit will only be given to work that is presented in a clear and structured manner Problem Number Total Points Problem 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 Points Awarded Total Points 1 10 ECE2030 8 problems Introduction to Computer Engineering Sample Final Problem 1 10 points CMOS Circuit Design a 5 points Show the CMOS circuit implementation of the following function using only eight transistors Assume that you have the complemented and uncomplemented variables A B C and D available to you FXYWZ a 5 points Can you replace two series connected inverters with the following two transistor circuit to buffer the input signal i e Yes or No Why Vdd In Out Out In GRD 2 10 Logic 1 Logic 0 ECE2030 8 problems Introduction to Computer Engineering Sample Final Problem 2 K Map 10 points a 2 points Put the following truth table in a 4 variable k map A 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 B 0 0 0 0 1 1 1 1 0 0 0 0 1 1 1 1 CD 00 01 AB 00 C 0 0 1 1 0 0 1 1 0 0 1 1 0 0 1 1 11 D 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 10 01 11 10 b 8 points Show the simplified POS from the k map 3 10 Out 1 0 0 0 0 0 1 1 0 0 0 1 0 1 1 1 ECE2030 8 problems Introduction to Computer Engineering Sample Final Problem 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 and inverters F AB C DE b 5 points Implement OUT in the following truth table using a multiplexer You pick the size A 0 0 0 0 1 1 1 1 Inputs B C 0 0 0 1 1 0 1 1 0 0 0 1 1 0 1 1 Outputs OUT 1 1 0 0 1 0 0 1 c 5 points Given the following description of a priority encoder list the inputs D0 D1 D2 and D3 in order from the highest priority to the lowest priority D0 0 0 0 0 1 D1 0 X X 1 x D2 0 0 1 0 x D3 0 1 X 0 x A1 x 1 1 0 0 A0 x 1 0 1 0 V alid 0 1 1 1 1 4 10 ECE2030 8 problems Introduction to Computer Engineering Sample Final Problem 4 10 points Number Systems a 4 points What is the range of the immediate value in an I format instruction assuming that it uses 2 s complement representation for negative numbers b 2 points Find the decimal equivalent of the binary number 11000 2 assuming that it is a signed number 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 5 10 ECE2030 8 problems Introduction to Computer Engineering Sample Final Problem 5 10 points State Machines a 8 points Given the following state transition table construct the corresponding state diagram Current State S1 S0 0 0 1 1 0 0 1 1 0 0 0 0 1 1 1 1 Input X 0 1 0 1 0 1 0 1 Next State NS1 0 1 0 1 0 1 1 0 00 Output NS0 1 0 1 1 1 1 0 1 Out 1 1 0 0 0 1 0 0 01 11 10 b 2 points What is the difference between a Mealy and Moore state machine 6 10 ECE2030 8 problems Introduction to Computer Engineering Sample Final Problem 6 10points Timing Diagrams Complete the timing diagram of the following sequential circuit Assume that the propagation delay of each register is 5ns and that the delay of the inverter is negligible 1 bit register Input 1 bit register OUT IN WE load1 OUT IN Output WE CLK CLK load2 PHI A PHI B LOAD1 LOAD2 PHI A PHI B INPUT OUTPUT 0 10 20 30 40 50 60 70 80 90 100 Time ns Assume initial value of output is at a high voltage 7 10 110 120 130 140 150 160 170 ECE2030 8 problems Introduction to Computer Engineering Sample Final 7 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 memory system b 2 5 points What size address decoder do you need to build this memory system 8 10 ECE2030 8 problems Introduction to Computer Engineering Sample Final 8 Microcode 10 points The datapath below incorporates an adder subtractor a logical shifter that can shift to the left or right by one bit and main memory The arithmetic operation is specifiedright left by add sub control line The subtraction is x out y out The shift direction is controlled by the control line The ld en and the st en determine whether a load or store memory operation is performed respectively The enable signals determine which functional unit drives the Z bus The datapath also contains a register file with 32 32 bit registers On each cycle one add sub one shift operation or one memory operation can occur in the datapath Given this simplified datapath write the corresponding microcode for the following operation M R1 19 M R2 R7 CYCLE 1 2 3 4 5 6 7 8 9 10 11 X Y Z rwe au en add sub su en right left 5 msel 5 32 rwe st en st en Z XY 5 ld en address x out Register y out File 32x32 32 Write Z au en AU add sub Shifter right left memory data su en 32 ld en Msel r w 9 10 r w ECE2030 8 problems Introduction to Computer Engineering Sample Final 9 20 points Assembly Language Programming a 15 points Consider the following data segment assume that the machine is little endian data data block word 0x22 0x11 0xab 0x78 0x11 0xff 0x24 0x00 Write an assembly program that searches the data segment for the word containing 0x11 and replaces the 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 …
View Full Document
Unlocking...