Reading...
Play button
Play button
Use LEFT and RIGHT arrow keys to navigate between flashcards;
Use UP and DOWN arrow keys to flip the card;
H to show hint;
A reads text to speech;
80 Cards in this Set
- Front
- Back
- 3rd side (hint)
|
The prefix denoting 10^15
|
peta
|
|
|
|
The prefix denoting 10^12
|
tera
|
both answer and number of zeros start with 't'
|
|
|
The prefix denoting 10^9
|
giga
|
|
|
|
The prefix denoting 10^6
|
mega
|
|
|
|
The prefix denoting 10^3
|
kilo
|
|
|
|
The prefix denoting 10^-3
|
milli
|
|
|
|
The prefix denoting 10^-6
|
micro
|
|
|
|
The prefix denoting 10^-9
|
nano
|
The answer and number of zeros both start with 'n'
|
|
|
The prefix denoting 10^-12
|
pico
|
|
|
|
The prefix denoting 10^-15
|
femto
|
|
|
|
4 in binary
|
0100
|
|
|
|
5 in binary
|
0101
|
|
|
|
2 in binary
|
0010
|
|
|
|
6 in binary
|
0110
|
|
|
|
7 in binary
|
0111
|
|
|
|
8 in binary
|
1000
|
|
|
|
9 in binary
|
1001
|
|
|
|
10 in binary
|
1010
|
|
|
|
11 in binary
|
1011
|
|
|
|
12 in binary
|
1100
|
|
|
|
13 in binary
|
1101
|
|
|
|
14 in binary
|
1110
|
|
|
|
15 in binary
|
1111
|
|
|
|
10 in hex
|
A
|
|
|
|
11 in hex
|
B
|
|
|
|
12
|
C
|
|
|
|
13 in hex
|
D
|
|
|
|
14
|
E
|
|
|
|
15 in hex
|
F
|
|
|
|
A mental model that removes complex details
|
Abstraction
|
|
|
|
A byte is how many bits?
|
8
|
|
|
|
Analog data is continuous. Digital data is ______?
|
Discrete
|
|
|
|
n bits can represent how many things?
|
2n
|
|
|
|
digits in the value
|
mantissa
|
|
|
|
Individual dots used to represent a picture; stands for 'picture elements'
|
pixels
|
|
|
|
The number of pixels used to represent a picture
|
resolution
|
|
|
|
Storing image information pixel by pixel
|
Raster-graphics format
|
|
|
|
State the value of X in the Boolean expression:
X = A' |
NOT A
|
|
|
|
State the value of X in the Boolean expression:
X = A . B |
A AND B
|
|
|
|
State the value of X in the Boolean expression:
X = (A . B)' |
A NAND B
|
|
|
|
State the value of X in the Boolean expression:
X = (A + B)' |
A NOR B
|
|
|
|
State the value of X in the Boolean expression:
X = (A + B) |
A OR B
|
|
|
|
State the value of X in the Boolean expression:
X = (A (+) B) |
A XOR B
|
|
|
|
A device that acts either as a wire or a resistor, depending on the voltage level of an input signal
|
transistor
|
|
|
|
A circuit that computes the sum of two bits and produces the appropriate carry bit
|
half adder
|
|
|
|
An electronic circuit that performs and addition operation on binary values
|
adder
|
|
|
|
In Boolean algebra, the property below is called
(AB)' = A' + B' (A+B)' = A'B' |
DeMorgan's law
|
|
|
|
A circuit that uses a few input control signals to determine which of several input data lines is routed to its output
|
mulitplexer
|
|
|
|
The number of bits stored in each addressable location in memory
|
addressibility
|
|
|
|
The register that contains the instruction currently being executed
|
Instruction register (IR)
|
|
|
|
The register that contains the address of the next instruction to be executed
|
Program counter (PC)
|
|
|
|
5 characteristics of the von Neumann architecture
|
1. memory unit
2. arithmetic/logic unit 3. input unit 4. output unit 5. control unit |
|
|
|
4 Steps in 'How to Solve It' in plain English
|
1. Understanding the problem
2. Devising a Plan 3. Carrying Out the Plan 4. Looking Back |
|
|
|
4 phases of 'How to Solve It' in computer science terms
|
1. analysis and specification phase
2. algorithm development phase 3. implementation phase 4. maintenance phase |
|
|
|
A technique for developing a program in which the problem is divided into more easily handled subproblems, the solutions which create a solution to the overall problem
|
Top-down design
|
|
|
|
Named items in a class; can be data or subprograms
|
fields
|
|
|
|
Bundling data and actions so that the logical properties of data and actions are separated from the implementation details
|
encapsulation
|
|
|
|
A statement used to alter the normally sequential flow of control
|
control structure
|
|
|
|
The formal grammar rules governing the construction of valid instructions
|
syntax
|
|
|
|
The set of rules that gives the meaning of instructions in a language
|
semantics
|
|
|
|
A program that translates a high-level language program into machine code
|
compiler
|
|
|
|
A program that inputs a program a high-level language and directs the computer to perform the actions specified in each statement
|
interpreter
|
|
|
|
A sequence of identifiers, separated by compatible operators, that evaluates to true or false
|
Boolean expression
|
|
|
|
Looking for an item in an already sorted list by eliminating large portions of the data on each comparison
|
binary search
|
|
|
|
A reference to a stored value relative to the program making the reference
|
logical address
|
|
|
|
An actual address in memory
|
physical address
|
|
|
|
A fixed-size portion of main memory that holds a process page
|
frame
|
|
|
|
A fixed-size portion of a process that is stored into a memory frame
|
page
|
|
|
|
The amount of time given to each process in the round-robin CPU scheduling algorithm
|
time slice
|
|
|
|
A specification of the logical structure of data in a database
|
schema
|
|
|
|
Ensuring that data is protected from unauthorized access
|
Confidentiality
|
|
|
|
Ensuring that data can be modified only by appropriate mechanisms
|
Integrity
|
|
|
|
The degree to which authorized users can access information for legitimate purposes
|
Availability
|
|
|
|
A behavorial approach to determining whether a computer is intelligent
|
Turing test
|
|
|
|
The equality of two systems based on their results
|
Weak equivalence
|
|
|
|
The equality of two systems based on their results and the process by which they arrive at those results
|
Strong equivalence
|
|
|
|
Developing a model of a complex system and experimenting with the model to observe the results
|
simulation
|
|
|
|
A malicious, self-replicating program that embeds itself into other code
|
virus
|
|
|
|
A malicious, stand-alone program that often targets network resources
|
worm
|
|
|
|
A malicious program disguised as a benevolent resource
|
Trojan horse
|
|
