sp09-sw-ef

# sp09-sw-ef - ECE 2030 12:00pm 5 problems, 7 pages Computer...

This preview shows pages 1–4. Sign up to view the full content.

ECE 2030 12:00pm Computer Engineering Spring 2009 5 problems, 7 pages Final Exam 1 May 2009 1 Instructions: This is a closed book, closed note exam. Calculators are not permitted. If you have a question, raise your hand and I will come to you. Please work the exam in pencil and do not separate the pages of the exam. For maximum credit, show your work. Good Luck! Your Name ( please print ) ________________________________________________ 1 2 3 4 5 total 32 32 24 28 40 156

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
ECE 2030 12:00pm Computer Engineering Spring 2009 5 problems, 7 pages Final Exam 1 May 2009 2 Problem 1 (4 parts, 32 points) Implementation Bonanza For each part implement the specified device. Label all inputs and outputs . Part A (8 points) Implement the expression below using N and P type switches. E D C B A OUT X + + = Part B (8 points) Implement the expression in mixed logic notation using NAND gates. ) ( D C B A OUT Y + + = Part C (8 points) Implement a 2 to 4 decoder with enable using basic gates. Part D (8 points) Write a POS expression for a two-input XOR (odd parity) using maxterms.
ECE 2030 12:00pm Computer Engineering Spring 2009 5 problems, 7 pages Final Exam 1 May 2009 3 Problem 2 (6 parts, 32 points) Alien Software SETI has just received an interesting message from deep space. While the comments are written in an alien tongue, they appear to write programs in MIPS assembly. Intergalactic scientists have only been able to decode the register assignments. Computer engineers must take it from there. # INPUTS: \$1= num elements, \$2= array A pointer, \$3= array B pointer, # OUTPUT: \$6=result, WORKING: \$4= InA/diff, \$5= InB/pred, # label instruction comment L1 WhatsIt: sub \$6, \$6, \$6 # clear max difference L2 Loop: lw \$4, (\$2) # load A element L3 lw \$5, (\$3) # load B element L4 sub \$4, \$4, \$5 # compute difference L5 slt \$5, \$4, \$0 # if difference >= 0 L6 beq \$5, \$0, Skip1 # then skip L7 sub \$4, \$0, \$4 # otherwise negate L8 Skip1: slt \$5, \$6, \$4 # if MaxDif >= difference L9 beq \$5, \$0, Skip2 # then skip L10 add \$6, \$4, \$0 # otherwise update MaxDif L11 Skip2: addi \$2, \$2, 4 # increment A ptr L12 addi \$3, \$3, 4

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 08/23/2010 for the course EE 2030 taught by Professor Wills during the Spring '10 term at Georgia Tech.

### Page1 / 7

sp09-sw-ef - ECE 2030 12:00pm 5 problems, 7 pages Computer...

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online