DOC PREVIEW
U of I CS 231 - Final Review

This preview shows page 1-2-22-23 out of 23 pages.

Save
View full document
View full document
Premium Document
Do you want full access? Go Premium and unlock all 23 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 23 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 23 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 23 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 23 pages.
Access to all documents
Download any document
Ad free experience

Unformatted text preview:

Final Review8/01/2007Topics Number systemsRepresent in various bases, convert between them, determine what base a number is in given decimal equivalentRepresent and work with signed numbers in all 3 formats we discussedAdd, subtract, multiplyTopics Boolean AlgebraBe able to reduce a boolean expression using boolean algebraBe able to derive equivalency between two expressionsYou’ll be given a listing of rules if neededTopics Karnaugh MapsBe able to use them to find MSP and MPS of some functionImplicants – Prime, EssentialDon’t Care’sTopics FunctionsBe able to represent them in all the formats we’ve discussed: truth table, sum of minterms, product of maxterms, boolean expression, etc.Be able to convert between these formatsBe able, given a description, to decide on the appropriate function(s)Topics GatesKnow and recognize all gate types we’ve discussed: AND, OR, NOT, NOR, NAND, XORBe able to implement a function as a circuit, convert it to all NAND or all NOR gatesBe able to deduce a function from a circuitTopics Decoders and MultiplexersRecognize block diagrams – active high/lowKnow how they functionUse them to implement a function(s)Again, be able to recover a function given a circuitTopics AddersKnow the difference between full/halfBe able to draw their internals (1-bit)Ripple-carry vs. carry lookahead vs. cascading carry lookaheadUse them to implement subtractionTopics ALUsModify inputs to adders to cause it to compute new functions.Determine which functions are implemented.Be sure which system you’re representing numbers inE.g. A-B in 1’s complement is A-B-1 in 2’s complement.Logical vs. Arithmetic. Bitwise vs. LogicalTopics LatchesCombinational vs. Sequential CircuitsBasic properties of memorySR latchS=1: set; R=1: reset SR=11: illegal inputTiming diagram;D latchControl/Data inputsTopics Flip FlopsClock edge triggered (positive or negative)Clock inputsD/JK/T flip-flops.Characteristic and excitation tables provided.Convert from one to anotherDirect (asynchronous) inputsTopics Sequential Circuit AnalysisBasically, determine what a circuit is doingConvert from a circuit to a state tableDetermine FF inputs, next states and outputsConvert from a state table to a state diagramTopics Sequential Circuit DesignGoing the other way: create a circuit to implement a specific deviceCreate a state diagram for some device (state recognizer, etc.) Convert a state diagram to a state tableConvert from a state table to a circuitMin. number of flip flops?TopicsCountersBe able to combine Counter-4’s to make larger countersAlter counting pathsStopping before reaching max valueStarting higher than 0Skipping values, etc.CO=0 when (UP=1 and value = 1111 orwhen UP =0 and value = 0000) and the counter is enabled.Create new counters from scratch (circuit design)Self-starting counterFrequency of a counterTopics Registers & Shift RegistersGrouping of conjoined Flip FlopsParallel load implementationShift left, shift rightCircular shiftsSwitch-tail ring countersMuxes to choose functionsTopicsRAMAddress lines for a size of ram.Each doubling in the address space adds 1 address line. Log2growth.Word size changes do not affect the number of address lines.Combine RAM chips to create larger RAM (both more address space and larger words)Use decoders to turn on/off proper chipsAddress ranges for chipsTopics 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?