Understanding Computer Arithmetic and Control

What is the difference between hardwired control and micro programmed control?

• Hardwired control is slower but more flexible.

• Hardwired control is faster but less flexible, while micro programmed control is more flexible but slower.

• Micro programmed control is faster and less efficient.

• Both control methods are equally fast and flexible.

Explain the concept of signed and unsigned number representations.

• Signed numbers can represent both positive and negative values, while unsigned numbers can only represent non-negative values.

• Both signed and unsigned numbers can represent only zero.

• Unsigned numbers can represent both positive and negative values.

• Signed numbers can only represent positive values.

How do you perform binary addition with signed numbers?

• Align the numbers, add bit by bit, carry over, and interpret the result.

• Perform decimal addition and convert the result back to binary.

• Align the numbers, subtract bit by bit, and ignore the carry.

• Add the numbers without considering the sign and interpret as unsigned.

What is the process for binary subtraction?

• Binary subtraction involves aligning the numbers, subtracting bit by bit, and borrowing when necessary.

• Converting to decimal before subtraction

• Subtracting the least significant bit only

• Aligning the numbers and adding them together

Describe the function of fast adders in arithmetic operations.

• Fast adders only work with binary numbers and not with decimal numbers.

• Fast adders are used exclusively for subtraction in arithmetic operations.

• Fast adders enhance the speed of arithmetic operations by efficiently calculating carry bits.

• Fast adders slow down arithmetic operations by increasing carry bits.

Explain the steps involved in binary multiplication.

• Use only the first bit of each number for the result

• Add the numbers directly without any multiplication

• Convert the binary numbers to decimal before multiplying

• Binary multiplication is performed by multiplying each bit of one number by the other and summing the results.

What is the Booth algorithm and how does it work?

• The Booth algorithm is a method for multiplying signed binary numbers efficiently.

• The Booth algorithm is a technique for converting decimal numbers to binary.

• The Booth algorithm is a method for adding unsigned binary numbers.

• The Booth algorithm is used for sorting binary numbers.

Outline the method for binary division.

• Binary division is performed by converting the numbers to decimal and dividing normally.

• The method for binary division uses multiplication of the dividend by the divisor.

• The method for binary division involves repeated subtraction of the divisor from the dividend, similar to long division in decimal.

• The process involves adding the divisor to the dividend repeatedly until the dividend is zero.

What are floating point numbers and why are they used?

• Floating point numbers are only used for whole numbers.

• Floating point numbers are a type of character encoding.

• Floating point numbers are numerical representations that allow for the expression of real numbers, including fractions, using a format that can handle a wide range of values.

• Floating point numbers are used exclusively in graphics programming.

How is a floating point number represented in binary?

• A floating point number is represented as a single integer in binary.

• A floating point number consists of only a sign bit without an exponent or fraction.

• Floating point numbers are only represented using whole numbers in binary.

• A floating point number is represented in binary using the IEEE 754 standard, consisting of a sign bit, exponent, and fraction.