Computer Organization and Architecture

Final Exam Review

Fall 2012

Calculators will be allowed.

  1. General

The final examination is comprehensive and will cover the following Sections:

  1. Chapter 4, sections 4.1-4.6

  2. Chapter 6, section 6.2

  3. Appendix A, B, All sections

  4. The class slides.

  1. Types of Questions

The test may include the following types of questions. There will not necessarily be each type, but there will not be any type not described below.

  1. Short answer: one-two paragraph description or discussion of a concept such as the ideas of levels in computer architecture.

  1. Problem: possibilities include problems similar to those at the end of the chapters.

NOTE: There will NOT be questions asking you to write a definition for some term. Rather, it is assumed that you know the relevant terminology as presented in the text and in class. This terminology will be used in questions as needed.

  1. Key Concepts

Chapter 4

  1. An Example Microarchitecture – know how this works, including:

    1. The data path

    2. Microinstruction control

  2. The IJVM ISA

    1. Stacks

    2. Memory model

    3. Instruction set – be able to write programs!

  3. The Mic-1 structure and operation

  4. Microarchitecture design issues

    1. Speed vs. cost factors

    2. Reduced execution path lengths

    3. Prefetching

    4. You may ignore the Mic-3 and Mic-4

  5. Cache memory

  6. Branch prediction

  7. Out-of-order Execution and register renaming

  8. Speculative Execution

Chapter 6

  1. Virtual Memory

  2. Overlays

  3. paging

  4. physical and virtual address space

  5. page table

  • design

  • components

  • operations

  • present/absent bit

  1. Demand paging

  • operation

  • page fault

  • working set

  1. Page replacement policy

  • working set

  • LRU

  • FIFO

  • thrashing

  • advantages

  1. Page size and fragmentation (internal, external), tradeoffs

  2. Segmentation

  • segments

  • operations

  • advantages, disadvantages

  • fragmentation

  • compare with paging

  1. Virtual memory Pentium 4

  • LDT, GDT

  • code segment descriptor

  • Page directory, page table, page frame

  • PSW – program status word

  • Kernel protection

  1. Machine language instruction formats; zero-, one-, two-, and three-operand instruction formats; tradeoffs of various instruction formats; expanding opcodes.

  1. Addressing; common addressing modes and their uses.

  1. Instruction types; data movement, dyadic and monadic, comparison and branch, and other instruction types.

Appendix A – Binary Numbers

  1. General principles

  2. Radix conversion

  3. Two's complement representation and use

  4. Binary arithmetic

Appendix B – Floating point representations

  1. General principles

    1. Regions

    2. Range and precision

    3. Representation

  2. IEEE floating point standard 754

    1. Be able to convert in both directions

    2. Know the different “special” values

-- JimSkon - 2012-12-05

Topic revision: r1 - 2012-12-05 - JimSkon
This site is powered by the TWiki collaboration platformCopyright &© by the contributing authors. All material on this collaboration platform is the property of the contributing authors.
Ideas, requests, problems regarding TWiki? Send feedback