Part 1 Flashcards
Why does it matter how many bits you use for a given data type?
arithmetic operations on larger bits of data (i.e. 32 bit) generate more heat than say 8 bit data
How many numbers can be stored in an unsigned 8 bit representation AND from which number until which one.
- From 0 to 255
What is wrong with sign-magnitude representation?
It wastes one number in 0 and -0 and allows only a range from -127 unitl 127. Only 255 numbers
How does 2s complement representation work?
It’s an alternative to sign-magnitude and it works by changing the value of the MBS from positive to negative
What are the benefits of 2s complement?
It allows a range of 256 numbers and the circuitry for addition is the same as for subtraction- -128 to 127
What is a disadvantage of 2s complement
When you are subtracting a smaller number from a larger number you get a lot of negative numbers which translates into a lot of bit flips generating a lot of heat
What’s wrong with floating point numbers?
Precision: Dividing a very large number by a very small one might result in an inaccurate output
What is the definition of a proposition?
We can tell whether statement is true or false and it’s unambiguous. “It is true that”
What is the complement of: e = x or y or z
(not)e = (not)x and (not)y and (not)z
Minterms and maxterms. Where do they appear? and what are they equivalent to?
Minterms are products and appear in DNF. Maxterms are sums and appear in CNF
What is the difference between a PMOS and a NMOS transistor?
PMOS is initially closed and allows current to flow. It opens when applied 1. NMOS is initially open and closes when applied a 1
In an inverter, which transistor is open and which is closed when A is set to VDD
NMOS (0) transistor is closed setting Q to VSS and PMOS is open (1)
What logic gates are used for the sum and carry outputs in an adder respectively?
sum: xor
carry: and
When is XOR defined to be true for multiple arguments?
If and only if an odd number of args is true (a XOR b XOR c)
What is the (negative) implication of implementing a ripple-carry adder?
You have to wait for the signal to propagate to know the value of higher order bits
Why do we need log2(N) number of select bits when N = number of signals to select from?
Because N represents the number of select signals we have and we need the appropriate number of bits to represent that amount of singals. I.e to represent 8 (select signals) we need 3 bits (which can represent up to 8 combinations)