DOC PREVIEW
U of I CS 231 - Midterm 2: Review

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

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

Unformatted text preview:

Midterm 2: Review4/09/2007Topics 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


View Full Document

U of I CS 231 - Midterm 2: 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 Midterm 2: 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 Midterm 2: 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 Midterm 2: 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?