click below
click below
Normal Size Small Size show me how
com 3
Question | Answer |
---|---|
The decimal system has a base of(BLANK) _ | base 10 |
Which digit represents “hundreds” in the number 8732? | 7 |
In the number 3109, the 3 is referred to as the(BLANK) | thousands |
In the number 3109, the 9 is referred to as the(BLANK) | ones |
Numbers in the binary system are represented to the(BLANK) | base-2 numeral system |
Hexadecimal has a base of(BLANK) | base 16 |
The binary string 110111100001 is equivalent to(BLANK) | DE1 |
The(BLANK) system uses only the numbers 0 and 1 | binary number system |
Decimal “10” is (BLANK) in binary | 1010 |
Decimal “10” is(BLANK) in hexadecimal | A |
Four bits is called a(BLANK) | nibble |
Another term for “base” is(BLANK) _ _ | radix |
Binary 0101 is hexadecimal(BLANK) _ | 5 |
In everyday life we use a system based on decimal digits to represent numbers, and refer to the system as the(BLANK) _ | decimal system |
In any number, the leftmost digit is referred to as the(BLANK) digit because it carries the highest value | most significant |
The rightmost digit is called the(BLANK) _ digit | least significant |
In the decimal system,(BLANK) is the maximum value that a position can hold before it flips over into the next higher position | 9 |
In a(BLANK) number system, each number is represented by a string of digits in which each digit position i has an associated weight ri, where r is the radix of the number system | positional |
The(BLANK) system has only two digits, 0 and 1 | binary |
In the(BLANK) system, 10 different digits are used to represent numbers with a base of 10 | decimal |
Binary digits grouped into sets of four bits are called a (BLANK)_ | nibble |
To convert a number from binary notation to decimal notation all that is required is to multiply each binary digit by the appropriate power of(BLANK) and add the results | 2 |
The decimal system has a radix of(BLANK) _ | 10 |
Because 16 symbols are used, the notation is called hexadecimal and the 16 symbols are the(BLANK) _ | hexadecimal digits |
Given ( . . . a3a2a1a0.a-1a-2a-3 . . . )r, the dot between a0 and a-1 is called the(BLANK) | radix point |
In the decimal system,(BLANK) _ different digits are used to represent numbers with a base of 10 | 10 |
(2 x 10-1) + (5 x 10-2) + (6 x 10-3) represents the number(BLANK) | 0.256 |
Binary 0001 0000 0000 represents(BLANK) in hexadecimal | 10 |
(BLANK) _ representation is almost universally used as the processor representation for integers | Twos compliment |
Moving the sign bit to the new leftmost position and filling in with copies of the sign bit is called(BLANK) | sign extension |
In(BLANK) _ representation the rule for forming the negation of an integer is to invert the sign bit | sign-magnitude |
(BLANK) is when the result may be larger than can be held in the word size being used | Overflow |
(BLANK) _ involves the generation of partial products, one for each digit in the multiplier, which are then summed to produce the final product | Multiplication |
Although considered obsolete, the term(BLANK) is sometimes used instead of significand | mantissa |
Negative numbers less than –(2 – 2-23) x 2 128 are called(BLANK) _ | negative overflow |
Negative numbers greater than 2-127 are called(BLANK) _ | negative underflow |
Positive numbers less than 2-127 are called(BLANK) | positive underflow |
Positive numbers greater than (2 – 2-23) x 2-128 are called (BLANK)_ | positive overflow |
(BLANK) are included in IEEE 754 to handle cases of exponent underflow | Subnormal numbers |
(BLANK) _ is when a positive exponent exceeds the maximum possible exponent value | Exponent overflow |
(BLANK) _ means that the number is too small to be represented and it may be reported as 0 | Positive underflow |
The (BLANK) is that part of the computer that actually performs arithmetic and logical operations on data | arithmetic/logic unit (ALU) |
Extending the range of numbers that can be expressed by increasing the bit length is referred to as (BLANK) | Sign extension |
(BLANK) representation is when the radix point is fixed and assumed to be to the right of the rightmost digit | Fixed point |
If two numbers are added, and they are both positive or both negative, then(BLANK) occurs if and only if the result has the opposite sign | Overflow rule |
“To subtract one number from another, take the twos complement of the subtrahend and add it to the minuend” is the (BLANK) rule | Subtraction |
When the divisor is able to divide the number, a 1 is placed in the quotient and the divisor is subtracted from the partial dividend; the result is referred to as a (BLANK) | Partial remainer |
A (BLANK) is one in which the most significant digit of the significand is nonzero | Normal number |
(BLANK) occurs when an arithmetic operation results in an absolute value greater than can be expressed with an exponent of 128 | Overflow |
The most important floating-point representation is defined in IEEE Standard(BLANK) __, adopted in 1985 and revised in 2008 | 754 |
(BLANK) _ format is a fully specified, fixed-length binary encoding that allows data interchange between different platforms and that can be used for storage | interchange |
(BLANK) format covers five floating-point representations, three binary and two decimal, whose encodings are specified by the standard, and which can be used for arithmetic | basic |
IEEE 754-2008 defines an (BLANK) __ format as a format with a precision and range that are defined under user control | extendable precision |
The register contains additional bits, called (BLANK) , which are used to pad out the right end of the significand with 0s | guard bits |
(BLANK) _ is when the result is put back into the floating-point format and the extra bits must be eliminated in such a way as to produce a result that is close to the exact result | Rounding |
The use of subnormal numbers is referred to as (BLANK) underflow | gradua |
The operand (BLANK)_ yields true if and only if both of its operands are true | AND |
The operation (BLANK)_ yields true if either or both of its operands are true | OR |
The unary operation (BLANK) inverts the value of its operand | NOT |
A (BLANK) is an electronic circuit that produces an output signal that is a simple Boolean operation on its input signals | gate |
For more than four variables an alternative approach is a tabular technique referred to as the(BLANK) method | Quine-McCluskey |
(BLANK) are used in digital circuits to control signal and data routing | Multiplexers |
(BLANK) is implemented with combinational circuits | Read only memory |
The (BLANK) exists in one of two states and, in the absence of input, remains in that state | flip-flop |
The(BLANK) flip-flop has two inputs and all possible combinations of input values are valid | J-K |
A (BLANK) accepts and/or transfers information serially | shift register |
Counters can be designated as(BLANK) | both asynchronous and synchronous |
CPUs make use of (BLANK) counters, in which all of the flip-flops of the counter change at the same time | synchronous |
The (BLANK) table provides the value of the next output when the inputs and the present output are known, which is exactly the information needed to design the counter or any sequential circuit | excitation |
A (BLANK) is a PLD featuring a general structure that allows very high logic capacity and offers more narrow logic resources and a higher ration of flip-flops to logic resources than do CPLDs | FPG |
The digital circuitry in digital computers and other digital systems is designed, and its behavior is analyzed, with the use of a mathematical discipline known as (BLANK) __ | Boolean algebra |
The basic logical operations of Boolean algebra are AND, OR, and (BLANK) _ | NOT |
The fundamental building block of all digital logic circuits is the(BLANK) _ | gate |
Each gate is defined in three ways: graphic symbol, algebraic notation, and(BLANK) __ _ | truth table |
To(BLANK) _ a signal is to cause a signal line to make a transition from its logically false (0) state to its logically true (1) state | assert |
A(BLANK) _ is an interconnected set of gates whose output at any time is a function only of the input at that time | combinational circuit |
A combinational circuit can be defined by Boolean equations, truth table, and(BLANK) | graphical symbols |
Consisting of an array of 2” squares representing all possible combinations of values of n binary variables, the (BLANK) is a convenient way of representing a Boolean function of a small number (up to four) of variables | Karnaugh map |
The(BLANK) connects multiple inputs to a single output | multiplexer |
A(BLANK) is a combinational circuit with a number of output lines, only one of which is asserted at any time | decoder |
The simplest form of sequential circuit is the(BLANK) | flip-flop |
A (BLANK) _ is a register whose value is easily incremented by 1 modulo the capacity of the register | counter |
An asynchronous counter is also referred to as a (BLANK) because the change that occurs to increment the counter starts at one end and “ripples” through to the other end | ripple counter |
A (BLANK) is a relatively small PLD that contains two levels of logic, an AND-plane and an OR-plane, where both levels are programmable | programmable logic array (PLA) |
Also referred to as a field-programmable device (FPD), a(BLANK) refers to any type of integrated circuit used for implementing digital hardware, where the chip can be configured by the end user to realize different designs | programmable logic device (PLD) |
(BLANK) formats extend a supported basic format by providing additional bits in the exponent and in the significand | Extended precision |