Term
| Computer Organization Encompasses what? |
|
Definition
All physical aspects of computer systems
(e.g. circuit design, control signals, memory types.) |
|
|
Term
| Is there a distinction between hardware and software? |
|
Definition
| There is no distinction between the two. |
|
|
Term
| What is a problem with software and hardware? |
|
Definition
Software is fast to make, but slows down over time because of bounded hardware.
Hardware is bounded by what it's built for, however it's fast for the purpose it was made for. |
|
|
Term
|
Definition
a processor to interpret and execute programs
memory to store data
a mechanism for transferring data to and from the outside world. |
|
|
Term
|
Definition
| Kilo,Mega,Giga,Tera,Peta,Exa,Zetta,Yotta |
|
|
Term
|
Definition
|
|
Term
|
Definition
|
|
Term
|
Definition
10^9 and 2^30
1,000,000,000 |
|
|
Term
|
Definition
| Clock cycles per Second (frequency) |
|
|
Term
|
Definition
1KB = 2^10 = 1024
1MB = 2^20 = |
|
|
Term
|
Definition
| Milli, Micro, Nano, Pico, Femto, Atto, Zepto, Yocto |
|
|
Term
| Computers with large main memory capacity can |
|
Definition
|
|
Term
|
Definition
| random access memory, you can access the location directly if you know exactly where it is. |
|
|
Term
|
Definition
| a type of temporary memory than can be accessed faster than RAM |
|
|
Term
|
Definition
| Not random, but can be faster if you don't need random access. |
|
|
Term
|
Definition
They allow movement of data between a system and its external devices.
CPU doesn't know about external devices. It keeps things in memory and waits. |
|
|
Term
|
Definition
| Serial ports, parallel ports, USB |
|
|
Term
| Principle of hardware software equivalence |
|
Definition
| Where software and hardware meet to allow for virtually anything. |
|
|
Term
|
Definition
| Institute of Electrical and Electronic Engineers |
|
|
Term
|
Definition
| International Telecommunications union |
|
|
Term
|
Definition
| International Organization of Standaradization |
|
|
Term
|
Definition
| Mechanical Calculating Machines 1642 - 1645 |
|
|
Term
|
Definition
| Wilhelm Schickard (1592 - 1635) |
|
|
Term
|
Definition
| Blaise Pascal (1623 - 1662) |
|
|
Term
|
Definition
| Charles Babbage (1791 - 1871), also designed but never built the Analytical Engine. |
|
|
Term
| Punched card tabulating machines |
|
Definition
| Herman Hollerith (1860 - 1929) |
|
|
Term
| Analog computing vs Digital computing |
|
Definition
Analog allows for very large precise data bits.
Digital is bounded by how deep the mathematical limits are in Binary) |
|
|
Term
| First Gen: Vaccuum tube computers |
|
Definition
| Atanasoff Berry Computer (1937 - 1938) Solved systems of linear equations |
|
|
Term
|
Definition
| First programmable computer. Programmed with wires. |
|
|
Term
| Second Gen: Transistorized Computers |
|
Definition
| (1954 - 1965) Smaller amount of power, and faster |
|
|
Term
| Third Gen: Integrated Circuits Computers |
|
Definition
|
|
Term
|
Definition
| The creation of microprocessors |
|
|
Term
|
Definition
The density of transistors in an integrated circuit will double every year
technically 18 months |
|
|
Term
|
Definition
| a chip plant under contruction cost well over $4 billon |
|
|
Term
|
Definition
| Rock's law must fall, or vice versa. No one can say which will give out first. |
|
|
Term
|
Definition
| The longest form that any product conforms |
|
|
Term
| What should you use to get to the canonical form? |
|
Definition
|
|
Term
| How do you find the And's in a truth table? |
|
Definition
To find the And's use the 1's in the truth table.
where a is a variable
and not is a '
0 = a'
1 = a
010 = x'yz' |
|
|
Term
| How do you find the Or's in a truth table? |
|
Definition
To find the Or's use the 0's in the truth table.
where a is a variable
and not is a '
0 = a'
1 = a |
|
|
Term
|
Definition
| Simplification of boolean functions leads to simpler (and usually faster) digital circuit. |
|
|
Term
|
Definition
| Maurice Karnaugh invented it after seeing patterns of truth tables. |
|
|
Term
|
Definition
|
|
Term
|
Definition
| Is a matrix consisting of rows and columns that represent the output values of a boolean function |
|
|
Term
|
Definition
| a product term that contains all of the function's variables exactly once. |
|
|
Term
|
Definition
minterm... x...y
x'y'...... 0...1
x'y ...... 1...0
xy' ...... 1...1
xy ....... 0...0 |
|
|
Term
|
Definition
groupings cn contain only 1s; no 0s
groups can be formed only at right angles
no diagonal groups
the number of 1s in a groups must be a power of 2
the groups must be made as large as possibles
groups can overlap and wrap around the sides. |
|
|
Term
|
Definition
|
|
Term
|
Definition
|
|
Term
|
Definition
|
|
Term
| When is an XOR gate true?[image] |
|
Definition
| true only when the values of the inputs differ. |
|
|
Term
|
Definition
| As the name implies sequential logic circuits require a means by which events can be sequenced |
|
|
Term
|
Definition
|
|
Term
|
Definition
| a special circuit that sends electrical pulses through a circuit |
|
|
Term
| TO retain their state values, sequential circuits rely on? |
|
Definition
|
|
Term
| Feedback in digital circuits occurs when an output is |
|
Definition
|
|
Term
|
Definition
| Flip flops are a type of sequential circuit. They have 1 outpt, the only have 2 states.q |
|
|
Term
|
Definition
|
|
Term
|
Definition
|
|
Term
|
Definition
|
|
Term
|
Definition
|
|
Term
Bitwise Op
What is the & sign? |
|
Definition
|
|
Term
Bitwise Op
What is the | sign? |
|
Definition
|
|
Term
Bitwise Op
What is the ^ sign? |
|
Definition
|
|
Term
Bitwise Op
What is the ~ sign? |
|
Definition
|
|
Term
| What is Bitwise Operators used for? |
|
Definition
| Taking a number and converting it into base 2 |
|
|
Term
| What are the layers of the machine? |
|
Definition
|
|
Term
| What generation are we on in terms of technology? |
|
Definition
|
|
Term
|
Definition
| Make a mask, data compression |
|
|
Term
|
Definition
| a map to minimize functions |
|
|
Term
|
Definition
| a table to find the correct outputs from inputs. |
|
|
Term
| How do you write a decoder? |
|
Definition
|
|
Term
| 3 basic components of NANDS and NORS |
|
Definition
|
|
Term
|
Definition
|
|
Term
How do you reset 1's to 0's
010101000111 |
|
Definition
Subtraction:
010101000111
010010010010
Compliment:
010101000111
101101101101
111101101111
AND:
010101000111
101101101101
000101000101 |
|
|
