| Terms |
Definitions |
|
Confirmatio
|
Supporting arguments
|
|
DAG
|
directed acyclic graph
|
|
in the cell
|
endocytosis
|
|
3 major html tags
|
htmlheadbody
|
|
FIFO
|
first-in, first-out; describes the ordering of a queue.
|
|
luddites
|
people who destroyed computers becuase they were losing their jobs
|
|
antibiotics were once considered wonder drugsbut we now knowt that they are not_________ for all physical alliments
|
panacea
|
|
queue
|
a data structure representing a sequence of items, which are removed in the same order as they were inserted.
|
|
Fallacy
|
an argument constructed with an improper inference
|
|
Arithmetic
|
cause the arithmetic/logic unit to perform a computation
|
|
int
|
only integers, number signifies number of bytes, intmin and intmax, takes numbers out of range and stores as the closest number in range, arithmetic involving different integer types is always illegal
|
|
Mars Orbiter
|
Destroyed due to unit conversion (US/Metric)
|
|
digital computer
|
info processing and storage occurs using a symbolic representation of the data. Process and store info as a discrete pattern of electrical charges
|
|
rehash
|
to apply a different hashing function to a key when a collision occurs
|
|
pattern
|
a representation of a class of objects, containing some constant elements in relation to variable elements
|
|
Big O
|
an abstracted function that describes the amount of computer time or memory space rquired by an algorithm, as a function of problem size. For problems larger than a certain size, the actual time or space required will be less than the Big O multiplied by some constant.
|
|
An Argument
|
connected series of statements to establish a definite proposition
|
|
spider
|
used by search engines to index websites for a given host
|
|
gate
|
an electronic device that operates on a collection of binary inputs to produce a binary output
|
|
An occurrence of ’this’ in a static method will generate a compiler error.
|
TRUE
|
|
Pixels
|
The smallest addressable unit of light on a
computer monitor. Pixel is a concatenation of
picture element.
|
|
the movement, or diffusion of water across a selectiveley permeable membrane
|
osmosis
|
|
operating system software
|
Controls the basic input/output and memory operations of the computer
|
|
constructive
|
describes a function that makes a new data structure but does not modify its arguments.
|
|
binary heap
|
a data structure that implements a complete binary tree within an array, such that every parent node has a value that is less than the value of either of its children
|
|
what causes transitions of states?
|
user action
satisfies event standards
timed event
|
|
r-permutation
|
An ordering of an r-element subset of n distinct elements
|
|
Immediate addressing
|
where the operand is a constant within the instruction itself, for addi, lui,... op, rs, rt, imm
|
|
Upcasting is always legal and can be done without an explicit cast.
|
TRUE
|
|
.java
|
File extension for the jave files that you create.
|
|
The editorial on city gov't was so unfair and biased tht it ammounted to __ of all the electee officicals of this community
|
defamation
|
|
Describe MEO:
|
An elliptical earth orbit rather than circular, primarily used for communication at the poles
|
|
assert
|
This works by checking if a statement is true or false. If it is true, the program continues. If it is false, It will outputs an error message and makes a call to abort(). Agnes describes this as a special mechanism used to make programs fail with an error message in C and C++.
|
|
tail recursive
|
a function whose value either does not involve a recursive call, or is exactly the value of a recursive call.
|
|
Balanced tree
|
a tree in which the heights of subtrees are approximately equal.
|
|
Branching Factor
|
in a search tree, the number of children of a given node. Often, the branching factors of individual nodes will vary, so an average value may be used.
|
|
Dijkstra's algorithm
|
1. Mark starting point as KNOWN with length 0 2. Identify eacn neighbor of start as ADJACENT 3. Set first step of each neighbor to itself 4. Set route length of each neighbor to first step distance 5. While you don't know how to reach all the cities {6. Select adj city with shortest route 7. Identify adj city with shortest route as KNOWN 8. Mark neighbors of new KNOWN city that were DISTANT as ADJACENT 9. update path lengths and record first steps to ADJACENT neighbors of new KNOWN city}
|
|
which type of field would be used to fill in a name
|
text
|
|
for Loops
|
• To repeat one or more statements multiple times, we can use a construct known as a for loop.
• Syntax:
for (<initialization>; <continuation test>; <update>) }
<one or more statements>
}
example:
public static void writeL() {
for (int i = 0; i < 7; i++) {
System.out.println("|");
}
System.out.println("+----------");
}
|
|
byte
|
8 bits, smallest piece of memory on a computer
|
|
Define FDMA, TDMA, and CDMA.
|
Frequency Division Multi-Access: Forms the basis for broadcast radio, the underlying principle arises from the physics of transmission: a set of radio stations can transmit electromagnetic signals simultaneously without interference provided they each use a separate channel (i.e., carrier frequency) Time Division Multi-Access: The chief alternative to FDMA is less esoteric than FDMA and does not rely on special properties of electromagnetic energy. Instead, multiplexing in time simply mean transmitting an item form one source, then transmitting an item from another source and so on. Code Division Multi-Access: Unlike FDM and TDM, CDMA does not rely on physical properties, such as frequency or time. Instead, CDMA relies on interesting mathematical idea: value form orthogonal vector spaces can be combined and separated without interference. The particular form used in the telephone network is easiest to understand. Each send is assigned a unique binary code that is known as a chip sequence. Chip sequences are selected to be orthogonal vectors (the dot product of any two chip sequences are zero.) At any point in time, each sender has value to transmit V. The senders multiply CxV and transmit the results. To extract the value V, a receiver multiplies the sum by C.
|
|
depth-first search
|
a search in which children of a node are considered (recursively) before siblings are considered.
|
|
Abstract Data Type
|
A description of operations on a data type that could have multiple possible implementations.
|
|
Reflexive
|
A relation R on set A is reflexive if (a, a) ∈ R, ∀a ∈ A.
|
|
In a Java GUI, a Container would use a LayoutManager to organize
the layout of its Components.
|
TRUE
|
|
Name the 2 mediums used to transmit Electromagnectic energy:
|
Terrestrial Radio, Satellite
|
|
minimum spanning tree
|
a tree formed from the nodes of a graph and a subset of its edges, such that all nodes are connected and the total cost of the edges is minimal
|
|
Universal generalization
|
P(d) for any d∈D / ∴ ∀xP(x) , X∈D
|
|
Name some general characteristics of HTML.
|
uses a textual representation; describes apages that contain multimedia; follows a declarative rather than procedural paradigm; provides markup specifications instead of formatting; allows a document to include metadata
|
|
PC-relative addressing and where
|
where the address is the sum of the PC and a constant in the instructionBRANCHES
|
|
Step 4: Testing and Debugging
|
• A bug is an error in your program.
• Debugging involves finding and fixing the bug
• Testing – trying the programs on a variety of inputs –
helps us to find the bugs.
|
|
How fast is the speed of the speed of light?
|
3 x10^8 meters / second
|
|
When is the body of a for loop executed?
|
Only when the test is true.
(the for loop will continue to do test, body, update until the test is false)
|
