Clemson University -- CPSC 231 -- Fall 2007 -- Study Guide for Exam 2

The second exam covers chapters 2 through 4.


1. Be able to define and discuss these terms:

        debugger

        condition codes (NZVC)             branching

        binary logic                       logic operations (and, or, not)

        unsigned binary number             signed binary number
        hexadecimal                        two's complement

        %g0                                synthetic instruction
        ASCII character                    byte

        binary addition                    binary subtraction

        logical shift                      arithmetic shift
        sign extension

        field extraction                   field insertion

        multiplication                     restoring division

        aligned operand                    unaligned operand
        big-endian                         little-endian


2. Be able to determine the range of an unsigned or signed bit field without
   a calculator.

3. Be able to convert numbers from decimal to or from hexadecimal or binary
   without a calculator.

4. Be able to add and subtract binary or hexadecimal numbers using two's
   complement without a calculator.

5. Be able to trace the actions of a segment of assembly language.

6. Be able to show the steps required in multiplication, as in the general
   example on page 128.  (The details of mulscc are _not_ required.)

7. Be able to show an equivalent set of shifts and adds that can replace a
   given multiply.

8. be able to show data storage in memory in big-endian and little-endian
   formats.

9. Given a C or Java fragment, be able to show the equivalent SPARC assembly
   language.