Transcript Exam 1
CS 325: CS Hardware and Software Organization and Architecture Exam 1: Study Guide Introduction •Reasons to study computer architecture •Components of the CPU •Generations of computing •7 Levels of computer hierarchy •Von Neumann Architecture Number Systems • Number Representation • Decimal • Binary • Octal • Hexadecimal • Number Conversions • Between all bases listed above • Signed Number Representation • Sign and Magnitude • 1’s complement • 2’s complement • Signed Number Conversions • Overflow • 2’s Complement Binary Arithmetic • Addition, Subtraction, Multiplication, Division • Boolean Algebra Logic Gates • Operators: AND, OR, NOT, NAND, NOR, XOR, XNOR • Truth Tables • Representing gates, functions, checking for correctness • Boolean Functions • SOP, POS • Logic Gate Diagrams • Conversions • Truth tables, Boolean functions, logic gate diagrams • Fan-in, Fan-out • Propagation delay • Boolean Algebra laws • Function/gate reduction • Karnaugh Maps Combinational Circuits •Definition of combinational circuit •1-bit half, full, 4-bit, n-bit binary adder • Gate and block diagrams •N-bit binary subtractor •Binary Decoder •Schematic for 2-input ALU with up to four functions • Logical unit, arithmetic unit, decoding unit Supplemental Reading •First Draft of a Report on the EDVAC •The Computer as von Newmann Planned it Exam 1 Format • Five questions •Covers material from lecture 1 through lecture 9 •May have multiple components (a, b, c, …) •Circle one question you want to omit •Exam graded out of 4 equally weighted questions •You may bring one 3” x 5” note card for help on the exam •Front/back •No calculators!