click below
click below
Normal Size Small Size show me how
3150 - Module #1
Introduction/Background
Question | Answer |
---|---|
What is the definition of a computer? | It's a collection of interconnected components in order to perform a well defined function. The function of the computer is a mapping of the input data to the output data: F: A -> B. |
What are the interconnected components of a computer? | It's made up of 5 components. The input unit, output unit, and memory unit are the first three. Then the central processing unit (CPU) contains the last two: the control unit (CU) and arithmetic logic unit (ALU). |
What does the input unit of the computer do? | it's an interface between the outside world and the internal parts. It performs two tasks: transmission and translation of information. |
What does the output unit of the computer do? | It's an interface between the internal parts and the outside world. It performs transmission and translation of information just like the input unit. |
What does the memory unit of the computer do? | It acts as storage. It stores the instructions, data, intermediate, and final results. |
What does the central processing unit of the computer do? | It interprets the instructions and initiates their executions. It also performs arithmetic and logical operations on the data. |
What are the four different levels a computer can be studied at? | They are the electronic, logic, programming, and system levels. |
How do you convert a number from base R to base Q? | Convert the number from base R to base 10 (decimal). Then, you convert the decimal number to base Q. Base R to decimal is done by summing the positional weights, and decimal from base Q is done by repeated division. |
How do you convert a decimal fraction to base R? | This is done by iterative multiplication of fractions by base R and recording the integer parts. |
How do you convert a fraction from base R to decimal fraction? | This is done by summing the multiplications of the positional weights in base R. |
What's the minimum number of arithmetic operations needed to carry out all arithmetic operations? | This would be negation and addition. This is because multiplication is a sequence of additions, subtraction is the complement/negation, and division is a sequence of subtractions. |
What's the minimum number of logic operations needed to carry out all logic operations? | This would be either AND and NOT or OR and NOT because of DeMorgan's Law. You would not need both, only one pair or the other. |
What's the definition of 2s complement of a binary number? | The 2s complement of a binary number, A, is a binary number, A~, such that if added to A the result will be all 0s with a carry out. |
What's the definition of 1s complement of a binary number? | The 1s complement of a binary number, A, is a binary number, A', such that if added to A the result will be all 1s with no carry out. |
What's the 16s complement of '0345'? Explain your answer. | The 16s complement of '0345' is 'FCBB'. Thinking logically, if you added these two numbers, then the answer would be all 0s. |
What are the universal functions? Why is this the case? | NAND and NOR are called universal functions since with either one we can generate AND, OR, and NOT gates. |
What is primary memory? | It is also called main memory. It's a volatile/nonvolatile memory that holds the program and intermediate data during the course of a program execution. |
What is secondary memory? | It's a nonvolatile memory that's used to hold the program and data between runs. |
What is the definition of translation (in regards to the input/output units)? | Translation is to change information from one form of representation to another without changing the meaning. |
What is the definition of transmission (in regards to the input/output units)? | Transmission is the act of sending information from one location and the receiving of the same information in another location. |
What's the time delay of a parallel/ripple adder? Explain your answer. | 2(n - 1)△T + 4△T The 4△T exists because a and b take 2△T each, and they don't depend on the carry in before so they're done simultaneously. The 2(n - 1)△T is the delay of the carry bit, and the (n - 1) is because there's no delay on the first adder. |
What's the time delay of a half adder? | 2△T |
What to practice? | Know: conversions from all bases, homework #1, past tests, diagram on slide 12, diagram of the half adder and parallel adders. |
What's the time delay of a full adder? | 4△T |