ECE243 - Final Exam 2006 (converted to NIOSII)

ECE243 - Final Exam 2006 (converted to NIOSII) - Student #...

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

View Full Document Right Arrow Icon
Student # (use if pages get separated) ____________________________ ECE243 Computer Organization Pg 1 of 12 Spring 2007 UNIVERSITY OF TORONTO FACULTY OF APPLIED SCIENCE AND ENGINEERING FINAL EXAMINATION, APRIL 2007 Second Year ECE243H1 S – COMPUTER ORGANIZATION Exam Type: D Examiners – A. Moshovos, G. Steffan. H. Timorabadi Instructions This is a type D exam. You are allowed to use the course textbook, the lab manual, the course notes, the book, and personal notes. Programmable calculators are not permitted. Last Name (Print Clearly): __________________ First Name: ________________________ Student Number: ___________________ ___________________________________________________________________________________________________ Question 1 Question 2 Question 3 Question 4 Question 5 Question 6 Question 7 Question 8 Question 9 Total General Instructions: State your assumptions. Show your work. Comment your code. Solutions that are judged significantly inefficient will lose some marks. The exam is printed on two sides of the page. The last pages and the back of this one are blank and can be used for answers or calculations. Make your answers clear. There are 9 questions and a total of 100 marks. There are 6 pieces of paper in the exam, this one included, printed both sides. The page numbering is 1-12 .
Background image of page 1

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

View Full DocumentRight Arrow Icon
Student # (use if pages get separated) ____________________________ ECE243 Computer Organization Pg 2 of 12 Spring 2007 Question 1 – Quick Answer [10 Marks] Assuming that initially all registers contain zero, show using eight hexadecimal digits the final register values after executing the following program. Do so for little-endian. .data xyz: .byte 0x2, 0x4, 0x6, 0x8, 0xa, 0xc, 0xe, 0x0 .byte 0x22, 0x44, 0x66, 0x88, 0xaa, 0xcc, 0xee, 0x00 .text Start: movia r8, xyz ldw r9, 4(r8) andi r9, r9, 0xff add r10, r9, r0 add r11, r10, r8 ldh r12, 0(r11) ldb r13, 3(r12) Little-Endian R8 xyz R9 R10 R11 R12 R13
Background image of page 2
Student # (use if pages get separated) ____________________________ ECE243 Computer Organization Pg 3 of 12 Spring 2007 Question 2 [10 Marks] Assume the following assignment of variables to registers: R8 holds i R9 holds the base of array a or &(a[0]) R10 holds the base of array b or &(b[0]) R11 holds tmp. Assuming that the elements of a and b are words which of the following code fragments
Background image of page 3

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

View Full DocumentRight Arrow Icon
Image of page 4
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 04/17/2008 for the course ECE 243 taught by Professor Moshovos during the Winter '08 term at University of Toronto- Toronto.

Page1 / 12

ECE243 - Final Exam 2006 (converted to NIOSII) - Student #...

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

View Full Document Right Arrow Icon
Ask a homework question - tutors are online