StudyGuide - Yalamanchili Study Guide ECE 2030 E Fall 2006...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
Yalamanchili Study Guide ECE 2030 E: Fall 2006 Computing Systems Be able to state Moore’s Law and its basic consequences (read the web page) Conversion between decimal and binary number systems Basic components of a computing system Abstraction hierarchy: from transistors (switches) to data paths o You should know what the components are at each level Switch Design Can you distinguish between shorts and floats? From a switch diagram? Translate between Boolean expressions and switch level implementations Be able to design a pull-up network or pull-down network from a Boolean expression Be able to produce the dual of a switch network built with n-type (p-type) switches Produce switch implementations of all of the basic gates: AND, NAND, NOR, OR, INVERTER, XOR, XNOR o Including gates with more than two inputs Boolean Logic Be able to translate between Boolean expressions and gate level designs (not using mixed logic) Simplify Boolean expressions algebraically using the principal Boolean identities Understand the concept of universal gates and be able to demonstrate (algebraically) that NANDs and NORs are universal gates Understand standard forms for Boolean expressions o Be able to write the Sum of minterms or product of maxterms form of a Boolean expression from its truth table representation o Be able to convert between sum of minterms form and product of maxterms form for an expression algebraically o Algebraically simplify the sum of minterms or product of maxterms form Understand SOP and POS forms and their differences with sum of minterms and product of maxterms form What is the need for Boolean algebra? Can you compare two Boolean expressions and comment on the relative complexity of the gate level or transistor level implementation? Understand the dual of a Boolean function and be able to compute it
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Yalamanchili o Note: taking the dual and complementing each literal is a short cut to computing the complement of a Boolean function Gate Design Be able to write the truth tables for all basic gate types using positive and negative logic Understand the difference between active-low and active high signals o Be able to write the truth table for a basic gate (using 0,1) if one of the inputs is active low Know all pairs of DeMorgan’s equivalent gates and DeMorgan’s square (reference ECE 2030 Reading page handout on mixed logic) Using mixed logic, translate from a Boolean expression to a gate level implementation based on only o NOR gates o NAND gates o NOT and Inverter gates o NAND and inverter gates Be able to include active low signals in the translations between Boolean expressions and gate designs using mixed logic Determine the number of transistors required to implement a gate level design specified in mixed logic notation Why do we use mixed logic? Why is the implementation in specific gate types important?
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 09/29/2010 for the course GENERAL AR ECE 250 taught by Professor Drcapps during the Spring '10 term at N.C. State.

Page1 / 6

StudyGuide - Yalamanchili Study Guide ECE 2030 E Fall 2006...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online