DOC PREVIEW
U of I CS 231 - Midterm 1

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 1: Review2/26/2007Announcements HW4 due today (2/26) at 5pm. Solutions released shortly after for your considerationNO LATE HOMEWORKS!!NO LATE HOMEWORKS!! Cheating… Don’t do it.Topics Number systems Represent in various bases, convert between them, determine what base a 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 booleanalgebrausing booleanalgebra 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 functionof 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 formats we’ve discussed: truth table, sum of minterms, product of maxterms, booleanexpression, 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, 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/lowhigh/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)Be able to draw their internals (1-bit) Ripple-carry vs. carry lookahead vs. cascading carry lookahead Use them to implement


View Full Document

U of I CS 231 - Midterm 1

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 1
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 1 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 1 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?