<- previous    index    next ->

Lecture 30 Final Exam

The midterm was considered the end of the Assembly Language
part of this course. Thus, the final exam will cover 
lectures 15 through 29 on digital logic and computer organization.

There will be questions of types:
  true-false
  multiple choice
  short answer (words, numbers, logic equations)

     know the symbols and truth tables for
     "and"  "nand" "or"  "nor" "not"  "xor" "mux"  "dff"

     know how to recognize the corresponding State Diagram,
     State Transition Table and schematic and VHDL statements
     for sequential logic. (e.g. project)

     know how to construct Karnaugh map from minterms.

     know how to get VHDL equation from Karnaugh map.

     recognize adders, subtractors and simple logic circuits.

     understand data flow through a computer architecture.

Automate!

    <- previous    index    next ->

Other links

Go to top