CS 3843 Final Exam Review
Fall 2013
December 5, 2013
Topics
• What to cover?
– Lectures for Chapter 2, Chapter 3 and Chapter 4.1-4.3
– Lectures on truth table, Karnaugh Map
– Class notes for Chapters 2-4
• What are allowed?
– Scientific calculator
– Two sheets of note (both sides, standard 11’×8.5’ letter size)
– The Y86 encoding diagram will be provided.
• What is not allowed?
– Talking to each other
– Other notes and book materials
Final Exam Scores
• Assignments: 20%
– Assignment 0 and Assignment 1-6
• Quizzes and recitation participation: 10%
– Quiz: drop 1 lowest grade out of 5 (5%)
– Recitation participation: 5%
• Midterms: 35%
– Two midterms (17.5% each)
• Final Exam: 35%
Any Questions about your grading
• TA: K. M. Sabidur Rahman
Office: FLN (f.SB)3.01.04
Email: kmsabidurrahman@gmail.com
Tips
• Study
– Assignments 1-6 and their solutions
– Quizzes 1-5
– Practice Problems
– Lecture Slides
– Practice problems
• Solutions are available under
– http://www.cs.utsa.edu/~qitian/CS3843/
Chapter 2
•
Conversion between different numbering systems
–
–
–
•
Binary representation of n-bit word for signed and unsigned integers
–
•
&, |, ^, ~
&&, ||, !
Shift operators (<<, >>A, >>L)
Number representations using different data types (int, short, char, long)
n-bit IEEE floating-point representation
–
–
–
–
•
2’s, 1’s complement and sign/magnitude
Boolean operators and logical operators
–
–
•
•
•
Based R representation and its conversion to decimal
Conversion between decimal, binary, and hexadecimal
Integer and Fraction part
S, M, E, bias, exp (k bits), frac (n bits)
Single precision and double precision
Normalized, denormalized, special values (+/- inf, NAN)
Largest, smallest value
Rounding
–
Round-to-even; Round-towards-zero; Round-down, Round-up
Chapter 3
• Trace the register values in given assembly
procedure
• Understand all the IA32 assembly
instructions, different operands and memory
addressing modes;
• Understand Assembly Codes and Write
Correct Comments
Chapter 3 (continued …)
• Understand Conditional Codes (ZF, SF, OF,
and CF)
• Write C codes from the given assembly codes
and vice versa;
• Identify and correct any mistakes in given
assembly instructions
Chapter 4
•
•
•
•
Y86 instruction encodings
Translate object code to assembly code
Translate Y86 instructions to object code
Truth table and basic block diagram of logic gates (AND,
OR, NOT, XOR, NAND, NOR), MUX, ALU, 1-bit full adder
• Function complete set
• Truth Table and two-, three-, four-varibales KarnaughMap
– minterm, maxterm, don’t-care term
– Minimum sum-of-product solution