Computer Engineering Final Examination - Cmpe 2030 A, Exams of Computer Science

Download Computer Engineering Final Examination - Cmpe 2030 A and more Exams Computer Science in PDF only on Docsity! 1 Cmpe 2030 A Introduction to Computer Engineering Final Examination June 10th, 1999 There are 14 questions and 19 pages. You also have an attachment with various figures and worksheets. Please make sure that you have all of them. This examination is closed textbook. No calculators, class notes or any material is allowed! 1. Please write/draw legibly. Use the work sheets for generating the solutions before provid- ing the final answer. 2. State any assumptions you feel you have to make or ask for clarification 3. Keep in mind it is difficult to give partial credit without written material. Please make sure you document any partial solutions. 4. All questions carry equal points (10 pts). Plan your work! 5.The exam is 2 hours and 50 minutes. Name:_________________________________________________ Student Number:_________________________________________ Question Graded 1 2 3 4 5 6 7 8 9 10 11 12 13 14 Total 2 1. Provide a switch level implementation of the following expression using n-type and p-type switches. Assume that the complement of each signal is also available F A B⊕= 5 4 This questions deals with logic minimization using K-Maps. 4 (a) Simplify the following expression algebraically to a sum of products form. 4 (b) Fill in the K-Map for the preceding function. F A C+ BC D B+( )+= Function _______________________________________ 00 01 11 10 00 01 11 10 A C B D CD AB 6 4 (c) Circle all of the prime implicants and fill in the table shown to the side. 4 (d) From the preceding K-Map provide the simplified boolean expression. 00 01 11 10 00 01 11 10 A C B D CD AB Prime Implicants Essential? y n Function = ____________________________ 7 5(a) Draw the gate level implementation of a 2:1 multiplexor. Clearly label all of the control, input, and output signals. 5 (b) Show how you can construct a 4:1 multiplexor using 2:1 multiplexors. Clearly label all control, input, and output signals. Clearly show all of the connections between multiplex- ors. Use the 2:1 Mux icon below. Do not provide a gate level implementation of a 4:1 muxltiplexor. I0 I1 O1 S0 2:1 Mux 10 8(a). Show the hexadecimal value of the IEEE 754 floating point representation of -1.0. 8 (b) What is the result to of the following floating point operation? The numbers are shown in complete normalized IEEE 754 form: 1.101 x 2129 + 1.01 x 2122 11 9(a). Draw the gate level implementation of a D latch. 9 (b) Complete the timing diagram below for the circuit shown below. phi1 phi2 Input B transparent latch transparent latch transparent latch transparent latch input A B phi1 phi2 phi2phi1 A 1 0 1 0 0 1 1 0 12 10. We wish to design a 2-bit up/down counter. The input is a single bit up/down signal. The output are the values of the counter (2 bits) The counter has 4 states corresponding to the numbers 0-3. You will designing this state machine using two register cells shown below. 10 (a) Draw the state diagram. Label each arc with the value of the up/down input signal. 10 (b) Write the state transition table. D Q phi1 phi2 S1 S0 up/down New S1 New S0 15 12. Consider the following SPIM program. The data segment starts at 0x10010000 and the text segment starts at 0x00400000. 12 (a) What is the final value of the contents of memory location labeled result? 12 (b) What are the values of the labels loop and result? .data label: .word 0, 1, 2, 3, 4, 5, 6, 7 str: .asciiz “Final” .align 2 result: .word 0 .text addi $t5, $0, 8 add $t0, $0, $0 loop: lw $t1, label($t0) add $t2, $t1, $t2 addi $t0, $t0, 4 addi $t5, $t5 -1 bne $t5, $0, loop sw $t2, result($0) li $v0, 10 syscall result _______________ loop ___________________ result ___________________ 16 12 (c) Assume that the register $sp points to the top of the stack, this location contains the value on the top of the stack. Write a short SPIM program that pushes the contents of regis- ter $t0 onto the top of the stack. 17 13. Consider the single cycle datapath shown overleaf. Write the microcode to implement the following operation. Make sure you fill in the description column: Mem[1000] = R4-[(R2+6R1)/4]. i.e., the result should be stored in memory at location 1000. . cycle X Y Z rwe imm en imm va au en a/s lu en lf su en st ld en st en r/w msel Descr 1 2 3 4 5 6 7 8 9 10