DOC PREVIEW
U of I CS 231 - Final Review

This preview shows page 1-2-3 out of 8 pages.

Save
View full document
View full document
Premium Document
Do you want full access? Go Premium and unlock all 8 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 8 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 8 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 8 pages.
Access to all documents
Download any document
Ad free experience

Unformatted text preview:

Final Review5/02/2007Topics Dynamic memory, ROMs, PLAsUnderstand the basic properties of ROMs and PLAsBe able to program ROMs and PLAs to implement functionsOr, read a pre-programmed ROM/PLA and give the function in some other formatAs part of the former, do PLA minimization via K-mapsTopics DatapathSet the control variables for the datapathto perform a specific operation, or read the control variables to determine what’s happeningDetermine if an operation can be performed (likely in one clock cycle) by a given datapathThe register transfer languageTopics Instruction Set ArchitecturesBe familiar with the assembly instructions we’ve discussedBe able to program basic operations in assembly, or extract functionality from codeConvert basic high-level constructs (loops, conditions) to assembly codeTopics Instruction Set EncodingBe familiar with our 3 formats: Register, immediate, and jump and branchPC-relative vs. Absolute jump/branch addressingConvert assembly instructions to machine language, vice versaWe’ll provide references for anything you needTopics Control Unit IntroductionUnderstand the various portions and how they’re interconnectedInstruction RAM/ROMProgram CounterInstruction DecoderBranch Control UnitBe able to generate any of the control variables from the machine languageTopics Other ISAsBe familiar with the various addressing types (what they mean and how to identify them)Be able to convert between instructions in 3-address, 2-address, 1-address and 0-addressRegister-to-register, memory-to-memory, and register-to-memory architecturesTopics Non-integer representationFixed-point numbersFloating-point numbersVarious properties and differences between


View Full Document

U of I CS 231 - Final Review

Documents in this Course
Counters

Counters

23 pages

Latches

Latches

22 pages

Lecture

Lecture

33 pages

Lecture

Lecture

16 pages

Lecture

Lecture

4 pages

Datapaths

Datapaths

30 pages

Lecture

Lecture

6 pages

Registers

Registers

17 pages

Datapaths

Datapaths

28 pages

Decoders

Decoders

20 pages

Load more
Download Final Review
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view Final Review and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view Final Review 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?