1 / 10

Computer Architecture and Organization 55:035

Prepare for your Computer Architecture and Organization final exam with this comprehensive review guide, tailored for the Spring 2011 semester. This open-book exam lasts two hours and contains eight problems, closely resembling homework assignments. The final covers material from several chapters, including machine instructions, arithmetic processes, basic processing units, I/O organization, memory systems, and pipelining. Familiarize yourself with addressing modes, instruction execution, cache memories, and handling hazards to ensure a strong performance on this comprehensive assessment.

ady
Télécharger la présentation

Computer Architecture and Organization 55:035

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Computer Architecture and Organization55:035 Final Exam Review Spring 2011

  2. General Information • 2 hour exam - open book, open notes • Eight problems - No Verilog • Similar to homework problems • Final is comprehensive • Review chapters 2, 6, & 7 covered by midterm exam • Chapters 4, 5, & 8 since midterm

  3. Chapter 2 – Machine Instructions & Programs • Information representation • 2’s complement negative numbers • Memory locations & addresses • Byte addressability • Big endian vs. little endian • Word alignment • Memory operations

  4. Chapter 2 (cont.) • Instructions and sequencing • Addressing modes • Assembly language • Basic I/O operations • Stacks and Queues • Subroutines

  5. Chapter 6 - Arithmetic • Signed number addition/subtraction • Fast adders: carry-lookahead, carry-select • Multiplication • Booth’s algorithm • Bit pair recoding • Carry-save addition of partial products • Integer division; restoring & nonrestoring • Floating point representation and operations

  6. Chapter 7 – Basic Processing Unit • Fundamental concepts • Register transfers • Instruction fetch and execution • Instruction types • Point-to-point vs. multiple bus organization • Hardware control • Micro-programmed control

  7. Chapter 4 – I/O Organization • Polled I/O • Memory mapped I/O vs. port mapped I/O • Interrupts • Direct Memory Access (DMA) • Bus Structures • Synchronous vs. asynchronous • Interface types • Serial vs. parallel

  8. Chapter 5 – Memory Systems • IC RAM Memories • Static vs. Dynamic • Storage cell organization • Internal chip organization • Basic read/write operations • Read Only Memories • ROM, PROM, EPROM, EEPROM, Flash • Memory Arrays

  9. Chapter 5 – Memory Systems (cont.) • Cache Memories • Organization and mapping functions • Replacement algorithms • Performance • Interleaving of main memory • Hit rate & miss penalty • Virtual Memories • Address translation • Block replacement

  10. Chapter 8 - Pipelining • Basic Concepts • Performance improvement • Structural Hazards • Multiple execution units • Data Hazards • Operand forwarding • Instruction reordering (handle via SW) • Instruction Hazards • Branches, branch prediction and inst. prefetch

More Related